My statement was just: There are several papers on the semantics of Haskell, but none of these papers treats recursive datatypes. I am looking for a treatment of the semantics of recursive datatypes in Haskell, preferably by translation to known meta-languages like FPC or system F.
Till
Keean Schupke wrote:
When I looked through several papers about Haskell semantics, I found that
recursive datatypes have been omitted.
I believe fairly strong reasons have been given why this would be a bad thing, and
would result in problems for type-inference. Haskell has iso-revursive types, which if
defined using the 'newtype' directive should have no run-time cost.
Keean.
-- Till Mossakowski Phone +49-421-218-4683 Dept. of Computer Science Fax +49-421-218-3054 University of Bremen [EMAIL PROTECTED] P.O.Box 330440, D-28334 Bremen http://www.tzi.de/~till _______________________________________________ Haskell mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell
