Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] Polymorphic Variants and Number Parameterized Typ es
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Pascal Cuoq <pascal.cuoq@i...>
Subject: Re: [Caml-list] Polymorphic Variants and Number Parameterized Typ es 
Neel Krishnaswami wrote:

> There's no recursion in the module system because that would break
> the termination guarantee. If you think of modules as records, and
> functors as lambda abstractions, you can see that the module system
> defines a simply-typed lambda calculus. As you've noticed with C++, 
> adding recursion to it would mean you can write nonterminating module
> expressions. (All this is wonderfully clearly explained in the paper, 
> "A modular  module system".)

I'm not sure about "simply-typed". Did the situation change since
that of http://caml.inria.fr/archives/199907/msg00027.html ?

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