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
Ocaml library implementing equivalence classes and partial orders
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: nari <nari@i...>
Subject: Ocaml library implementing equivalence classes and partial orders

I was wondering why there has been no Ocaml library implementation
for equivalence and partial order relations (at least over basic types)
as we have a 'Set' library over ordered types.

For example,
an equivalence class  module may export functions such as

type t
val create_equiv:  Set.t -> eqrelation.t -> t
val query_eqclass: t -> Set.elt -> Set.t

If the user specifies a set of elements and the user defines the
equivalence relation
on those elements, the function should return a datatype that
can be further queried for equivalence classes of individual elements.

Is there any specific reason why such a generic library may be
hard to implement? If not, are there any implementation issues we
need to be concerned about.

Narayanan Krishnamurthy (Nari)
ASP Advanced Tools and Methodology
Motorola SPS Architecture and Systems Platforms
Motorola Inc. Semiconductor Products Sector
7700 W. Parmer Lane, Austin, TX 78729

Loc/MD: TX32/PL30         _
email : /   \ email:
Ph    : (512) 996-4863  |O O| Fax : (512) 996-7432
************************| I |*********************************************
                        \ o /