This book constitutes the refereed proceedings of the 9th European Symposium on Programming, ESOP 2000, held as part of ETAPS 2000 in Berlin, Germany in March/April 2000. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 84 submissions. Among the topics addressed are language translation, coordination languages, typed languages, logic programs, Java, C-programming, type systems, language continuations, programming calculi, programming theory, mobile processes, interprocedural program analysis, flow analysis, etc.
Table of Contents
Invited Paper.- Functional Nets.- Regular Papers.- Faithful Translations between Polyvariant Flows and Polymorphic Types.- On the Expressiveness of Event Notification in Data-Driven Coordination Languages.- Flow-Directed Closure Conversion for Typed Languages.- Directional Type Checking for Logic Programs: Beyond Discriminative Types.- Formalizing Implementation Strategies for First-Class Continuations.- Correctness of Java Card Method Lookup via Logical Relations.- Compile-Time Debugging of C Programs Working on Trees.- A Calculus for Compiling and Linking Classes.- Abstract Domains for Universal and Existential Properties.- A Type System for Bounded Space and Functional In-Place Update—Extended Abstract.- Secure Information Flow as Typed Process Behaviour.- Implementing Groundness Analysis with Definite Boolean Functions.- The Correctness of Type Specialisation.- Type Classes with Functional Dependencies.- Sharing Continuations: Proofnets for Languages with Explicit Control.- A Calculus for Link-Time Compilation.- Improving the Representation of Infinite Trees to Deal with Sets of Trees.- On the Translation of Procedures to Finite Machines.- A Kleene Analysis of Mobile Ambients.- A 3-Part Type Inference Engine.- First-Class Structures for Standard ML.- Constraint-Based Inter-Procedural Analysis of Parallel Programs.- Alias Types.- Polyvariant Flow Analysis with Constrained Types.- On Exceptions Versus Continuations in the Presence of State.- Equational Reasoning for Linking with First-Class Primitive Modules.