9. ESOP 2000:
Berlin, Germany (Part of ETAPS 2000)
Gert Smolka (Ed.):
Programming Languages and Systems, 9th European Symposium on Programming, ESOP 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings.
Lecture Notes in Computer Science 1782 Springer 2000, ISBN 3-540-67262-1 
Invited Paper
Regular Papers
- Torben Amtoft, Franklyn A. Turbak:
Faithful Translations between Polyvariant Flows and Polymorphic Types.
26-40
- Nadia Busi, Gianluigi Zavattaro:
On the Expressiveness of Event Notification in Data-Driven Coordination Languages.
41-55
- Henry Cejtin, Suresh Jagannathan, Stephen Weeks:
Flow-Directed Closure Conversion for Typed Languages.
56-71
- Witold Charatonik:
Directional Type Checking for Logic Programs: Beyond Discriminative Types.
72-87
- Olivier Danvy:
Formalizing Implementation Strategies for First-Class Continuations.
88-103
- Ewen Denney, Thomas P. Jensen:
Correctness of Java Card Method Lookup via Logical Relations.
104-118
- Jacob Elgaard, Anders Møller, Michael I. Schwartzbach:
Compile-Time Debugging of C Programs Working on Trees.
119-134
- Kathleen Fisher, John H. Reppy, Jon G. Riecke:
A Calculus for Compiling and Linking Classes.
135-149
- Andrew Heaton, Patricia M. Hill, Andy King:
Abstract Domains for Universal and Existential Properties.
150-164
- Martin Hofmann:
A Type System for Bounded Space and Functional In-Place Update--Extended Abstract.
165-179
- Kohei Honda, Vasco Thudichum Vasconcelos, Nobuko Yoshida:
Secure Information Flow as Typed Process Behaviour.
180-199
- Jacob M. Howe, Andy King:
Implementing Groundness Analysis with Definite Boolean Functions.
200-214
- John Hughes:
The Correctness of Type Specialisation.
215-229
- Mark P. Jones:
Type Classes with Functional Dependencies.
230-244
- Julia L. Lawall, Harry G. Mairson:
Sharing Continuations: Proofnets for Languages with Explicit Control.
245-259
- Elena Machkasova, Franklyn A. Turbak:
A Calculus for Link-Time Compilation.
260-274
- Laurent Mauborgne:
Improving the Representation of Infinite Trees to Deal with Sets of Trees.
275-289
- Markus Müller-Olm, Andreas Wolf:
On the Translation of Procedures to Finite Machines.
290-304
- Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv:
A Kleene Analysis of Mobile Ambients.
305-319
- François Pottier:
A 3-Part Type Inference Engine.
320-335
- Claudio V. Russo:
First-Class Structures for Standard ML.
336-350
- Helmut Seidl, Bernhard Steffen:
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
351-365
- Frederick Smith, David Walker, J. Gregory Morrisett:
Alias Types.
366-381
- Scott F. Smith, Tiejun Wang:
Polyvariant Flow Analysis with Constrained Types.
382-396
- Hayo Thielecke:
On Exceptions Versus Continuations in the Presence of State.
397-411
- J. B. Wells, René Vestergaard:
Equational Reasoning for Linking with First-Class Primitive Modules.
412-428
Last update Fri May 24 18:49:20 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
