* typing dynamic typing
@ 2005-01-24 18:06 Ethan Aubin
0 siblings, 0 replies; only message in thread
From: Ethan Aubin @ 2005-01-24 18:06 UTC (permalink / raw)
To: caml-list
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2005-01-24 18:06 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2005-01-24 18:06 typing dynamic typing Ethan Aubin
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox