A framework for point-free program transformation | p. 1 |
Encoding strategies in the lambda calculus with interaction nets | p. 19 |
Proof tool support for explicit strictness | p. 37 |
A rational deconstruction of Landin's J operator | p. 55 |
A dependency typed framework for static analysis of program execution costs | p. 74 |
Accurate step counting | p. 91 |
The implementation of iData | p. 106 |
A high-level implementation of composable memory transactions in concurrent haskell | p. 124 |
Polytypic syntax tree operations | p. 142 |
Implementing a numerical solution of the KPI equation using single assignment C : lessons and experiences | p. 160 |
With-loop fusion for data locality and parallelism | p. 178 |
A document-centered environment for Haskell | p. 196 |
A binding scope analysis for generic programs on arrays | p. 212 |
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.