Publication has no abstract
- Separating Binding Times in Language SpecificationsTorben Æ. Mogensen. 14-25 [doi]
- Update Analysis and the Efficient Implementation of Functional AggregatesAdrienne Bloss. 26-38 [doi]
- Replacing Function Parameters by Global VariablesPeter Sestoft. 39-53 [doi]
- Computer-Time Garbage Collection by Sharing AnalysisSimon B. Jones, Daniel Le Métayer. 54-74 [doi]
- Compilation as Partitioning: A New Approach to Compiling Non-Strict Functional LanguagesKenneth R. Traub. 75-88 [doi]
- Untagged Data in Tagged Environments: Choosing Optimal Representations at Compile TimeJohn Peterson. 89-99 [doi]
- Improving the Three Instruction MachineGuy Argo. 100-115 [doi]
- Stacklessness: Compiling Recursion for a Distributed ArchitectureDavid R. Lester. 116-128 [doi]
- Transformations on Higher-Order FunctionsHanne Riis Nielson, Flemming Nielson. 129-143 [doi]
- Automatic Complexity AnalysisMads Rosendahl. 144-156 [doi]
- Retrieving Re-Usable Software Components by Polymorphic TypeColin Runciman, Ian Toyn. 166-173 [doi]
- Using Types as Search Keys in Function LibrariesMikael Rittri. 174-183 [doi]
- The Spineless Tagless G-MachineSimon L. Peyton Jones, Jon Salkild. 184-201 [doi]
- Parallel Graph Reduction with the <nu, G>-MachineLennart Augustsson, Thomas Johnsson. 202-213 [doi]
- An Abstract Machine for Parallel Graph ReductionLal George. 214-229 [doi]
- P-TAC: A Parallel Intermediate LanguageZena M. Ariola, Arvind. 230-242 [doi]
- Architectural Improvements for Data-Driven VLSI Processing ArraysShlomit Weiss, Ilan Y. Spillinger, Gabriel M. Silberman. 243-259 [doi]
- Strictness Analysis: A New Perspective Based on Type InferenceTsung-Min Kuo, Prateek Mishra. 260-272 [doi]
- F-Bounded Polymorphism for Object-Oriented ProgrammingPeter S. Canning, William R. Cook, Walter L. Hill, Walter G. Olthoff, John C. Mitchell. 273-280 [doi]
- A Simple Semantics for ML PolymorphismAtsushi Ohori. 281-292 [doi]
- On the Complexity of Type Inference with CoercionMitchell Wand, Patrick O Keefe. 293-298 [doi]
- Extended Projection - New Method to Extract Efficient Programs from Constructive ProofsYukihide Takayama. 299-312 [doi]
- Set Abstraction in Functional and Logic ProgrammingFrank S. K. Silbermann, Bharat Jayaraman. 313-326 [doi]
- Nondeterminism and Unification in LogScheme: Integrating Logic and Functional ProgrammingErik Ruf, Daniel Weise. 327-339 [doi]
- Theorems for Free!Philip Wadler. 347-359 [doi]
- Parsers and Printers as Stream Destructors and Constructors Embedded in Functional LanguagesMichel Mauny. 360-370 [doi]
- Processes in a Functional Animation SystemKavi Arya. 382-395 [doi]