coq-club AT inria.fr
Subject: The Coq mailing list
List archive
[Coq-Club] Looking for an efficient implementation of simply typed lambda calculus
chronological Thread
- From: S�bastien Hinderer <Sebastien.Hinderer AT loria.fr>
- To: Coq <coq-club AT pauillac.inria.fr>
- Subject: [Coq-Club] Looking for an efficient implementation of simply typed lambda calculus
- Date: Tue, 22 Mar 2005 18:22:04 +0100
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
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
- [Coq-Club] Looking for an efficient implementation of simply typed lambda calculus, Sébastien Hinderer
Archive powered by MhonArc 2.6.16.