|
|
Sold Out
Book Categories |
| A modular hierarchy of logical frameworks | 1 | |
| Tailoring filter models | 17 | |
| Locales and locale expressions in Isabelle/Isar | 34 | |
| Introduction of PAF!, a proof assistant for ML programs verification | 51 | |
| A constructive proof of Higman's lemma in Isabelle | 66 | |
| A core calculus of higher-order mixins and classes | 83 | |
| Type inference for nested self types | 99 | |
| Inductive families need not store their indices | 115 | |
| Modules in coq are and will be correct | 130 | |
| Rewriting calculus with fixpoints : untyped and first-order systems | 147 | |
| First-order reasoning in the calculus of inductive constructions | 162 | |
| Higher-order linear ramified recurrence | 178 | |
| Confluence and strong normalisation of the generalised multiary [lambda]-calculus | 194 | |
| Wellfounded trees and dependent polynomial functors | 210 | |
| Classical proofs, typed processes, and intersection types | 226 | |
| "Wave-style" geometry of interaction models in rel are graph-like lambda-models | 242 | |
| Coercions in Hindley-Milner systems | 259 | |
| Combining incoherent coercions for [Sigma]-types | 276 | |
| Induction and co-induction in sequent calculus | 293 | |
| QArith : coq formalisation of lazy rational arithmetic | 309 | |
| Mobility types in coq | 324 | |
| Some algebraic structures in lambda-calculus with inductive types | 338 | |
| A concurrent logical framework : the propositional fragment | 355 | |
| Formal proof sketches | 378 | |
| Applied type system | 394 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Marian Guglielmoni
reviewed Types for Proofs and Programs, Vol. 115 on January 13, 2014
Types for Proofs and Programs, Vol. 115
I read this on the advice of Dr. Eiselt, Dean (at that time) of the College of Computing, after asking him via email "alright, I'm taking classes and whatnot, but I want the Stygian deep; I want to go down as far as I can; I want and need to read those books which have shaped the great computer scientists before me, the real thing." Having probed the shelves of computer science and mathematics since, I remain convinced he could have given no better advice to a precocious freshman. Used for several decades at MIT, this second edition is more than thorough enough for an introduction to computer science anywhere. Taught using the Scheme system (with its close bindings to the type-free λ-calculus), this canonical work covers register machines, logic programming, nondeterministic evaluation, the relations of recursion to iteration, and a wealth of carefully-woven-in jewels from number theory and discrete mathematics. Every programmer thinking himself the real deal owes it to himself to read through this grand work, epic in scope and breathtaking in sudden illuminations.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Types for Proofs and Programs, Vol. 115
X
This Item is in Your Inventory
Types for Proofs and Programs, Vol. 115
X
You must be logged in to review the productsX
X
X
Add Types for Proofs and Programs, Vol. 115, , Types for Proofs and Programs, Vol. 115 to the inventory that you are selling on WonderClubX
X
Add Types for Proofs and Programs, Vol. 115, , Types for Proofs and Programs, Vol. 115 to your collection on WonderClub |