Top
| Concurrency in Functional and Logic Programming | p. 1 |
| Towards a Denotational Semantics for Concurrent State Transformers | p. 19 |
| Dynamic Binding and Lexical Binding in a Transformation Calculus | p. 34 |
| Conservative Extensions of Polymorphic PCF | p. 48 |
| A [lambda]-calculus with Overloading and Inheritance | p. 63 |
| Type Inference for Simply-Typed Environment Calculus with Shadowing | p. 76 |
| Functional Counterparts of Some Logic Programming Techniques | p. 90 |
| A Deterministic Lazy Narrowing Calculus | p. 104 |
| Completeness of Narrowing for Orthogonal Conditional Rewrite Systems | p. 119 |
| Using First-Order Narrowing to Solve Goals of Higher-order Patterns | p. 134 |
| Equivalence Between the Quotient Term Model and the Least Complete Herbrand Model for a Functional-Logic Language | p. 148 |
| An Efficient Calculus for Constraint Functional-Logic Programming Languages | p. 164 |
| Fusion and Tupling Transformations: Synergies and Conflicts | p. 176 |
| Promotional Transformation of Monadic Programs | p. 196 |
| A Tabulation Transformation Tactic Using Haskell Arrays | p. 211 |
| Efficient Call-by-value Evaluation of Primitive Recursive Program Schemes | p. 224 |
| The Generation of a Higher-Order Online Partial Evaluator | p. 239 |
| Binding Time Analysis for Data Type Specialization | p. 254 |
| Parallel Functional Implementations: Graphbased vs. Stackbased Reduction | p. 270 |
| A Throw-away Compiler for a Lazy Functional Language | p. 287 |
| Generating Fast Garbage Collection Methods for Declarative Languages | p. 301 |
| Compiling Programs of an Applicative Narrowing Calculus | p. 316 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
