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] Recursive modules and polymorphic recursion
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-06-26 (13:15)
From: brogoff@s...
Subject: Re: [Caml-list] Recursive modules and polymorphic recursion
On Thu, 26 Jun 2003, Xavier Leroy wrote:
> As the design document explains
> (,
> the current implementation of recursive modules is such that a definition
>         module rec A : SIGA = StructA
> is accepted only if all value components of SIGA are functions. 

I guess I was thrown by the fact that the similar

module rec ASet : Set.S with type elt = A.t = Set.Make(A) 
and A : (* ... etc ...*) 

is accepted, and by the fact that I rarely comprehend this kind of stuff by 
reading alone, but instead have to read/hack/ask/read/... 

> The decision to integrate recursive modules in 3.07 was taken on the
> grounds that imperfect recursive modules are still better than no
> recursive modules at all.  Be patient: perfection takes time.

Of course. I'm glad that decision was taken, and I think what's there is 
pretty good, even if imperfect. I expect that perfection would take forever, 
which will certainly exhaust anyone's patience. 

-- Brian

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: