johnson@DEWEY.UDEL.EDU (johnson) (02/21/86)
From: johnson <johnson@dewey.udel.EDU>
Computer Logic, Inc., is seeking a license for an efficient lisp
running on 680XX-based Unix systems.
We are looking for an implementation of lisp that meets the
following criteria:
. source code is available
. runs on 68k-based UNIX machines
. allows loading of modules written in C, or other system-level language
. small and fast (even at the expense of advanced features)
. one-time license available, or nominal run-time environment royalties
. floating-point and integer arithmetic (arbitrary precision is NOT required)
. lisp "impurities" such as: setq, rplaca, rplacd
If you know of any lisp that meets these criteria, please pass us a pointer
to its author.
If YOU own an implementation of lisp, and would like to SELL it to us,
please send us:
. a description of your lisp, including:
. a list of the primitive functions
. the hardware/software requirements for a run-time system
. the hardware/software requirements for building your system from
source code
. some indication of the hard and soft limits of your system
(w/r/t maximum number of objects, number of symbols,
number of numbers, etc.)
. a brief description of any special features that you feel
would expedite software development in your lisp,
{editors, compilers, structured-objects, environment-dumps}
. how many times can you perform (T1 2000) without garbage collection on
a machine with 1048576 bytes of available memory?
(please extrapolate or interpolate from tests run on whatever
machine is available to you; be sure tell us the way that you arrived
at your figure)
when the garbage collection does occur, how long does it take?
. how long does (T2 20) take?
. if your lisp has an iterative construct (do, loop, or prog with goto)
how long does it take to perform (T3 5000)?
Feel free to modify these functions syntactically to allow them to run
in your version of lisp, but please include the modified versions along
with your results. (ps: these functions will run unmodified
in muLISP-85)
Most unix systems provide a means to measure the elapsed time allocated
to a given process (try "man time" on your system). Please give your
times in terms of this quantity. If no such facility is available, be
sure to indicate the conditions under which you ran the benchmark.
(DEFUN T1
(LAMBDA (N)
(COND ((> N 1) (LIST N (T1 (- N 1))))
(T (LIST 1)))))
(DEFUN T2
(LAMBDA (N)
(COND ((< N 2) 1)
(T (+ (T2 (- N 1)) (T2 (- N 2)))))))
(DEFUN T3
(LAMBDA (N)
(LOOP (IF (= N 0) (RETURN)) (SETQ N (- N 1)))))
Please send all description responses to:
Apperson H. Johnson
Computer Logic Inc.
2700 Philadelphia Pike, P.O. Box 9640
Wilmington, De. 19809
{johnson@udel will read any pointers}paf@OBLIO.UUCP (Paul Fronberg) (02/28/86)
You might try SCHEME from the GNU distribution tape. I brought it up on a 5.2 box (68020) by a minor modification of the makefile. Also the price is right considering that this includes source code ($150).