LISP and Functional Programming 1986: Cambridge, Massachusetts, USA

Session 1

• Simon J. Thompson: Laws in Miranda. 1-12 BibTeX
• Dominique Clément, Joëlle Despeyroux, Th. Despeyroux, Gilles Kahn: A Simple Applicative Language: Mini-ML. 13-27 BibTeX
• David K. Gifford, John M. Lucassen: Integrating Functional and Imperative Programming. 28-38 BibTeX

Session 2

• Cyril N. Alberga, Chris Bosman-Clark, Martin Mikelsons, Mary S. Van Deusen, Julian A. Padget: Experience with an Uncommon LISP. 39-53 BibTeX
• Julian A. Padget: Desiderata for the Standardization of LISP. 54-66 BibTeX
• Rodney A. Brooks, David B. Posner, James L. McDonald, Jon L. White, Eric Benson, Richard P. Gabriel: Design of an Optimizing, Dynamically Retargetable Compiler for Common Lisp. 67-87 BibTeX
• David H. Bartley, John C. Jensen: The Implementation of PC Scheme. 88-93 BibTeX

Session 3

• Jon Fairbairn, Stuart Wray: Code Generation Techniques for Functional Languages. 94-104 BibTeX
• Thomas F. Knight: An Architecture for Mostly Functional Languages. 105-112 BibTeX
• Michel Lemaître, Michel Castan, M.-H. Durand, Guy Durrieu, Bernard Lécussan: Mechanisms for Efficient Multiprocessor Combinator Reduction. 113-121 BibTeX
• John D. Ramsdell: The CURRY Chip. 122-131 BibTeX

Session 4

• Adrienne Bloss, Paul Hudak: Variations on Strictness Analysis. 132-142 BibTeX
• R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes: Expansion-Passing Style: Beyond Conventional Macros. 143-150 BibTeX
• Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba: Hygienic Macro Expansion. 151-161 BibTeX
• Hans-Juergen Boehm, Robert Cartwright, Mark Riggle, Michael J. O'Donnell: Exact Real Arithmetic: A Case Study in Higher Order Programming. 162-173 BibTeX

Session 5

• Jon L. White: Reconfigurable, Retargetable Bignums: A Case Study in Efficient, Portable Lisp System Building. 174-191 BibTeX
• Peter Steenkiste, John L. Hennessy: LISP on a Reduced-Instruction-Set-Processor. 192-201 BibTeX
• Vivek Sarkar, John L. Hennessy: Partitioning Parallel Programs for Macro-Dataflow. 202-211 BibTeX
• Mark Scheevel: NORMA: A Graph Reduction Processor. 212-219 BibTeX

Session 6

• Chris D. Clack, Simon L. Peyton Jones: The Four-Stroke Reduction Engine. 220-232 BibTeX
• Peter Lee, Uwe F. Pleban: On the Use of LISP in Implementing Denotational Semantics. 233-248 BibTeX
• Hanne Riis Nielson, Flemming Nielson: Semantics Directed Compiling for Functional Languages. 249-257 BibTeX

Session 7

• Alan Bawden: Connection Graphs. 258-265 BibTeX
• Michel Mauny, Ascánder Suárez: Implementing Functional Languages in the Categorical Abstract Machine. 266-278 BibTeX
• Guy L. Steele Jr., W. Daniel Hillis: Connection Machine LISP: Fine-Grained Parallel Symbolic Processing. 279-297 BibTeX

Session 8 - Panel: Object Oriented Programming in Lisp

Session 9

• Mitchell Wand, Daniel P. Friedman: The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. 298-307 BibTeX
• John C. Mitchell: A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (Summary). 308-319 BibTeX
• Bharat Jayaraman, Frank S. K. Silbermann: Equations, Sets, and Reduction Semantics for Functional and Logic Programming. 320-331 BibTeX
• Satish R. Thatte: Towards a Semantic Theory for Equational Programming Languages. 332-342 BibTeX

Session 10

• Claus-Werner Lermen, Dieter Maurer: A Protocol for Distributed Reference Counting. 343-350 BibTeX
• Paul Hudak: A Semantic Model of Reference Counting and its Abstraction (Detailed Summary). 351-363 BibTeX
• Martin Rudalics: Distributed Copying Garbage Collection. 364-372 BibTeX