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
ambitious proposal: polymorphic arithmetics
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-04-06 (16:59)
From: Andreas Rossberg <rossberg@p...>
Subject: Re: [Caml-list] ambitious proposal: polymorphic arithmetics
William Lovas wrote:
> (This argument breaks down in
> the face of code which relies on abstract types to enforce modularity -- in
> such cases, incomparability can become "the rule" rather than the
> exception, putting =, <, etc. on the same footing as +, -, etc.)

In fact, the polymorphic approach would make abstract types comparable 
if their representation is, hence the idea of (non-parametric) 
polymorphic operations of this sort slaps right in the face of type 
abstraction and encapsulation, which are high values of ML.


   - Andreas

Andreas Rossberg,

Let's get rid of those possible thingies!  -- TB