Abstract is missing.
- Once Upon a TypeDavid N. Turner, Philip Wadler, Christian Mossin. 1-11
- A Generalization of Exceptions and Control in ML-like LanguagesCarl A. Gunter, Didier Rémy, Jon G. Riecke. 12-23
- Unboxed Values and Polymorphic Typing RevisitedPeter Thiemann. 24-35
- Deriving Imperative Code from Functional ProgramsPatrice Quinton, Sanjay V. Rajopadhye, Doran Wilde. 36-44
- Using a Language of Functions and Relations for VLSI SpecificationRobin Sharp, Ole Rasmussen. 45-54
- Abstract Models of Memory ManagementJ. Gregory Morrisett, Matthias Felleisen, Robert Harper. 66-77
- First-Class Schedules and Virtual MapsRajiv Mirani, Paul Hudak. 78-85
- Purely Functional Random-Access ListsChris Okasaki. 86-95
- Pi-Calculus, Dialogue Games and PCFJ. M. E. Hyland, C.-H. Luke Ong. 96-107
- Making Choices LazilyJohn Hughes, Andrew Moran. 108-119
- Compiler Correctness for Parallel LanguagesMitchell Wand. 120-134
- A Second Look at OverloadingMartin Odersky, Philip Wadler, Martin Wehr. 135-146
- Dimension Inference Under Polymorphic RecursionMikael Rittri. 147-159
- Simplifying and Improving Qualified TypesMark P. Jones. 160-169
- Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract InterpretationPatrick Cousot, Radhia Cousot. 170-181
- Dynamic Typing and Subtype InferenceAlexander Aiken, Manuel Fähndrich. 182-191
- Safe Polymorphic Type Inference for Scheme: Translating Scheme to MLFritz Henglein, Jakob Rehof. 192-203
- Semantics of Barriers in a Non-Strict, Implicitly-Parallel LanguageShail Aditya, Arvind, Joseph E. Stoy. 204-215
- How Much Non-Strictness do Lenient Programs Require?Klaus E. Schauser, Seth Copen Goldstein. 216-225
- Parallelism in Sequential Functional LanguagesGuy E. Blelloch, John Greiner. 226-237
- Polytypic Pattern MatchingJohan Jeuring. 238-248
- Lambdas in the Liftshaft - Functional Programming and an Embedded ArchitectureMalcolm Wallace, Colin Runciman. 249-258
- Constructing Functional Programs for Grammar Analysis ProblemsJohan Jeuring, S. Doaitse Swierstra. 259-269
- Interprocedural Register Allocation for Lazy Functional LanguagesUrban Boquist. 270-281
- Highlights from nhc - a Space-efficient Haskell CompilerNiklas Röjemo. 282-292
- Cache Performance of Fast-Allocating ProgramsMarcelo J. R. Gonçalves, Andrew W. Appel. 293-305
- Shortcut Deforestation in Calculational FormAkihiko Takano, Erik Meijer. 306-313
- Warm Fusion: Deriving Build-Cata s from Recursive DefinitionsJohn Launchbury, Tim Sheard. 314-323
- Bananas in Space: Extending Fold and Unfold to Exponential TypesErik Meijer, Graham Hutton. 324-333