default search action
Lisp and Symbolic Computation, Volume 5
Volume 5, Number 1-2, May 1992
- Al Davis:
Mayfly: A General-Purpose, Scalable, Parallel Processing Architecture. LISP Symb. Comput. 5(1-2): 7-48 (1992) - John S. Conery:
Parallel Logic Programs on the Mayfly. LISP Symb. Comput. 5(1-2): 49-72 (1992) - Robert R. Kessler, Harold Carr, Leigh Stoller, Mark R. Swanson:
Implementing Concurrent Scheme for the Mayfly Distributed Parallel Processing System. LISP Symb. Comput. 5(1-2): 73-93 (1992) - Mark R. Swanson:
Concurrent Scheme Reference. LISP Symb. Comput. 5(1-2): 95-104 (1992) - John D. Evans, Robert R. Kessler:
DPOS: A Metalanguage and Programming Environment for Parallel Processing. LISP Symb. Comput. 5(1-2): 105-123 (1992)
Volume 5, Number 3, September 1992
- Gang Cheng, Zhang Yun-Zheng:
A "Functional + Logic" Programming Language in Interpretation-Compilation Implementation. LISP Symb. Comput. 5(3): 133-156 (1992) - Henry G. Baker:
A Decision Procedure for Common Lisp's SUBTYPEP Predicate. LISP Symb. Comput. 5(3): 157-190 (1992) - Andrew W. Appel, Zhong Shao:
Callee-Save Registers in Continuation-Passing Style. LISP Symb. Comput. 5(3): 191-221 (1992) - Alan Borning, Bjørn N. Freeman-Benson, Molly Wilson:
Constraint Hierarchies. LISP Symb. Comput. 5(3): 223-270 (1992) - Guy Lapalme, Mario Latendresse:
A Debugging Environment for Lazy Functional Languages. LISP Symb. Comput. 5(3): 271-287 (1992)
Volume 5, Number 4, 1992
- R. Kent Dybvig, Robert Hieb, Carl Bruggeman:
Syntactic Abstraction in Scheme. LISP Symb. Comput. 5(4): 295-326 (1992) - Charles Consel, Olivier Danvy:
Partial Evaluation in Parallel. LISP Symb. Comput. 5(4): 327-342 (1992) - Shinn-Der Lee, Daniel P. Friedman:
First-Class Extents. LISP Symb. Comput. 5(4): 343-375 (1992)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.