On Feb 27, 2010, at 02:52, Guillaume Yziquel wrote:
I've been struggling to have a type system where I could do the
following subtyping:
'a t1 :> t2 and t2 :> 'a t1
Hm, what do you mean? Subtyping ought to be reflexive and
antisymmetric (although the latter is rarely proved for most type
systems), which means that your two inequations will hold if and only
if 'a t1 = t2, regardless of recursive types.
/Andreas
_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
