[Haskell-cafe] Re: Haskell w/ delimited continuations

Taral wrote in article in gmane.comp.lang.haskell.cafe:

On Sat, Feb 23, 2008 at 1:05 AM, wrote:

...

reset ((\x -> x + x) (shift f f))

This one doesn't typecheck, since you can't unify the types (a -> r) and r.

Some type systems for delimited continuations, such as Danvy and Filinski's (http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz; DIKU TR 89/12), allows changing the answer type and admits this code. -- Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig God exists since mathematics is consistent, and the devil exists since its consistency cannot be proved. -- Hermann Weyl.