Programming Languages and Systems

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.

Includes supplementary material: sn.pub/extras

Autorentext
Gert Smolka ist seit 1990 Professor für Informatik an der Universität des Saarlandes, wo er in Saarbrücken den Lehrstuhl für Programmiersysteme leitet. Zusammen mit seinen Schülern hat er die Programmiersprachen Oz und Alice entwickelt. Informatik studiert hat Gert Smolka an der Universität Karlsruhe und an der Cornell University, promoviert hat er an der Universität Kaiserslautern. Im Zentrum seiner Forschungsarbeiten stehen Logik und Berechnung, mit Anwendungen bei Programmiersprachen, in der Künstlichen Intelligenz und in der Computerlinguistik.

Inhalt
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 UpdateExtended 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.