Barak.Pearlmutter@F.GP.CS.CMU.EDU (12/31/88)
A new release of Oaklisp is available. There are some tiny bug fixes, the emulator should compile properly on machines with 16 bit int C compilers, and bignums, complexes and rationals are fully supported. No flonums, but you can fake them with rationals. The bignums are surprisingly fast, about a factor of 6 slower than T 3.1 at naive factorial of 100. An O((log n)^1.59) algorithm is used for multiplying pairs of really large integers. Not O(log n) Schonhage-Strassen, but at least it's not O((log n)^2). The distribution can be FTPed from host DOGHEN.BOLTZ.CS.CMU.EDU (aka 128.2.222.37), user "anonymous", file "oak/release.tar.Z". Be sure to use binary mode. Bug fixes and reports are appreciated, particularly with regard to portability to odd architectures. A 36 or 48 bit word port would be nice. Requests for tapes from people without FTP will be denied. Oaklisp is unsupported, but we do consult.