Version française
Home     About     Download     Resources     Contact us    
Browse thread
MinCaml: an educational compiler for tiny ML subset (documented in Japanese)
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Manos Renieris <er@c...>
Subject: Re: [Caml-list] Looking for an efficient implementation of simply typed lambda calculus
I don't know about the efficiency, but Benjamin Pierce's book
comes with implementations, which include the simply typed lambda
calculus.

http://www.cis.upenn.edu/~bcpierce/tapl/index.html

On Mon, Mar 14, 2005 at 06:31:27PM +0100, S?bastien Hinderer wrote:
> Dear all,
> 
> Has some library been developed to handle simply typed lambda terms ?
> The library should be able to build and reduce terms, in a
> computationally efficient way.
> 
> If you are aware of such a work, many thanks for letting me know.
> 
> Cheers,
> S?bastien.
> 
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs