<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-12-15 12:39:29Type theory Automated theorem proving Logic in computer science Formal methods Proof assistants Coq CurryHoward correspondence Lambda calculus Propositional calculus First-order logic |
Add to Reading List |
propositional logic logical verification week | Contractibility + transport ⇔ J Carlo Angiuli December 1, 2014 In MLTT, we usually define the identity type as a reflexive relation satisfying J: Γ`M :A Γ`N :ADocID: 1rsbE - View Document |
| PML : A new proof assistant and deduction system Christophe Raffalli LAMADocID: 1rnYn - View Document |
| Type Theory and Constructive Mathematics Type Theory and Constructive Mathematics Thierry Coquand University of GothenburgDocID: 1rnzm - View Document |
| Herbrand-Confluence for Cut Elimination in Classical First Order Logic Stefan Hetzl1 and Lutz Straßburger2 1 2DocID: 1rkb2 - View Document |
| Type-Based Reasoning and Imprecise Errors Janis Voigtl¨ ander Technische Universit¨ at DresdenDocID: 1rgNC - View Document |