Abstract is missing.
- Debugging Standard ML Without Reverse EngineeringAndrew P. Tolmach, Andrew W. Appel. 1-12 [doi]
- A Module System for SchemePavel Curtis, James Rauen. 13-19 [doi]
- Static Dependent Types for First Class ModulesMark A. Sheldon, David K. Gifford. 20-29 [doi]
- A Semantic Basis for QuestLuca Cardelli, Giuseppe Longo. 30-43 [doi]
- Computing with CoercionsVal Tannen, Carl A. Gunter, Andre Scedrov. 44-60 [doi]
- Comprehending MonadsPhilip Wadler. 61-78 [doi]
- Trap Architectures for Lisp SystemsDouglas Johnson. 79-86 [doi]
- Comparing Mark-and-Sweep and Stop-and-Copy Garbage CollectionBenjamin G. Zorn. 87-98 [doi]
- Efficient Method Dispatch in PCLGregor Kiczales, Luis Rodriguez. 99-105 [doi]
- Efficient Stack Allocation for Tail-Recursive LanguagesChris Hanson. 106-118 [doi]
- A Parallel Virtual Machine for Efficient Scheme CompilationMarc Feeley, James S. Miller. 119-130 [doi]
- A Functional Programming Language Compiler for Massively Parallel ComputersClifford Walinsky, Deb Banerjee. 131-138 [doi]
- Partial Evaluation Applied to Numerical ComputationAndrew Berlin. 139-150 [doi]
- Abstracting ControlOlivier Danvy, Andrzej Filinski. 151-160 [doi]
- Reasoning with Continuations II: Full Abstraction for Models of ControlDorai Sitaram, Matthias Felleisen. 161-175 [doi]
- Continuing into the Future: On the Interaction of Futures and First-Class ContinuationsMorry Katz, Daniel Weise. 176-184 [doi]
- Lazy Task Creation: A Technique for Increasing the Granularity of Parallel ProgramsEric Mohr, David A. Kranz, Robert H. Halstead Jr.. 185-197 [doi]
- Speculative Computation in MultilispRandy B. Osborne. 198-208 [doi]
- Continuation-Based Parallel Implementation of Functional Programming LanguagesJ.-F. Giorgi, Daniel Le Métayer. 209-217 [doi]
- Unify and ConquerHenry G. Baker. 218-226 [doi]
- A Compositional Analysis of Evaluation-Order and Its ApplicationM. Draghicescu, S. Purushothaman. 242-250 [doi]
- Context Information for Lazy Code GenerationHanne Riis Nielson, Flemming Nielson. 251-263 [doi]
- Binding Time Analysis for High Order Untyped Functional LanguagesCharles Consel. 264-272 [doi]
- Compiling Pattern Matching by Term DecompositionLaurence Puel, Ascánder Suárez. 273-281 [doi]
- Partial Type Inference for Untyped Functional ProgramsCarsten K. Gomard. 282-287 [doi]
- Discrete PolymorphismDaniel Leivant. 288-297 [doi]
- Operational and Axiomatic Semantics of PCFBrian T. Howard, John C. Mitchell. 298-306 [doi]
- Incremental Reduction in the lambda CalculusJohn Field, Tim Teitelbaum. 307-322 [doi]
- From Operational Semantics to Abstract Machines: Preliminary ResultsJohn Hannan, Dale Miller. 323-332 [doi]
- An Abstract Machine for Lambda-Terms NormalizationPierre Crégut. 333-340 [doi]
- A Representation of Lambda Terms Suitable for Operations on Their IntensionsGopalan Nadathur, Debra Sue Wilson. 341-348 [doi]