English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
[Caml-list] Recursive types and functors.
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-03-26 (08:57)
From: David Brown <caml-list@d...>
Subject: Re: [Caml-list] Recursive types and functors.
On Wed, Mar 26, 2003 at 09:25:13AM +0100, Jean-Christophe Filliatre wrote:

> A (too) naive solution could be  to make a polymorphic instance of the
> Set module (either  by adding an argument 'a  everywhere in signatures
> OrderedType  and S,  or  by  copying the  functor  body and  replacing
> Ord.compare by compare); then you have polymorphic sets, say 'a Set.t,
> balanced using compare, and you can define

Actually, my real case doesn't use sets, but a dynamic array
implementation I made myself.  I originally needed a functor because I
needed an empty value to fill in past the used elements of the real

What I ended up doing was filling in those elements with 'Obj.magic 0'.
I don't really like walking outside of the type system, but since I
never return them, I don't think it will be a problem.

I still may try to figure out how to do it with the multiple functor
approach, just so to learn how to do it.


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