Proposal: Generalize forever to Applicative

This looks like a no-brainer to me: forever :: Applicative f => f a -> f b forever a = let x = a *> x in x

+1. This is definitely on the list of things we should generalize.
-Edward
On Tue, May 12, 2015 at 1:05 AM, David Feuer
This looks like a no-brainer to me:
forever :: Applicative f => f a -> f b forever a = let x = a *> x in x
_______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries

+1
On Tue, May 12, 2015 at 8:05 AM David Feuer
This looks like a no-brainer to me:
forever :: Applicative f => f a -> f b forever a = let x = a *> x in x _______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries

+1.
On Tue, May 12, 2015 at 3:44 AM Michael Snoyman
+1
On Tue, May 12, 2015 at 8:05 AM David Feuer
wrote: This looks like a no-brainer to me:
forever :: Applicative f => f a -> f b forever a = let x = a *> x in x _______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
_______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries

+1
On 12 May 2015 at 07:05, David Feuer
This looks like a no-brainer to me:
forever :: Applicative f => f a -> f b forever a = let x = a *> x in x
_______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
-- *Λ\ois* http://twitter.com/aloiscochard http://github.com/aloiscochard
participants (8)
-
Alois Cochard
-
Brent Yorgey
-
Dan Burton
-
David Feuer
-
David Luposchainsky
-
Edward Kmett
-
John Wiegley
-
Michael Snoyman