[Haskell-cafe] IO is not a monad

Yitzchak Gale gale at sefer.org
Thu Feb 8 06:18:33 EST 2007

Lennart Augustsson wrote:
> I think seq is funny because it is not lambda definable.

Does the set of computable functions on the natural
numbers defined by the lambda calculus augmented
with seq have higher Turing degree than the
set of classical computable functions?


More information about the Haskell-Cafe mailing list