POPL 1987
29 papers
- A Calculus for Assignments in Higher-Order Languages
- A Logic for Partially Specified Data Structures
- A Realistic Compiler Generator Based on High-Level Semantics
- An Improvement to Bottom-up Tree Pattern Matching
- Appraising Fairness in Languages for Distributed Programming
- Automatic Decomposition of Scientific Programs for Parallel Execution
- Axioms for Concurrent Objects
- Binding Performance at Language Design Time
- Compiling Strictness into Streams
- Completeness and Incompleteness of Trace-Based Network Proof Systems
- Computable Values Can Be Classical
- Computation of Aliases and Support Sets
- Concurrent Transition System Semantics of Process Networks
- Constraint Logic Programming
- Empty Types in Polymorphic Lambda Calculus
- Environments as First Class Objects
- Extensions for Multi-Module Records in Conventional Programming Languages
- Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language
- Lustre: A Declarative Language for Programming Synchronous Systems
- Macro-by-Example: Deriving Syntactic Transformations from their Specifications
- On Strictness and its Analysis
- Scheduling Arithmetic and Load Operations in Parallel with No Spilling
- Semantic Parallelization: A Practical Exercise in Abstract Interpretation
- Semantics for Concurrency without Powerdomains
- Skinny and Fleshy Failures of Relative Completeness
- Specification and Verification of Concurrent Programs By Forall-Automata
- Strictness Analysis and Denotational Abstract Interpretation
- The Concurrent Logic Programming Language CP: Definition and Operational Semantics
- Views: A Way for Pattern Matching to Cohabit with Data Abstraction