[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2007-09-11 (00:17) |
From: | Jonathan Bryant <jtbryant@v...> |
Subject: | Basic Polymorphic Typechecking |
Caml-list, Does anybody know of/have a link to/copy of an implementation of the type system in the Cardelli paper (http://www.lucacardelli.name/ Papers/BasicTypechecking.pdf) or an equally basic type inference implementation in Caml/ML/Haskell? I'm rather lost trying to follow the Modula-2 code given in the paper as well as the Perl version linked to on Wikipedia because I don't know either language. I've tried looking at Caml-Light as a reference, but it implements several non-trival extensions, so it doesn't serve as a good reference for a first time implementing the algorithm. Thanks, --Jonathan Bryant