Programming Languages and Systems - ESOP '94

1. Front Matter

   PDF

2. A theory of primitive objects

   • Martín Abadi, Luca Cardelli

   Pages 1-25

3. Pi-nets: A graphical form of π-calculus

   • Robin Milner

   Pages 26-42

4. Local type reconstruction by means of symbolic fixed point iteration

   • Torben Amtoft

   Pages 43-57

5. An asynchronous process algebra with multiple clocks

   • Henrik Reif Andersen, Michael Mendler

   Pages 58-73

6. Foundational issues in implementing constraint logic programming systems

   • James H. Andrews

   Pages 74-88

7. Programming with behaviors in an ML framework — The syntax and semantics of LCS

   • Bernard Berthomieu, Thierry Le Sergent

   Pages 89-104

8. Characterizing behavioural semantics and abstractor semantics

   • Michel Bidoit, Rolf Hennicker, Martin Wirsing

   Pages 105-119

9. Extending pruning techniques to polymorphic second order λ-calculus

   • Luca Boerio

   Pages 120-134

10. λ-definition of function(al)s by normal forms

    • Corrado Böhm, Adolfo Piperno, Stefano Guerrini

    Pages 135-149

11. Simulation of SOS definitions with term rewriting systems

    • Karl-Heinz Buth

    Pages 150-164

12. Strategies in modular system design by interface rewriting

    • S. Cicerone, F. Parisi Presicce

    Pages 165-179

13. Symbolic model checking and constraint logic programming: A cross-fertilization

    • M. -M. Corsini, A. Rauzy

    Pages 180-194

14. A logical denotational semantics for constraint logic programming

    • Alessandra Di Pierro, Catuscia Palamidessi

    Pages 195-210

15. Compilation of head and strong reduction

    • Pascal Fradet

    Pages 211-224

16. Suffix trees in the functioned programming paradigm

    • Robert Giegerich, Stefan Kurtz

    Pages 225-240

17. Type classes in Haskell

    • Cordelia Hall, Kevin Hammond, Simon Peyton Jones, Philip Wadler

    Pages 241-256

18. Lazy type inference for the strictness analysis of lists

    • Chris Hankin, Daniel Le Métayer

    Pages 257-271

19. Lazy unification with simplification

    • Michael Hanus

    Pages 272-286

20. Polymorphic binding-time analysis

    • Fritz Henglein, Christian Mossin

    Pages 287-301

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.

• algorithm
• algorithms
• design
• logic
• programming
• programming language
• semantics
• verification

Policies and ethics