Publication has no abstract
- Miranda: A Non-Strict Functional language with Polymorphic TypesD. A. Turner. 1-16
- Data Flow Graph Optimization in IF1Stephen K. Skedzielewski, M. L. Welcome. 17-34
- Strictness Analysis - A Practical ApproachChris D. Clack, Simon L. Peyton Jones. 35-49
- The Categorical Abstract MachineGuy Cousineau, Pierre-Louis Curien, Michel Mauny. 50-64
- High Order Programming in Extended FPPatrick Bellot. 65-80
- Secd-m: a Virtual Machine for Applicative ProgrammingSamson Abramsky, R. Sykes. 81-98
- COBWEB - A Combinator Reduction ArchitectureChris Hankin, Peter Osmon, Malcolm J. Shute. 99-112
- How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languagesPhilip Wadler. 113-128
- Lazy Memo-functionsJohn Hughes. 129-146
- An Architecture for fast Data Movement in the FFP MachineDavid A. Plaisted. 147-163
- An Architecture that Efficiently Updates Associative Aggregates in Applicative Programing LanguagesJohn T. O Donnell. 164-189
- Lambda Lifting: Treansforming Programs to Recursive EquationsThomas Johnsson. 190-203
- Optimizing Almost-Tail-Recursive Prolog ProgramsSaumya K. Debray. 204-219
- Designing Regular Array Architectures using Higher Order FunctionsMary Sheeran. 220-237
- A Distributed Garbage Collection AlgorithmJohn Hughes. 256-271
- Design for a Multiprocessing Heap with On-board Reference CountingDavid S. Wise. 289-304
- Practical PolymorphismRishiyur S. Nikhil. 319-333
- Program Verification in a Logical Theory of ConstructionsPeter Dybjer. 334-349
- Transforming Recursive Programs for Execution on Parallel MachinesV. J. Bush, John R. Gurd. 350-367
- Compiling Pattern MatchingLennart Augustsson. 368-381 [doi]
- Serial Combinators: Optimal Grains of ParallelismPaul Hudak, Benjamin Goldberg. 382-399
- The G-Machine: A Fast, Graph-Reduction EvaluatorRichard B. Kieburtz. 400-413