jaffer@zurich.ai.mit.edu (Aubrey Jaffer) (03/29/91)
This message announces the availablility of Scheme release scm2a. All bugs that were reported have been fixed. Speed of execution has been improved by about 40%. Error detection and reporting have been much improved. Scm conforms to Revised^3.99 Report on the Algorithmic Language Scheme [Draft August 31, 1989] and the IEEE spec. Scm runs under Unix, VMS, and Microsoft C on IBM PCs. Scm is interpreted and has 30 bit immediate integers for numbers in version 2a. Tail recursion is implemented for interpreted code. Scm uses and garbage collects off the C-stack. This allows routines to be written in C without regard to GC visibility. Full call-with-current-continuations are supported except on VAX and SUN4. Stack (escape) call-with-current-continuations are supported on all machines. ASCII and EBCDIC are supported. Documentation is included on the internal representation and how to extend or include scm in other programs. ftp altdorf.ai.mit.edu(18.43.0.246) (anonymous) cd archive/scm This directory contains the distribution version 2a of scm. The file `scm2a.exe' is an IBM PC executable of scm. `scm2a.shar' is a shar file of the C code distribution. `scm2a.tar.Z' is a compressed tar file of the C code distribution. `test.scm' is Scheme code which tests conformity with the IEEE spec. It is included in the shar and tar files. I will include additions that are mailed to me. Be sure to get and read the GNU General Public License (public.lic) included in the shar and tar files. To receive an IBM PC floppy disk with the distribution and executable files send $50 to Aubrey Jaffer, 84 Pleasant St. Wakefield MA 01880, USA.