LISP program

Also found in: Dictionary.
Related to LISP program: LISP compiler
Graphic Thesaurus  🔍
Display ON
Animation ON
  • noun

Words related to LISP program

a program written in LISP

References in periodicals archive ?
THEOREM 1.1 There is a symbolic on-line computation that can be performed by an impure Lisp program in such a way that at most O(n) primitive operations are needed to produce the first n outputs, but for which every pure Lisp program must perform (for some input sequences) at least [Omega](n log n) primitive operations to produce the first n outputs.
Every symbolic on-line computation that can be performed by an impure Lisp program in such a way that at most T(n) primitive operations are needed to produce the first n outputs can be performed by a pure Lisp program that performs at most O(T(n) log T(n)) primitive operations (for all inputs sequences and for all values of n) to produce the first n outputs.
When we speak of the "number of steps" in a computation by either a pure or an impure Lisp program, we mean the number of primitive operations (such as CONS, CAR, RPLACA, and EQ) executed by the program, using conventional operational semantics.
This is possible, in part, because Lisp programs are represented as Lisp data objects and partly because there are places during the scanning, compiling and execution of Lisp programs where user-written programs are given control.
Understanding the performance implications of a Lisp program requires understanding the program in a deeper way, and at a lower level of abstraction, than simply understanding what a Lisp program does.
The modularity inherent in most Lisp programs frees different parts of the program to be written with differing degrees of attention to detail.
Johnson estimates the cost in additional CPU logic of implementing fast traps is only about 1.6% in the case of SPARC, while the increase in performance for some Lisp programs could be as much as 35%.
To this end, some Lisp programs will be statically compiled and linked with libraries that contain the functionality to perform Lisp-based operations.
Wadler [1976] reported that typical Lisp programs spend from 10% to 30% of their time collecting.
A memory allocation profiler for C and Lisp programs. In Proceedings of Summer 1988 USENIX Conference (San Francisco, June).
This program was capable of automatically specializing Lisp programs. One goal of this effort was to generate specializations of the LM-Prolog interpreter, each of which could only interpret a single LM-Prolog program.
Lisp programs are encoded as symbolic expressions--the original base of data types for Lisp--so a program can construct other programs and execute them, and a program can observe its own representation, and modify it during execution.
We have reimplemented all such facilities -- sometimes by writing the underlying primitives for the facility in C and then linking that code back into our Common Lisp programs. Lisp interfaces are then written to these primitives that mimic the interfaces to the Common Lisp facilities, thus allowing us to use familiar tools while achieving garbage-free execution.
First, Common Lisp programs are represented, before compilation, as list structures that can be readily decomposed and transformed.
It is advisable to write as many large LISP programs as time permits.