From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from weis@localhost) by pauillac.inria.fr (8.6.10/8.6.6) id SAA17923 for caml-redistribution; Tue, 17 Oct 1995 18:49:20 +0100 Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.6.10/8.6.6) with ESMTP id OAA13315 for ; Tue, 17 Oct 1995 14:11:23 +0100 Received: from chalmers.se (chalmers.se [129.16.1.1]) by concorde.inria.fr (8.6.10/8.6.9) with SMTP id OAA22753 for ; Tue, 17 Oct 1995 14:11:18 +0100 Received: from animal.cs.chalmers.se by chalmers.se (5.60+IDA/3.14+gl) id AA28399; Tue, 17 Oct 95 12:27:51 +0100 Received: from lips.cs.chalmers.se (raffalli@lips-be0.cs.chalmers.se [129.16.233.25]) by animal.cs.chalmers.se (8.6.11/8.6.9) with ESMTP id MAA26384 for ; Tue, 17 Oct 1995 12:21:08 +0100 Received: (from raffalli@localhost) by lips.cs.chalmers.se (8.6.11/8.6.9) id MAA05866; Tue, 17 Oct 1995 12:14:32 +0100 Date: Tue, 17 Oct 1995 12:14:32 +0100 Message-Id: <199510171114.MAA05866@lips.cs.chalmers.se> From: Christophe Raffalli To: caml-list@pauillac.inria.fr Subject: Version 1.1 of the bindlib package: a library for abstract syntax Sender: weis with binder. I am please to announce the release 1.1 of the bindlib library for Caml-Light: THE BINLIB PACKAGE ------------------ This is a library for the Caml-Light (and Caml-Special-Light) languages (and Sml-nj soon ... may be) providing reasonable tools to write programs manipulating data structures with binders (like lambda-terms or quantified formulae). It is quite efficient and not too difficult to use (at least for me). I do not know of any available alternative to this package resulting in a code as small, and as efficient (both in memory and speed) ! So give it a try ! The change from the version 1.0 are: ------------------------------------ - Correct a MAJOR BUG: when more than one variable is bound outside of the current sequence of binding, then the version 1.0 does not work at all. This bug has now been corrected. - The library now raises the exception "Binlib_error" instead of "Invalid_argument". - The memory usage has been optimised to take in account binder which binds a variable with no occurrence. In the benchmark this is not visible, but other examples shows an improvement of a factor greater than 2 ! - The library only works for terms with less than 32768 free variables in each sub-term. An exception is raised if you use too many variables. - The library has now been tested on a bigger scale and should be more reliable (I hope). Availability: ------------- It is available from my URL: http://www.logique.jussieu.fr/www.raffalli/index.html#examples Or by ftp: ftp://ftp.logique.jussieu.fr/pub/distrib/raffalli/ ---- Christophe Raffalli Dept. of Computer Sciences Chalmers University of Technology URL: http://www.logique.jussieu.fr/www.raffalli