Foreword | |
[lambda]-representable Functions over Free Structures Revisited | p. 1 |
Computing with Abstract Bohm Trees | p. 2 |
Postponing Redex Contractions in Equational Programs | p. 40 |
Towards Manipulation of Mutually Recursive Functions | p. 61 |
Distributed Haskell: Goffin on the Internet | p. 80 |
Prological Features in a Functional Setting Axioms and Implementations | p. 98 |
On the Semantics of GAEA | p. 123 |
A Functional View of Rewriting and Strategies for a Semantics of ELAN | p. 143 |
Rewriting Logic for Cyclic Sharing Structures (extended abstract) | p. 167 |
Categorical Model Construction for Proving Syntactic Properties | p. 187 |
A Type Theory for Cyclic Structure | p. 207 |
Type-free Equational Reasoning in the Theory of Inductively Defined Types | p. 227 |
Semantics Modifiers: an Approach to Non-Standard Semantics of Programming Languages | p. 247 |
Online Type-Directed Partial Evaluation | p. 271 |
Two-Stage Programming | p. 296 |
Table of Contents provided by Blackwell. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.