TOPLAS 1996
27 papers
- A Natural Semantics for Eiffel Dynamic Binding
- An Incremental Algorithm for Satisfying Hierarchies of Multiway Dataflow Constraints
- Compositional Parallel Programming Languages
- Conditional Attribute Grammars
- Constrained Types and Their Expressiveness
- Demand-Driven Register Allocation
- Eta-Expansion Does The Trick
- Global Analysis of Constraint Logic Programs
- Handling Floating-Point Exceptions in Numeric Programs
- Identifying Loops Using DJ Graphs
- Improving Data Locality with Loop Transformations
- Indirect Distributed Garbage Collection: Handling Object Migration
- Iterated Register Coalescing
- Iteration Abstraction in Sather
- On Subtyping and Matching
- On the Optimality of Change Propagation for Incremental Evaluation of Hierarchical Attribute Grammars
- Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs
- Parameter Passing and Control Stack Management in Prolog Implementation Revisited
- Polymorphic typing of Variables and References
- Principles and Practice of Unification Factoring
- Probabilistic Predicate Transformers
- Reconciling Responsiveness with Performance in Pure Object-Orieted Languages
- Storage Assignment to Decrease Code Size
- Symbolic Analysis for Parallelizing Compilers
- Total Correctness by Local Improvement in the Transformation of Functional Programs
- Type Classes in Haskell
- Using Dataflow Analysis Techniques to Reduce Ownership Overhead in Cache Coherence Protocols