Programming Languages and Systems

1. Front Matter

   Pages I-XIII

   PDF

2. Invited Paper

   1. Functional Nets

      • Martin Odersky

      Pages 1-25

3. Regular Papers

   1. Faithful Translations between Polyvariant Flows and Polymorphic Types

      • Torben Amtoft, Franklyn Turbak

      Pages 26-40

   2. On the Expressiveness of Event Notification in Data-Driven Coordination Languages

      • Nadia Busi, Gianluigi Zavattaro

      Pages 41-55

   3. Flow-Directed Closure Conversion for Typed Languages

      • Henry Cejtin, Suresh Jagannathan, Stephen Weeks

      Pages 56-71

   4. Directional Type Checking for Logic Programs: Beyond Discriminative Types

      • Witold Charatonik

      Pages 72-87

   5. Formalizing Implementation Strategies for First-Class Continuations

      • Olivier Danvy

      Pages 88-103

   6. Correctness of Java Card Method Lookup via Logical Relations

      • Ewen Denney, Thomas Jensen

      Pages 104-118

   7. Compile-Time Debugging of C Programs Working on Trees

      • Jacob Elgaard, Anders Møller, Michael I. Schwartzbach

      Pages 119-134

   8. A Calculus for Compiling and Linking Classes

      • Kathleen Fisher, John Reppy, Jon G. Riecke

      Pages 135-149

   9. Abstract Domains for Universal and Existential Properties

      • Andrew Heaton, Patricia M. Hill, Andy King

      Pages 150-164

   10. A Type System for Bounded Space and Functional In-Place Update—Extended Abstract

       • Martin Hofmann

       Pages 165-179

   11. Secure Information Flow as Typed Process Behaviour

       • Kohei Honda, Vasco Vasconcelos, Nobuko Yoshida

       Pages 180-199

   12. Implementing Groundness Analysis with Definite Boolean Functions

       • Jacob M. Howe, Andy King

       Pages 200-214

   13. The Correctness of Type Specialisation

       • John Hughes

       Pages 215-229

   14. Type Classes with Functional Dependencies

       • Mark P. Jones

       Pages 230-244

   15. Sharing Continuations: Proofnets for Languages with Explicit Control

       • Julia L. Lawall, Harry G. Mairson

       Pages 245-259

   16. A Calculus for Link-Time Compilation

       • Elena Machkasova, Franklyn A. Turbak

       Pages 260-274

   17. Improving the Representation of Infinite Trees to Deal with Sets of Trees

       • Laurent Mauborgne

       Pages 275-289

   18. On the Translation of Procedures to Finite Machines

       • Markus Müller-Olm, Andreas Wolf

       Pages 290-304

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.

• C programming language
• Debugging
• Java
• Java Card
• ML
• Programming languages design
• analysis
• language
• language implementation
• logic
• programming
• programming language
• programming systems
• programming theory
• specification

• Programming Systems Lab, University of Saarland, Saarbrücken, Germany

  Gert Smolka

Policies and ethics