Proceedings of the 1988 ACM Conference on LISP and Functional Programming, July 25-27, 1988, Snowbird, Utah, USA. ACM Press, 1988, ISBN 0-89791-273-X
- Gerald J. Sussman, Matthew Halfant:
Tutorial: Abstraction in Numerical Methods.
1-7
- Gerald Roylance:
Expressing Mathematical Subroutines Constructively.
8-13
- Jean Vuillemin:
Exact Real Computer Arithmetic with Continued Fractions.
14-27
- Pete Tinker, Morry Katz:
Parallel Execution of Sequential Scheme with ParaTran.
28-39
- Benjamin Goldberg:
Buckwheat: Graph Reduction on a Shared-Memory Multiprocessor.
40-51
- Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba:
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps.
52-62
- Albert R. Meyer, Jon G. Riecke:
Continuations May be Unreasonable.
63-71
- Matthias Felleisen:
lambda-V-CS: An Extended lambda-Calculus for Scheme.
72-85
- Alan Bawden, Jonathan Rees:
Syntactic Closures.
86-95
- Annika Aasa, Kent Petersson, Dan Synek:
Concrete Syntax for Data Objects in Functional Languages.
96-105
- R. Kent Dybvig, Robert Hieb:
A Variable-Arity Procedural Interface.
106-115
- Andrew Berlin, Henry M. Wu:
Scheme86: A System for Interpreting Scheme.
116-123
- William D. Clinger, Anne Hartheimer, Eric Ost:
Implementation Strategies for Continuations.
124-131
- Mark R. Swanson, Robert R. Kessler, Gary Lindstrom:
An Implementation of Portable Standard LISP on the BBN Butterfly.
132-142
- Ron Goldman, Richard P. Gabriel:
Preliminary Results with the Initial Implementation of Qlisp.
143-152
- Frank Pfenning:
Partial Polymorphic Type Inference and Higher-Order Unification.
153-163
- Simon Martini:
Bounded Quantifiers Have Interval Models.
164-173
- Atsushi Ohori, Peter Buneman:
Type Inference in a Database Programming Language.
174-183
- Fritz Henglein:
Type Inference and Semi-Unification.
184-197
- Lalita Jategaonkar, John C. Mitchell:
ML with Extended Pattern Matching and Subtypes.
198-211
- David B. MacQueen:
An Implementation of Standard ML Modules.
212-223
- Paul Hudak, Eric Mohr:
Graphinators and the Duality of SIMD and MIMD.
224-234
- A. C. Norman:
Faster Combinator Reduction Using stock Hardware.
235-243
- Geoffrey L. Burn, Simon L. Peyton Jones, J. D. Robson:
The Spineless G-Machine.
244-258
- Kourosh Gharachorloo, Vivek Sarkar, John L. Hennessy:
A Simple and Efficient Implmentation Approach for Single Assignment Languages.
259-268
- William Pugh:
An Improved Replacement Strategy for Function Aaching.
269-276
- Norman Adams, Jonathan Rees:
Object-Oriented Programming in Scheme.
277-288
- Uday S. Reddy:
Objects as Closures: Abstract Semantics of Object-Oriented Languages.
289-297
- Christian Queinnec, Pierre Cointe:
An Open-Ended Data Representation Model for EU_LISP.
298-308
- Daniel G. Bobrow, Gregor Kiczales:
The Common Lisp Object System Metaobject Kernel: A Status Report.
309-315
- John Lamping:
A Unified System of Parameterization for Programming Languages.
316-326
- Olivier Danvy, Karoline Malmkjær:
Intensions and Extensions in a Reflective Tower.
327-341
- Alan Bawden:
Reification without Evaluation.
342-349
Last update Fri May 17 19:34:35 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
