LISP and Functional Programming 1984: Austin, Texas, USA

Session 1

• Rodney A. Brooks, Richard P. Gabriel: A Critique of Common Lisp. 1-8

Session 2

• Robert H. Halstead Jr.: Implementation of Multilisp: Lisp on a Multiprocessor. 9-17
• Christopher T. Haynes, Daniel P. Friedman: Engines Build Process Abstractions. 18-24
• Richard P. Gabriel, John McCarthy: Queue-based Multi-processing Lisp. 25-44

Session 3

• Philip Wadler: Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile Time. 45-52
• Allen Goldberg, Robert Paige: Stream Processing. 53-62
• Françoise Bellegarde: Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield. 63-73
• John S. Givler, Richard B. Kieburtz: Schema Recognition for Program Transformations. 74-84

Session 4

• Pierre Cointe, Xavier Rodet: Formes: an Object and Time Oriented System for Music Composition and Synthesis. 85-95
• Roger B. Dannenberg: Arctic: A Functional Language for Real-Time Control. 96-103
• Mary Sheeran: muFP, A Language for VLSI Design. 104-112

Session 5

• Jérôme Chailloux, Matthieu Devin, Jean-Marie Hullot: LE LISP, a Portable and Efficient LISP System. 113-122
• Gheorghe Stefan, Aurel Paun, Virgil Bistriceanu, Andy Birnbaum: DIALISP - A Lisp Machine. 123-128
• Raymond L. Bates, David Dyer, Mark Feber: Recent Developments in ISI-Interlisp. 129-139
• Hiroshi G. Okuno, Ikuo Takeuchi, Nobuyasu Ohsato, Yasushi Hibino, Kazufumi Watanabe: TAO: Afst Interpreter-Centered Lisp System on Lisp Machine ELIS. 140-149
• Skef Wholey, Scott E. Fahlman: The Design of an Instruction Set for Common Lisp. 150-158

Session 6

• W. R. Stoye, T. J. W. Clarke, A. C. Norman: Some Practical Methods for Rapid Combinator Reduction. 159-166
• Paul Hudak, Benjamin Goldberg: Experiments in Diffused Combinator Reduction. 167-176
• Ralph E. Griswold: Expression Evaluation in the ICON Programming Language. 177-183

Session 7

• Robin Milner: A Proposal for Standard ML. 184-197
• David B. MacQueen: Modules for Standard ML. 198-207
• Luca Cardelli: Compiling a Functional Language. 208-217
• Lennart Augustsson: A Compiler for Lazy ML. 218-227

Session 8

• Emmanuel Saint-James: Recursion is More Efficient than Iteration. 228-234
• David A. Moon: Garbage Collection in a Large Lisp System. 235-246
• Henry Lieberman: Steps Toward Better Debugging Tools for Lisp. 247-255
• Rodney A. Brooks: Trading Data Space for Reduced Time and Code Space in Real-Time Garbage Collection on Stock Hardware. 256-262

Session 9

• Takuya Katayama: Type Inference and Type Checking for Functional Programming Languages: A Reduced Computation Approach. 263-272
• Alberto Pettorossi: A Powerful Strategy for Deriving Efficient Programs by Transformation. 273-281
• Walter Dosch, Bernhard Möller: Busy and Lazy FP with Infinite Objects. 282-292
• Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand: Continuations and Coroutines. 293-298

Session 10

• Herbert Stoyan: Early LISP History (1956-1959). 299-310
• Gert Smolka: Making Control and Data Flow in Logic Programs Explicit. 311-322
• Yonathan Malachi, Zohar Manna, Richard J. Waldinger: TABLOG: The Deductive-Tableau Programming Language. 323-330

Session 11

• Jim des Rivières, Brian Cantwell Smith: The Implementation of Procedurally Reflective Languages. 331-347
• Daniel P. Friedman, Mitchell Wand: Reification: Reflection without Metaphysics. 348-355
• William D. Clinger: The Scheme 311 Compiler: An Exercise in Denotational Semantics. 356-