[Haskell-cafe] regex-applicative library needs your help! (algorithmic challenge)

Brandon Allbery allbery.b at gmail.com
Fri Sep 23 07:31:37 CEST 2011

On Wed, Sep 21, 2011 at 20:05, Edward Kmett <ekmett at gmail.com> wrote:

> I usually enforce constraints like this with ! patterns in the
> constructors, which lets me enforce the fact that at least I know that any
> attempt to define a cycle like this will bottom out, so I can safely think
> only inductive thoughts from there out.

But strictness annotations act at runtime (assignment time); he wants
*compile* time, which puts him into more interesting type territory.

brandon s allbery                                      allbery.b at gmail.com
wandering unix systems administrator (available)     (412) 475-9364 vm/sms
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110923/1cd4a9cf/attachment.htm>

More information about the Haskell-Cafe mailing list