John Max Skaller a écrit :

> I'm confused. I think you mean *type inference* is difficult
> if you want polymorphic recursion?

I'am confused too. We do want type inference, do we not ? And
polymorphic recursion makes type inference undecidable. 

- Haskell allows full polymorphic recursion but requires providing
explicitly a type signature (in fact, in Haskell you always provide
type annotations even if it is not required)

- Caml now allows a restricted kind of polymorphic recursion but keeps
most of the type inference (there were a few constructions in Caml
which already required type annotations, I don't know yet how
polymorphic methods interfer with type inference, I suppose the Caml
team can answer that question) 


        Diego Olivier

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners