Thanks for the thorough answer, Dan.
That's exactly what I was looking for.
During further search, I stumbled on an excellent introductory
description of recursive types in a draft of Robert Harper's book
Programming Languages: Theory and Practice
http://www.cs.cmu.edu/~rwh/plbook/book.pdf
-- vi
Dear All,
Recently, I've been playing with self-application and fixed-point
combinators definition in Haskell.
It is possible to type them in Haskell using recursive types.
I took Y U combinators:
newtype Rec a = In { out :: Rec a - a }
u :: Rec a - a
u x = out x x
y :: (a - a) - a
y f
Dear All,
Recently, I've been playing with self-application and fixed-point
combinators definition in Haskell.
It is possible to type them in Haskell using recursive types.
I took Y U combinators:
newtype Rec a = In { out :: Rec a - a }
u :: Rec a - a
u x = out x x
y :: (a - a) - a
y f
On Friday 25 December 2009 11:35:38 am Vladimir Ivanov wrote:
Dear All,
Recently, I've been playing with self-application and fixed-point
combinators definition in Haskell.
It is possible to type them in Haskell using recursive types.
I took Y U combinators:
newtype Rec a = In { out
