Loading...
Please wait, while we are loading the content...
Similar Documents
Towards extracting explicit proofs from totality checking in twelf
| Content Provider | ACM Digital Library |
|---|---|
| Author | Nadathur, Gopalan Wang, Yuting |
| Abstract | The Edinburgh Logical Framework (LF) is a dependently type lambda calculus that can be used to encode formal systems. The versatility of LF allows specifications to be constructed also about the encoded systems. The Twelf system exploits the correspondence between formulas and types to give specifications in LF a logic programming interpretation. By interpreting particular arguments as input and others as output, specifications can be seen as describing non-deterministic functions. We can then prove meta-theorems about the encoded systems by showing particular such functions to be total. Twelf provides tools for establishing totality. However, the resulting proofs of meta-theorems are implicit in that they do not yield a certificate that can be given to a proof checker. We begin the process here of making these proofs explicit. We treat the restricted situation in Twelf where context definitions (regular worlds), mutually recursive definitions and lemmas are not used. In this setting we describe and prove correct a translation of the steps in totality checking into an actual proof in the companion logic M2. |
| Starting Page | 55 |
| Ending Page | 66 |
| Page Count | 12 |
| File Format | |
| ISBN | 9781450323826 |
| DOI | 10.1145/2503887.2503893 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2013-09-23 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | Totality checking Proof certificates Specification and reasoning Dependently typed lambda-calculi |
| Content Type | Text |
| Resource Type | Article |
