LISP and Functional Programming 1982: Pittsburgh, PA, USA

Session 1

• R. J. M. Hughes: Super Combinators: A New Implementation Method for Applicative Languages. 1-10
• Steven S. Muchnick, Neil D. Jones: A Fixed-Program Machine for Combinator Expression Evaluation. 11-20
• Richard Kennaway, M. Ronan Sleep: Expressions as Processes. 21-28

Session 2

• Corrado Böhm: Combinatory Foundation of Functional Programming. 29-36
• Gary Feldman: Functional Specifications of a Text Editor. 37-46
• Valentin F. Turchin, Robert M. Nirenberg, Dimitri V. Turchin: Experiments with a Supercompiler. 47-55
• Michael J. Wise: A Parallel Prolog: The Construction of a Data Driven Model. 56-66
• Christopher D. S. Moss: How to Define a Language Using PROLOG. 67-73
• Paul R. Eggert, D. Val Schorre: Logic Enhancement: A Metho for Extending Logic Programming Languages. 74-80

Session 3

• Raymond L. Bates, David Dyer, Johannes A. G. M. Koomen: Implementation of Interlisp on the VAX. 81-87
• Martin L. Griss, Eric Benson, Gerald Q. Maguire Jr.: PSL: A Portable LISP System. 88-97
• Guy L. Steele Jr.: An Overview of Common Lisp. 98-107
• Rodney A. Brooks, Richard P. Gabriel, Guy L. Steele Jr.: S-1 Common Lisp Implementation. 108-113
• Jonathan Rees, Norman Adams: T: A Dialect of Lisp or, LAMBDA: The Ultimate Software Tool. 114-122

Session 4

• Richard P. Gabriel, Larry Masinter: Performance of Lisp Systems. 123-142
• Claudio Gutiérrez: Prolog Compared with Lisp. 143-149
• Simon L. Peyton Jones: An Investigation of the Relative Efficiencies of Combinators and Lambda Expressions. 150-158
• Jeffrey L. Dawson: Improved Effectiveness from a Real Time Lisp Garbage Collector. 159-167
• Paul Hudak, Robert M. Keller: Garbage Collection and Task Deletion in Distributed Applicative Processing Systems. 168-178

Session 5

• Peter Henderson: Functional Geometry. 179-187
• Michael P. Georgeff: A Scheme for Implementing Functional Values on a Stack Machine. 188-195
• Jon L. White: Constant Time Interpretation for Shallow-bound Variables in the Presence of Mixed SPECIAL/LOCAL Declarations. 196-200
• Gyula Magó: Data Sharing in an FFP Machine. 201-207
• Eiichi Goto, T. Soma, N. Inada, Tetsuo Ida, M. Idesawa, Kei Hiraki, M. Suzuki, Kentaro Shimizu, B. Philipov: Design of a Lisp Machine - FLATS. 208-215

Session 6

• William D. Clinger: Nondeterministic Call by Need is Neither Lazy Nor by Name. 226-234
• A. Toni Cohen, Thomas J. Myers: Toward an Algebra of Nondeterministic Programs. 235-242
• David B. MacQueen, Ravi Sethi: A Semantic Model of Types for Applicative Languages. 243-252
• Robert Cartwright, James E. Donahue: The Semantics of Lazy (and Industrious) Evaluation. 253-