Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Doubly-linked list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2002-08-27 (13:04)
From: Diego Olivier Fernandez Pons <Diego-Olivier.FERNANDEZ-PONS@c...>
Subject: Re: Polymorphic recursion 9Was Re: [Caml-list] Doubly-linked list)
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 Archives:
Bug reports: FAQ:
Beginner's list: