From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Delivered-To: caml-list@yquem.inria.fr Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by yquem.inria.fr (Postfix) with ESMTP id 82A78BC32 for ; Tue, 15 Mar 2005 21:59:41 +0100 (CET) Received: from salt.cs.brown.edu (salt.cs.brown.edu [128.148.32.122]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id j2FKxeAF032401 for ; Tue, 15 Mar 2005 21:59:41 +0100 Received: from localhost (localhost [127.0.0.1]) by salt.cs.brown.edu (Postfix) with ESMTP id 7CF4E3863DD for ; Tue, 15 Mar 2005 15:59:40 -0500 (EST) Received: from salt.cs.brown.edu ([127.0.0.1]) by localhost (salt [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 28095-02 for ; Tue, 15 Mar 2005 15:59:40 -0500 (EST) Received: from null.cs.brown.edu (null.cs.brown.edu [128.148.38.190]) by salt.cs.brown.edu (Postfix) with ESMTP id 6B7FD3863D3 for ; Tue, 15 Mar 2005 15:59:40 -0500 (EST) Received: from miette.cs.brown.edu (miette [128.148.38.66]) by null.cs.brown.edu (Postfix) with ESMTP id 5CCA4148010 for ; Tue, 15 Mar 2005 15:59:40 -0500 (EST) Received: by miette.cs.brown.edu (Postfix, from userid 3125) id E85D3180DE; Tue, 15 Mar 2005 15:59:39 -0500 (EST) Date: Tue, 15 Mar 2005 15:59:39 -0500 From: Manos Renieris To: caml-list@yquem.inria.fr Subject: Re: [Caml-list] Looking for an efficient implementation of simply typed lambda calculus Message-ID: <20050315205939.GA18717@cs.brown.edu> Reply-To: Manos Renieris References: <200503070020.53784.jon@jdh30.plus.com> <20050307.220107.85397271.eijiro_sumii@anet.ne.jp> <20050308201306.GA22938@yquem.inria.fr> <20050308.173223.38699199.eijiro_sumii@anet.ne.jp> <20050314173127.GA21700@galois> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20050314173127.GA21700@galois> User-Agent: Mutt/1.5.6+20040907i X-Virus-Scanned: by amavisd-new-20030616-p10 (Debian) at cs.brown.edu X-Miltered: at concorde with ID 42374CBC.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; renieris:01 caml-list:01 pierce's:01 upenn:01 bcpierce:01 cheers:01 caml-list:01 beginner's:01 ocaml:01 beginners:01 bug:01 lambda:01 lambda:01 wrote:01 benjamin:01 X-Spam-Checker-Version: SpamAssassin 3.0.2 (2004-11-16) on yquem.inria.fr X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.2 X-Spam-Level: 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