(Co-)Iteration for Higher-Order Nested Datatypes | p. 1 |
Program Extraction in Simply-Typed Higher Order Logic | p. 21 |
General Recursion in Type Theory | p. 39 |
Using Theory Morphisms for Implementing Formal Methods Tools | p. 59 |
Subsets, Quotients and Partial Functions in Martin-Lof's Type Theory | p. 78 |
Mathematical Quotients and Quotient Types in Coq | p. 95 |
A Constructive Formalization of the Fundamental Theorem of Calculus | p. 108 |
Two Behavioural Lambda Models | p. 127 |
A Unifying Approach to Recursive and Co-recursive Definitions | p. 148 |
Holes with Binding Power | p. 162 |
Typing with Conditions and Guarantees for Functional In-place Update | p. 182 |
A New Extraction for Coq | p. 200 |
Weak Transitivity in Coercive Subtyping | p. 220 |
The Not So Simple Proof-Irrelevant Model of CG | p. 240 |
Structured Proofs in Isar/HOL | p. 259 |
Java as a Functional Programming Language | p. 279 |
Monad Translating Inductive and Coinductive Types | p. 299 |
A Finite First-Order Presentation of Set Theory | p. 316 |
Author Index | p. 331 |
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.