Information and Computation - Semantics of Data Types
A framework for defining logics
Journal of the ACM (JACM)
Basic simple type theory
A New Implementation of Automath
Journal of Automated Reasoning
On the Integrity of a Repository of Formalized Mathematics
MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Mathematical Knowledge Management: 4th International Conference, MKM 2005, Bremen, Germany, July 15-17, 2005, Revised Selected Papers (Lecture Notes in ... / Lecture Notes in Artificial Intelligence)
Translating mathematical vernacular into knowledge repositories
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Textbook proofs meet formal logic: the problem of underspecification and granularity
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Toward an object-oriented structure for mathematical text
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Translating a fragment of weak type theory into type theory with open terms
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Encoding Functional Relations in Scunak
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Representation of Mathematics in a Dependently Typed Set Theory
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Restoring Natural Language as a Computerised Mathematics Input Method
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Generating Responses to Formally Flawed Problem-Solving Statements
Proceedings of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work
A tactic language for declarative proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A User-friendly Interface for a Lightweight Verification System
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Many textbook proofs are essentially human-readable representations of natural deduction proofs. Terms in dependent type theory provide formally checkable representations of natural deduction proofs. We show how the new mathematical assistant system Scunak can be used to verify a textbook proof by translating the LATEX version into a proof term in a dependent type theory. We also show how Scunak can give interesting output upon failure.