ESOP 1994
33 papers
- A Logical Denotational Semantics for Constraint Logic Programming
- A Logical Framework for Evolution of Specifications
- A Semantics for Higher-Order Functors
- A Synergistic Analysis for Sharing and Groundness with Traces Linearity
- A Theory of Primitive Objects - Scond-Order Systems
- A Tiny Constrain Functional Logic Language and Its Continuation Semantics
- A pi-Calculus Specification of Prolog
- Algebraic Proofs of Properties of Objects
- An Asynchronous Algebra with Multiple Clocks
- Bottom-up Grammar Analysis - A Functional Formulation
- Broadcasting with Priority
- Characterizing Behavioural Semantics and Abstractor Semantics
- Compilation of Head and Strong Reduction
- Dimension Types
- Extending Pruning Techniques to Polymorphic Second order Lambda-Calculus
- First-Class Polymorphism for ML
- Foundational Issues in Implementing Constraint Logic Programming Systems
- Fully Abstract Translations and Parametric Polymorphism
- Lambda-Definition of Function(al)s by Normal Forms
- Lazy Type Inference for the Strictness Analysis of Lists
- Lazy Unification with Simplification
- Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
- Pi-Nets: A Graphical Form of pi-Calculus
- Polymorphic Binding-Time Analysis
- Programming with Behaviors in an ML Framework - The Syntax and Semantics of LCS
- Shapely Types and Shape Polymorphism
- Simulation of SOS Definitions with Term Rewriting Systems
- Strategies in Modular System Design by Interface Rewriting
- Suffix Trees in the Functional Programming Paradigm
- Symbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization
- The PCKS-Machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations
- Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC
- Type Classes in Haskell