Abstract is missing.
- Types in Lambda Calculi and Programming LanguagesHenk Barendregt, Kees Hemerik. 1-35
- Symbolic Finite Differencing - Part IRobert Paige. 36-56
- Implementation of an Interpreter for a Parallel Language in CentaurYves Bertot. 57-69
- Automatic Autoprojection of Higher Order Recursive EquationsAnders Bondorf. 70-87
- From Interpreting to Compiling Binding TimesCharles Consel, Olivier Danvy. 88-105
- Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanismDanny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe. 106-117
- Type Inference for Action SemanticsSusan Even, David A. Schmidt. 118-133
- On the Expressive Power of Programming LanguagesMatthias Felleisen. 134-151
- Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program ImplementationsBenjamin Goldberg, Young Gil Park. 152-160
- Development of Concurrent Systems by Incremental TransformationsE. Pascal Gribomont. 161-176
- Set DomainsReinhold Heckmann. 177-196
- Resolution and Type TheoryLeen Helmink. 197-211
- A Syntactic Theory of Transparent ParameterizationStanley Jefferson, Shinn-Der Lee, Daniel P. Friedman. 212-226
- A Backwards Analysis for Compile-time Garbage CollectionThomas P. Jensen, Torben Æ. Mogensen. 227-239
- Techniques for Improving Grammar Flow AnalysisMartin Jourdan, Didier Parigot. 240-255
- The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite SystemsRichard Kennaway. 256-270
- Graph-based Implementation of a Functional Logic LangugageHerbert Kuchen, Rita Loogen, Juan José Moreno-Navarro, Mario Rodríguez-Artalejo. 271-290
- Eureka Definitions for Free! or Disagreement Points for Fold/Unford TransformationsHanne Riis Nielson, Flemming Nielson. 291-305
- Synthesis of Eureka Predicates for Developing Logic ProgramsMaurizio Proietti, Alberto Pettorossi. 306-325
- Algebraic Properties of Program IntegrationThomas W. Reps. 326-340
- Arity Raiser and its Use in Program SpecializationSergei A. Romanenko. 341-360 [doi]
- Complexity Analysis for a Lazy Higher-Order LanguageDavid Sands. 361-376
- On the Weak Adequacy of Branching-Time Remporal LogicPh. Schnoebelen, Sophie Pinchinat. 377-388
- The Value Flow Graph: A Program Representation for Optimal Program TransformationsBernhard Steffen, Jens Knoop, Oliver Rüthing. 389-405
- Type Inference and Implicit ScalingSatish Thatte. 406-420
- Towards the Theory of Programming in Constructive LogicAndrei Voronkov. 421-435