ESOP 1996
25 papers
- A Complete Transformational Toolkit for Compilers
- A Multiple-Valued Logical Semantics for Prolog
- A New Approach to Compiling Adaptive Programs
- A Rewriting Logic for Declarative Programming
- Assumption/Commitment Rules for Dataflow Networks - With an Emphasis on Completeness
- Checking System Properties via Integer Programming
- Compiling Haskell by Program Transformation: A Report from the Trenches
- Compositional Optimization of Disjunctive Abstract Interpretations
- Compositional Semantics of Non-Deterministic Synchronous Languages
- Durations for Truly-Concurrent Transitions
- Efficient Minimization up to Location Equivalence
- Flow Analysis in the Geometry of Interaction
- Global Analysis of Standard Prolog Programs
- Integer Constraints to Stop Deforestation
- Linear Time Hierarchies for a Functional Language Machine Model
- Mode and Termination Checking for Higher-Order Logic Programs
- Modular Denotational Semantics for Compiler Construction
- Narrowing-Driven Partial Evaluation of Functional Logic Programs
- Parametricity and Unboxing with Unpointed Types
- Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages
- Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization
- Some Practical Problems and Their Influence on Semantics
- Static Detection of Pointer Errors: An Axiomatisation and a Checking Algorithm
- Towards an Expressive Language for PDE Solvers
- Towards an ML-Style Polymorphic Type System for C