Version française
Home     About     Download     Resources     Contact us    
Browse thread
Sorted list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: skaller <skaller@u...>
Subject: Re: [Caml-list] Sorted list
On Sat, 2007-08-04 at 14:23 +0200, Philippe Wang wrote:
> skaller wrote:
> > On Sat, 2007-08-04 at 12:29 +0200, Philippe Wang wrote:
> >   

> > You cannot do that! compare function must be a total order.
> >   
> Why not ?

> It works ! ... Or did I miss something ?

Yes. Read the manual: the ordered type mandates a total order.

Just because the Ocaml type system is too weak too represent this
constraint does not remove your obligation to meet it.

Whether or not it happens to work with the current implementation
isn't relevant.  

-- 
John Skaller <skaller at users dot sf dot net>
Felix, successor to C++: http://felix.sf.net