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
typing dynamic typing
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-01-24 (18:06)
From: Ethan Aubin <ethan.aubin@p...>
Subject: typing dynamic typing
Hi, I found 'Typing Dynamic Typing' by Arthur Baars and Doaitse
Swierstra (http://www.cs.uu.nl/people/arthurb/dynamic.html) the other
day and am wondering if there is a trick to encode a universally
qualified type constructor. I.e. section 3 of the paper uses datatype 

Equal a b = forall f . f a -> f b

as a proof that types a and b are equal. Is there a transliteration of
this haskell into ocaml? Thanks - EA