ESOP 1990
26 papers
- A Backwards Analysis for Compile-time Garbage Collection
- A Syntactic Theory of Transparent Parameterization
- Algebraic Properties of Program Integration
- Arity Raiser and its Use in Program Specialization
- Automatic Autoprojection of Higher Order Recursive Equations
- Complexity Analysis for a Lazy Higher-Order Language
- Development of Concurrent Systems by Incremental Transformations
- Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations
- From Interpreting to Compiling Binding Times
- Graph-based Implementation of a Functional Logic Langugage
- Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations
- Implementation of an Interpreter for a Parallel Language in Centaur
- Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism
- On the Expressive Power of Programming Languages
- On the Weak Adequacy of Branching-Time Remporal Logic
- Resolution and Type Theory
- Set Domains
- Symbolic Finite Differencing - Part I
- Synthesis of Eureka Predicates for Developing Logic Programs
- Techniques for Improving Grammar Flow Analysis
- The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems
- The Value Flow Graph: A Program Representation for Optimal Program Transformations
- Towards the Theory of Programming in Constructive Logic
- Type Inference and Implicit Scaling
- Type Inference for Action Semantics
- Types in Lambda Calculi and Programming Languages