Programming Languages and Systems - ESOP '96

This book presents the refereed proceedings of the Sixth European Symposium on Programming, ESOP '96, held in Linköping, Sweden, in April 1996.
The 23 revised full papers included were selected from a total of 63 submissions; also included are invited papers by Cliff B. Jones and by Simon L. Peyton Jones. The book is devoted to fundamental issues in the specification, analysis, and implementation of programming languages and systems; the emphasis is on research issues bridging the gap between theory and practice. Among the topics addressed are software specification and verification, programming paradigms, program semantics, advanced type systems, program analysis, program transformation, and implementation techniques.

Inhalt
Some practical problems and their influence on semantics.- Compiling Haskell by program transformation: A report from the trenches.- Narrowing-driven partial evaluation of functional logic programs.- A multiple-valued logical semantics for Prolog.- Removing value encoding using alternative values in partial evaluation of strongly-typed languages.- A complete transformational toolkit for compilers.- Global analysis of standard Prolog programs.- Static detection of pointer errors: An axiomatisation and a checking algorithm.- Compositional optimization of disjunctive abstract interpretations.- A rewriting logic for declarative programming.- Durations for truly-concurrent transitions.- Flow analysis in the Geometry of Interaction.- Parametricity and unboxing with unpointed types.- Modular denotational semantics for compiler construction.- Compositional semantics of non-deterministic synchronous languages.- Checking system properties via integer programming.- Efficient minimization up to location equivalence.- A new approach to compiling adaptive programs.- Mode and termination checking for higher-order logic programs.- Linear time hierarchies for a functional language machine model.- Integer constraints to stop deforestation.- Towards an ML-style polymorphic type system for C.- Assumption/commitment rules for dataflow networks with an emphasis on completeness.- Towards an expressive language for PDE solvers.- Rewrite systems with abstraction and ?-rule: Types, approximants and normalization.