ISBN: 3-540-67262-1
TITLE: Programming Languages and Systems
AUTHOR: Smolka, Gert (Ed.)
TOC:

Invited Paper
Functional Nets 1
Martin Odersky (cole Polytechnique Fdrale de Lausanne)
Regular Papers
Faithful Translations between Polyvariant Flows and Polymorphic Types 26
Torben Amtoft (Boston University) and Franklyn Turbak (Wellesley College)
On the Expressiveness of Event Notification in Data-Driven Coordination Languages 41
Nadia Busi and Gianluigi Zavattaro (Universit a di Bologna)
Flow-Directed Closure Conversion for Typed Languages 56
Henry Cejtin (Entertainment Decisions), Suresh Jagannathan (NEC Research Institute), and Stephen Weeks (Intertrust STAR Laboratories)
Directional Type Checking for Logic Programs: Beyond Discriminative Types 72
Witold Charatonik (Max-Planck-Institut fr Informatik)
Formalizing Implementation Strategies for First-Class Continuations 88
Olivier Danvy (University of Aarhus)
Correctness of Java Card Method Lookup via Logical Relations 104
Ewen Denney and Thomas Jensen (IRISA)
Compile-Time Debugging of C Programs Working on Trees 119
Jacob Elgaard, Anders Mller, and Michael I. Schwartzbach (University of Aarhus)
A Calculus for Compiling and Linking Classes 135
Kathleen Fisher (AT&T Labs), John Reppy, and Jon G. Riecke (Bell Laboratories, Lucent Technologies)
Abstract Domains for Universal and Existential Properties 150
Andrew Heaton, Patricia M. Hill (University of Leeds), and Andy King (University of Kent)
A Type System for Bounded Space and Functional In-Place Update - Extended Abstract 165
Martin Hofmann (LFCS Edinburgh)
Secure Information Flow as Typed Process Behaviour 180
Kohei Honda (Queen Mary and Westfield College), Vasco Vasconcelos (University of Lisbon), and Nobuko Yoshida (University of Leicester)
Implementing Groundness Analysis with Definite Boolean Functions 200
Jacob M. Howe and Andy King (University of Kent)
The Correctness of Type Specialisation 215
John Hughes (Chalmers University)
Type Classes with Functional Dependencies 230
Mark P. Jones (Oregon Graduate Institute)
Sharing Continuations: Proofnets for Languages with Explicit Control 245
Julia L. Lawall and Harry G. Mairson (Boston University)
A Calculus for Link-Time Compilation 260
Elena Machkasova (Boston University) and Franklyn A. Turbak (Wellesley College)
Improving the Representation of Infinite Trees to Deal with Sets of Trees 275
Laurent Mauborgne (cole Normale Suprieure)
On the Translation of Procedures to Finite Machines 290
Markus Mller-Olm (Universitt Dortmund) and Andreas Wolf (Christian-Albrechts-Universitt Kiel)
A Kleene Analysis of Mobile Ambients 305
Flemming Nielson, Hanne Riis Nielson (Aarhus University), and Mooly Sagiv (Tel Aviv University)
A 3-Part Type Inference Engine 320
Franois Pottier (INRIA Rocquencourt)
First-Class Structures for Standard ML 336
Claudio V. Russo (Cambridge University)
Constraint-Based Inter-Procedural Analysis of Parallel Programs 351
Helmut Seidl (Universitt Trier) and Bernhard Steffen (Universitt Dortmund)
Alias Types 366
Frederick Smith, David Walker, and Greg Morrisett (Cornell University)
Polyvariant Flow Analysis with Constrained Types 382
Scott F. Smith and Tiejun Wang (The Johns Hopkins University)
On Exceptions Versus Continuations in the Presence of State 397
Hayo Thielecke (Queen Mary and Westfield College)
Equational Reasoning for Linking with First-Class Primitive Modules 412
J. B. Wells and Ren Vestergaard (Heriot-Watt University)
Author Index 429
END
