Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
Purchase Benefits
What is included with this book?
The hydra battle revisited | p. 1 |
Orderings and constraints : theory and practice of proving termination | p. 28 |
Narrowing, abstraction and constraints for proving properties of reduction relations | p. 44 |
Computability closure : ten years later | p. 68 |
Reduction strategies and acyclicity | p. 89 |
Towards rewriting in Coq | p. 113 |
Superdeduction at work | p. 132 |
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic [lambda]-calculus | p. 167 |
Linear recursive functions | p. 182 |
Deducibility constraints, equational theory and electronic money | p. 196 |
Applying a theorem prover to the verification of optimistic replication algorithms | p. 213 |
Towards modular algebraic specifications for pointer programs : a case study | p. 235 |
Modeling permutations in Coq for Coccinelle | p. 259 |
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.