POPL 1989
30 papers
- A Calculus of Higher Order Communicating Systems
- A Fully Abstract Trace Model for Dataflow Networks
- A Rewriting Semantics for Program Dependence Graphs
- An Efficient Method of Computing Static Single Assignment Form
- Bisimulation Through Probabilistic Testing
- CLP* and Constraint Abstraction
- Continuation-Passing, Closure-Passing Style
- Copy Elimination in Functional Languages
- Dynamic Typing in a Statically-Typed Language
- Efficient Temporal Reasoning
- Extracting F(omega)'s Programs from Proofs in the Calculus of Constructions
- Fast Interprocedural Alias Analysis
- Fully Abstract Compositional Semantics for Logic Programs
- Generalized Conjunctive Types
- How to Make ad-hoc Polymorphism Less ad-hoc
- Incremental Computation via Function Caching
- Moded Type Systems for Logic Programming
- On the Synthesis of a Reactive Module
- Partial Order Programming
- Polymorphic Unification and ML Typing
- Realistic Compilation by Program Transformation
- Relating Models of Polymorphism
- Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis
- Rewrite, Rewrite, Rewrite, Rewrite, Rewrite
- Synthesis of Concurrent Systems with Many Similar Sequential Processes
- Temporal Logic Programming is Complete and Expressive
- The Modula-3 Type System
- The Program Dependence Graph and Vectorization
- Typechecking Records and Variants in a Natural Extension of ML
- Unified Algebras and Modules