Unlifted data types

[Roman Cheplyaka]

On 11/09/15 06:22, Carter Schonwald wrote:
> Would this allow having a strict monoid instance for maybe, given the
> right hinting at the use site?

That's a fantastic idea, especially if it could be generalized to
Applicative functors, where the problem of "inner laziness" is pervasive.

But that'd be tricky, because functions have the Lifted kind, and so
<*> would have to be crazily levity-polymorphic. (Or is this not crazy?)

Roman

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: OpenPGP digital signature
URL: <http://mail.haskell.org/pipermail/ghc-devs/attachments/20150911/219bace2/attachment-0001.sig>