Abstract is missing.
- Improving CPS-Based Partial Evaluation: Writing Cogen by HandAnders Bondorf, Dirk Dussart. 1-9
- The Essence of Eta-Expansion in Partial EvaluationOlivier Danvy, Karoline Malmkjær, Jens Palsberg. 11-20
- Improving Programs Which Recurse over Multiple Inductive StructuresLeonidas Fegaras, Tim Sheard, Tong Zhou. 21-32
- Analysing Resource Use in the Lambda Calculus by Type InferenceSimon Courtenage, Chris D. Clack. 33-41
- Type Theory and Projections for Higher-Order Static AnalysisClement A. Baker-Finch. 43-52
- PERs from Projections for Binding-Time AnalysisKei Davis. 53-60
- Binding-Time Analysis for Standard MLLars Birkedal, Morten Welinder. 61-71
- Higher-Order Redundancy EliminationPeter Thiemann. 73-83
- Identifying Profitable Specialization in Object-Oriented LanguagesJeffrey Dean, Craig Chambers, David Grove. 85-96
- Lightweight Run-Time Code GenerationMark Leone, Peter Lee. 97-106
- Dictionary-Free Overloading by Partial EvaluationMark P. Jones. 107-117
- Partial Evaluation of Numerical Programs in FortranRomana Baier, Robert Glück, Robert Zöchling. 119-132
- Partial Evaluation for Scientific Computing: The Supercomputer Toolkit ExperienceAndrew A. Berlin, Rajeev J. Surati. 133-141