feeley@chaos.cs.brandeis.edu (Marc Feeley) (12/31/90)
Archive-name: languages/scheme/gambit/1990-12-23 Archive: acorn.cs.brandeis.edu:/dist/gambit1.5.tar.Z [129.64.3.8] Original-posting-by: feeley@chaos.cs.brandeis.edu (Marc Feeley) Original-subject: Gambit 1.5 now available Reposted-by: emv@ox.com (Edward Vielmetti) Gambit 1.5 annoucement ====================== The new version of the Gambit Scheme system is now available. A couple of minor bugs have been fixed from version 1.4. The support for parallelism has been greatly improved. The compiler now generates very efficient code for futures. There is also a new tool, gsx, for visualizing processor activity on the GP1000 parallel computer. You can get a copy of Gambit (release 1.5) via anonymous ftp from the machine acorn.cs.brandeis.edu (address 129.64.3.8). It is in the /dist directory and is compressed (about 400K). Don't forget to set binary mode when you transfer the system. For those who don't know about Gambit, here is a repeat of the previous annoucement: Gambit is an optimizing Scheme compiler/system under development at Brandeis university. It was designed with efficiency and portability as primary concerns. The current release has a back end which generates M68020 code that runs on M680x0 based unix machines (SUN3, HP300, BBN GP1000, etc). Gambit supports the IEEE Scheme standard and the `future' construct. Only exact arithmetic is implemented (bignums and ratnums but no flonums). The system contains an interpreter that offers a minimal debugging environment. When compiled with Gambit, Gabriel's benchmarks take (on the average) 50% and 70% of the run time required by code compiled with MIT-Scheme and T3.1, respectively. Please give me some feedback on the system if you do try it out. Marc -- feeley@cs.brandeis.edu