Programming Languages and Systems - ESOP '94 : 5th European Symposium on Programming, Edinburgh, U.K., April 11 - 13, 1994. Proceedings

Sannella, Donald

ISBN 10: 3540578803 / ISBN 13: 9783540578802

Editore: Springer 1994-03, 1994

Riguardo questo articolo

Codice articolo 6666-IUK-9783540578802

Dati bibliografici

• Titolo: Programming Languages and Systems - ESOP '94 : 5th European Symposium on Programming, Edinburgh, U.K., April 11 - 13, 1994. Proceedings
• Editore: Springer 1994-03
• Data di pubblicazione: 1994
• Lingua: Inglese
• ISBN 10: 3540578803
• ISBN 13: 9783540578802
• Rilegatura: PF
• Condizione: New

Descrizione articolo

Riassunto

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.

Contenuti

A theory of primitive objects.- Pi-nets: A graphical form of ?-calculus.- Local type reconstruction by means of symbolic fixed point iteration.- An asynchronous process algebra with multiple clocks.- Foundational issues in implementing constraint logic programming systems.- Programming with behaviors in an ML framework — The syntax and semantics of LCS.- Characterizing behavioural semantics and abstractor semantics.- Extending pruning techniques to polymorphic second order ?-calculus.- ?-definition of function(al)s by normal forms.- Simulation of SOS definitions with term rewriting systems.- Strategies in modular system design by interface rewriting.- Symbolic model checking and constraint logic programming: A cross-fertilization.- A logical denotational semantics for constraint logic programming.- Compilation of head and strong reduction.- Suffix trees in the functioned programming paradigm.- Type classes in Haskell.- Lazy type inference for the strictness analysis of lists.- Lazy unification with simplification.- Polymorphic binding-time analysis.- Shapely types and shape polymorphism.- Bottom-up grammar analysis — A functional formulation.- First-class polymorphism for ML.- Dimension types.- A synergistic analysis for sharing and groundness which traces linearity.- A ?-calculus specification of prolog.- A logical framework for evolution of specifications.- A semantics for higher-order functors.- The PCKS-machine: An abstract machine for sound evaluation of parallel functional programs with first-class continuations.- A tiny constraint functional logic language and its continuation semantics.- Fully abstract translations and parametric polymorphism.- Broadcasting with priority.- Towards unifying partial evaluation, deforestation, supercompilation, and GPC.- Algebraic proofs of properties of objects.