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
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: Krishnaswami, Neel <neelk@c...>
Subject: Re: [Caml-list] Polymorphic Variants and Number Parameterized Typ es
Pascal Cuoq [] wrote:
> 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 ?

Wow! I didn't even know that was possible. I thought that typechecking
record subtyping was decidable...?

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