POPL 1990
31 papers
- A Finite Presentation Theorem for Approximating Logic Programs
- A Formulae-as-Types Notion of Control
- A Relationship Between Abstract Interpretation and Projection Analysis
- A Type System for Smalltalk
- An Algorithm for Optimal Lambda Calculus Reduction
- An Efficient Hybrid Algorithm for Incremental Data Flow Analysis
- Automata-Driven Indexing of Prolog Clauses
- Combining Generational and Conservative Garbage Collection: Framework and Implementations
- Computable processes
- Concurrent Constraint Programming
- Deciding ML Typability is Complete for Deterministic Exponential Time
- Explicit Substitutions
- Fairness and Hyperfairness in Multi-Party Interactions
- Higher-Order Modules and the Phase Distinction
- Implicative Formulae in the "Proofs as Computations" Analogy
- Inheritance Is Not Subtyping
- Interaction Nets
- Making Asynchronous Parallelism Safe for the World
- On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications
- On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis
- On Oraclizable Networks and Kahn's Principle
- On the Relations Computable by a Class of Concurrent Automata
- Parallelism in Logic Programs
- Program Transformation in the Presence of Errors
- Quasi-Static Typing
- Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs
- Safe Run-time Overloading
- Scheduling Time-Critical Instructions on RISC Machines
- Small Domains Spell Fast Strictness Analysis
- The Chemical Abstract Machine
- Toward a Typed Foundation for Method Specialization and Inheritance