Re: Module recursion (Was Re: [Caml-list] Re: Haskell-like syntax)

[Markus Mottl <markus@oefai.at>]

On Sun, 16 Mar 2003, brogoff@speakeasy.net wrote:
> > In any case, this seems like a suitable moment for once again suggesting
> > that Claudio Russo's module system as implemented in Moscow ML be
> > integrated into OCaml :-)
> 
> Not quite yet! Google this 
> 
>     dreyer "moscow ml" unsound

Ok, I take back "as implemented in Moscow ML" ;-)

Thanks for the hint!

The unsoundness, however, does not arise from Claudio's thesis, but from
the interaction of generative and applicative functors as implemented in
Moscow ML. In short, if I have understood things correctly, it is possible
to "infect" generative functors with applicativeness by using generative
functor signatures (which only exist in Moscow ML, not SML!) within the
argument signature of applicative functors to essentially eta-expand
passed generative functors.

In any case, there are solutions to this problem. Wouldn't this be a
fine research topic for our OCaml-team? ;-)

Regards,
Markus Mottl

-- 
Markus Mottl                                             markus@oefai.at
Austrian Research Institute
for Artificial Intelligence                  http://www.oefai.at/~markus

-------------------
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