On Thu, 2004-04-29 at 22:40, Remi Vanicat wrote:

> > But this is not correct!  Consider
> >
> >   type de = [`D | `E of de];;
> >   
> >   type def = [`D | `E of def | `F of def];;

> In fact, your code will do what you want if you don't define your type
> as recursive but as polymorphic :
> 
> type 'a de = [`D | `E of 'a];;
>   
> type 'a def = [`D | `E of 'a | `F of 'a];;


type 'a de' = [`D | `E of 'a]
type 'a def' = ['a de' | `F of 'a]

type de = 'a de' as 'a
type def = 'a def' as 'a



-- 
John Skaller, mailto:skaller@users.sf.net
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language http://felix.sf.net



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