Abstract is missing.
- Functional NetsMartin Odersky. 1-25 [doi]
- Faithful Translations between Polyvariant Flows and Polymorphic TypesTorben Amtoft, Franklyn A. Turbak. 26-40 [doi]
- On the Expressiveness of Event Notification in Data-Driven Coordination LanguagesNadia Busi, Gianluigi Zavattaro. 41-55 [doi]
- Flow-Directed Closure Conversion for Typed LanguagesHenry Cejtin, Suresh Jagannathan, Stephen Weeks. 56-71 [doi]
- Directional Type Checking for Logic Programs: Beyond Discriminative TypesWitold Charatonik. 72-87 [doi]
- Formalizing Implementation Strategies for First-Class ContinuationsOlivier Danvy. 88-103 [doi]
- Correctness of Java Card Method Lookup via Logical RelationsEwen Denney, Thomas P. Jensen. 104-118 [doi]
- Compile-Time Debugging of C Programs Working on TreesJacob Elgaard, Anders Møller, Michael I. Schwartzbach. 119-134 [doi]
- A Calculus for Compiling and Linking ClassesKathleen Fisher, John H. Reppy, Jon G. Riecke. 135-149 [doi]
- Abstract Domains for Universal and Existential PropertiesAndrew Heaton, Patricia M. Hill, Andy King. 150-164 [doi]
- A Type System for Bounded Space and Functional In-Place Update--Extended AbstractMartin Hofmann. 165-179 [doi]
- Secure Information Flow as Typed Process BehaviourKohei Honda, Vasco Thudichum Vasconcelos, Nobuko Yoshida. 180-199 [doi]
- Implementing Groundness Analysis with Definite Boolean FunctionsJacob M. Howe, Andy King. 200-214 [doi]
- The Correctness of Type SpecialisationJohn Hughes. 215-229 [doi]
- Type Classes with Functional DependenciesMark P. Jones. 230-244 [doi]
- Sharing Continuations: Proofnets for Languages with Explicit ControlJulia L. Lawall, Harry G. Mairson. 245-259 [doi]
- A Calculus for Link-Time CompilationElena Machkasova, Franklyn A. Turbak. 260-274 [doi]
- Improving the Representation of Infinite Trees to Deal with Sets of TreesLaurent Mauborgne. 275-289 [doi]
- On the Translation of Procedures to Finite MachinesMarkus Müller-Olm, Andreas Wolf. 290-304 [doi]
- A Kleene Analysis of Mobile AmbientsFlemming Nielson, Hanne Riis Nielson, Shmuel Sagiv. 305-319 [doi]
- A 3-Part Type Inference EngineFrançois Pottier. 320-335 [doi]
- First-Class Structures for Standard MLClaudio V. Russo. 336-350 [doi]
- Constraint-Based Inter-Procedural Analysis of Parallel ProgramsHelmut Seidl, Bernhard Steffen. 351-365 [doi]
- Alias TypesFrederick Smith, David Walker, J. Gregory Morrisett. 366-381 [doi]
- Polyvariant Flow Analysis with Constrained TypesScott F. Smith, Tiejun Wang. 382-396 [doi]
- On Exceptions Versus Continuations in the Presence of StateHayo Thielecke. 397-411 [doi]
- Equational Reasoning for Linking with First-Class Primitive ModulesJ. B. Wells, René Vestergaard. 412-428 [doi]