Sold Out
Book Categories |
Formalized metatheory with terms represented by an indexed family of types | 1 | |
A content based mathematical search engine : whelp | 17 | |
A machine-checked formalization of the random Oracle model | 33 | |
Extracting a normalization algorithm in Isabelle/HOL | 50 | |
A structured approach to proving compiler optimizations based on dataflow analysis | 66 | |
Formalising bitonic sort in type theory | 82 | |
A semi-reflexive tactic for (sub-)equational reasoning | 98 | |
A uniform and certified approach for two static analyses | 115 | |
Solving two problems in general topology via types | 138 | |
A tool for automated theorem proving in Agda | 154 | |
Surreal numbers in Coq | 170 | |
A few constructions on constructors | 186 | |
Tactic-based optimized compilation of functional programs | 201 | |
Interfaces as games, programs as strategies | 215 | |
[lambda]Z : Zermelo's set theory as a PTS with 4 sorts | 232 | |
Exploring the regular tree types | 252 | |
On constructive existence | 268 |
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 ListX
This item is in your CollectionTypes for Proofs and Programs
X
This Item is in Your InventoryTypes for Proofs and Programs
X
You must be logged in to review the productsX
X
X
Add Types for Proofs and Programs, , Types for Proofs and Programs to the inventory that you are selling on WonderClubX
X
Add Types for Proofs and Programs, , Types for Proofs and Programs to your collection on WonderClub |