On 6 February 2011 19:41, Andrew Coppin <andrewcop...@btinternet.com> wrote: . (E.g., the > compiler can't even determine whether a binding is recursive or not for > itself. You have to say that manually.) It seems a very unecessarily > complicated and messy language - which makes the name rather ironic.
Erm - nope. Sure you haven't mixed OCaml and Clean to get OCClaeman? Clean is a very clean language. The only thing I got tripped up on were uniqueness and strict annotations (thanks to Richard O'Keefe above in the thread, for useful clarification). _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
