POPL 1984
32 papers
- A Combinator-Based Compiler for a Functional Language
- A Good Hoare Axiom System for an Algol-like Language
- A Hierarchical Basis for Reordering Transformations
- A Less Dynamic Memory Allocation Scheme for Algol-like Languages
- A Types-as-Sets Semantics for Milner-Style Polymorphism
- An Ideal Model for Recursive Polymorphic Types
- Applicative Programming and Digital Design
- Coercion and Type Inference
- Completion of a Set of Rules Modulo a Set of Equations
- Constraining-Unification and the Programming Language Unicorn
- Creating Efficient Systems for Object-Oriented Languages
- Direct Implementation of Compiler Specifications or the Pascal P-code Compiler Revisited
- Editing by Example
- Efficient Applicative Data Types
- Efficient Implementation of the Smalltalk-80 System
- Expressional Loops
- Generalized Fair Termination
- Grids: A New Program Structuring Mechanism Based on Layered Graphs
- Implementation of an Interpreter for Abstract Equations
- Interactive Proof Checking
- Inverse Currying Transformation on Attribute Grammars
- On Relative Completeness of Programming Logics
- Paragon: Novel Uses of Type Hierarchies for Data Abstraction
- Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs
- Reflection and Semantics in Lisp
- Static Inference of Properties of Applicative Programs
- Stop Losing Sleep Over Incomplete Data Type Specifications
- Systems Programming in Concurrent Prolog
- Temporal Verification of Carrier-Sense Local Area Network Protocols
- The Global Storage Needs of a Subcomputation
- The Semantics of Local Storage, or What Makes the Free-List Free?
- Treat - An Applicative Code Generator