Programming Languages and Systems — ESOP ’94: 5th European Symposium on Programming Edinburg, U.K., April 11–13, 1994 Proceedings

Martín Abadi, Luca Cardelli (auth.), Donald Sannella (eds.)3540578803, 9783540578802

This volume contains the papers selected for presentation at the fifth European Symposium on Programming (ESOP ’94), which was held jointly with the 19th Colloquium on Trees in Algebra and Programming (CAAP ’94) in Edinburgh in April 1994. ESOP is devoted to fundamental issues in the specification, design and implementation of programming languages and systems. The scope of the symposium includes work on: software analysis, specification, transformation, development and verification/certification; programming paradigms (functional, logic, object-oriented, concurrent, etc.) and their combinations; programming language concepts, implementation techniques and semantics; software design methodologies; typing disciplines and typechecking algorithms; and programming support tools.

---

Table of contents :
A theory of primitive objects….Pages 1-25
Pi-nets: A graphical form of π-calculus….Pages 26-42
Local type reconstruction by means of symbolic fixed point iteration….Pages 43-57
An asynchronous process algebra with multiple clocks….Pages 58-73
Foundational issues in implementing constraint logic programming systems….Pages 74-88
Programming with behaviors in an ML framework — The syntax and semantics of LCS….Pages 89-104
Characterizing behavioural semantics and abstractor semantics….Pages 105-119
Extending pruning techniques to polymorphic second order λ-calculus….Pages 120-134
λ-definition of function(al)s by normal forms….Pages 135-149
Simulation of SOS definitions with term rewriting systems….Pages 150-164
Strategies in modular system design by interface rewriting….Pages 165-179
Symbolic model checking and constraint logic programming: A cross-fertilization….Pages 180-194
A logical denotational semantics for constraint logic programming….Pages 195-210
Compilation of head and strong reduction….Pages 211-224
Suffix trees in the functioned programming paradigm….Pages 225-240
Type classes in Haskell….Pages 241-256
Lazy type inference for the strictness analysis of lists….Pages 257-271
Lazy unification with simplification….Pages 272-286
Polymorphic binding-time analysis….Pages 287-301
Shapely types and shape polymorphism….Pages 302-316
Bottom-up grammar analysis — A functional formulation….Pages 317-332
First-class polymorphism for ML….Pages 333-347
Dimension types….Pages 348-362
A synergistic analysis for sharing and groundness which traces linearity….Pages 363-378
A π-calculus specification of prolog….Pages 379-393
A logical framework for evolution of specifications….Pages 394-408
A semantics for higher-order functors….Pages 409-423
The PCKS-machine: An abstract machine for sound evaluation of parallel functional programs with first-class continuations….Pages 424-438
A tiny constraint functional logic language and its continuation semantics….Pages 439-453
Fully abstract translations and parametric polymorphism….Pages 454-468
Broadcasting with priority….Pages 469-484
Towards unifying partial evaluation, deforestation, supercompilation, and GPC….Pages 485-500
Algebraic proofs of properties of objects….Pages 501-516