Abstract is missing.
- Type Classes and Overloading Resolution via Order-Sorted UnificationTobias Nipkow, Gregor Snelting. 1-14
- On the Complexity of ML Typability with OverloadingDennis M. Volpano, Geoffrey Smith. 15-28
- Coercive Type IsomorphismSatish R. Thatte. 29-49
- Compiler-Controlled Multithreading for Lenient Parallel LanguagesKlaus E. Schauser, David E. Culler, Thorsten von Eicken. 50-72
- Multi-thread Code Generation for Dataflow Architectures from Non-Strict ProgramsKenneth R. Traub. 73-101
- GAML: a Parallel Implementation of Lazy MLLuc Maranget. 102-123
- Functional Programming with Bananas, Lenses, Envelopes and Barbed WireErik Meijer, Maarten M. Fokkinga, Ross Paterson. 124-144
- A Strongly-Typed Self-Applicable Partial EvaluatorJohn Launchbury. 145-164
- Automatic Online Partial EvaluationDaniel Weise, Roland Conybeare, Erik Ruf, Scott Seligman. 165-191 [doi]
- Assignments for Applicative LanguagesVipin Swarup, Uday S. Reddy, Evan Ireland. 192-214
- Linearity and LazinessDavid Wakeling, Colin Runciman. 215-240
- Syntactic Detection of Single-Threading Using ContinuationsPascal Fradet. 241-258
- A Projection Model of TypesDavid J. Lillie, Peter G. Harrison. 259-288
- What is an Efficient Implementation of the /lambda-calculus?Gudmund Skovbjerg Frandsen, Carl Sturtivant. 289-312
- Outline of a Proof Theory of ParametricityHarry G. Mairson. 313-327
- Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy LanguagesAllen Leung, Prateek Mishra. 328-351
- Strictness Analysis in Logical FormThomas P. Jensen. 352-366
- A Note on Abstract Interpretation of Polymorphic FunctionsGebreselassie Baraki. 367-378
- Incremental PolymorphismShail Aditya, Rishiyur S. Nikhil. 379-405
- Dynamics in MLXavier Leroy, Michel Mauny. 406-426
- Implementing Regular Tree ExpressionsAlexander Aiken, Brian R. Murphy. 427-447
- Efficient Type Inference for Higher-Order Binding-Time AnalysisFritz Henglein. 448-472 [doi]
- Finiteness AnalysisCarsten Kehler Holst. 473-495
- For a Better Support of Static Data FlowCharles Consel, Olivier Danvy. 496-519
- An Architectural Technique for Cache-level Garbage CollectionTzi-cker Chiueh. 520-537
- M-Structures: Extending a Parallel, Non-strict, Functional Language with StatePaul S. Barth, Rishiyur S. Nikhil, Arvind. 538-568
- List Comprehensions in Agna, A Parallel Persistant Object SystemMichael L. Heytens, Rishiyur S. Nikhil. 569-591
- Generating Efficient Code for Lazy Functional LanguagesSjaak Smetsers, Eric Nöcker, John H. G. van Groningen, Marinus J. Plasmeijer. 592-617
- Making Abstract Machines Less AbstractJohn Hannan. 618-635
- Unboxed Values as First Class Citizens in a Non-Strict Functional LanguageSimon L. Peyton Jones, John Launchbury. 636-666