Programming Languages and Systems: 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings

Martin Odersky (auth.), Gert Smolka (eds.)3540672621, 9783540672623

ETAPS 2000 was the third instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ve satellite workshops (CBS, CMCS, CoFI, GRATRA, INT), seven invited lectures, a panel discussion, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these – tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

---

Table of contents :
Functional Nets….Pages 1-25
Faithful Translations between Polyvariant Flows and Polymorphic Types….Pages 26-40
On the Expressiveness of Event Notification in Data-Driven Coordination Languages….Pages 41-55
Flow-Directed Closure Conversion for Typed Languages….Pages 56-71
Directional Type Checking for Logic Programs: Beyond Discriminative Types….Pages 72-87
Formalizing Implementation Strategies for First-Class Continuations….Pages 88-103
Correctness of Java Card Method Lookup via Logical Relations….Pages 104-118
Compile-Time Debugging of C Programs Working on Trees….Pages 119-134
A Calculus for Compiling and Linking Classes….Pages 135-149
Abstract Domains for Universal and Existential Properties….Pages 150-164
A Type System for Bounded Space and Functional In-Place Update—Extended Abstract….Pages 165-179
Secure Information Flow as Typed Process Behaviour….Pages 180-199
Implementing Groundness Analysis with Definite Boolean Functions….Pages 200-214
The Correctness of Type Specialisation….Pages 215-229
Type Classes with Functional Dependencies….Pages 230-244
Sharing Continuations: Proofnets for Languages with Explicit Control….Pages 245-259
A Calculus for Link-Time Compilation….Pages 260-274
Improving the Representation of Infinite Trees to Deal with Sets of Trees….Pages 275-289
On the Translation of Procedures to Finite Machines….Pages 290-304
A Kleene Analysis of Mobile Ambients….Pages 305-319
A 3-Part Type Inference Engine….Pages 320-335
First-Class Structures for Standard ML….Pages 336-350
Constraint-Based Inter-Procedural Analysis of Parallel Programs….Pages 351-365
Alias Types….Pages 366-381
Polyvariant Flow Analysis with Constrained Types….Pages 382-396
On Exceptions Versus Continuations in the Presence of State….Pages 397-411
Equational Reasoning for Linking with First-Class Primitive Modules….Pages 412-428