
I suspect this proposal was not made in good faith. I feel like it was meant to make fun of my list singleton proposal. In spite of that, I am in favor of this proposal. One of the (very minor!) problems with lists in Haskell is that they can’t be documented with Haddock because they’re part of the syntax. For example, if you search Hoogle for `(:)` or `a -> [a] -> [a]` you won’t find the venerable list constructor. You will find `cons` from the `extra` package, which I think suggests that this proposal is a good idea. +1
On Sep 11, 2019, at 4:13 AM, Oliver Charles
wrote: On Wed, Sep 11, 2019 at 7:36 AM Helmut Schmidt
wrote: I can't be the only that wants this function, right?
You're not the only one! I would also like this function. In fact, only yesterday I found myself writing
( x : ) <$> recurse xs
I would have preferred
cons x <$> recurse xs
+1 to adding cons :: x -> [x] -> [x] to Data.List.
Ollie _______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries