Mechanizing the metatheory of LF
| Autor: | James Cheney, Stefan Berghofer, Christian Urban |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Correctness General Computer Science Computer science Logic Programming language Minor (linear algebra) HOL computer.file_format computer.software_genre Mathematical proof Formal system Logic in Computer Science (cs.LO) Theoretical Computer Science Logical framework Computational Mathematics Automated theorem proving TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Metatheory F.4.1 Executable computer Mathematics |
| Zdroj: | LICS |
| ISSN: | 1557-945X 1529-3785 |
| DOI: | 10.1145/1877714.1877721 |
| Popis: | LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's judgments. Although detailed informal proofs of these properties have been published, they have not been formally verified in a theorem prover. We have formalized these properties within Isabelle/HOL using the Nominal Datatype Package, closely following a recent article by Harper and Pfenning. In the process, we identified and resolved a gap in one of the proofs and a small number of minor lacunae in others. We also formally derive a version of the type checking algorithm from which Isabelle/HOL can generate executable code. Besides its intrinsic interest, our formalization provides a foundation for studying the adequacy of LF encodings, the correctness of Twelf-style metatheoretic reasoning, and the metatheory of extensions to LF. Accepted to ACM Transactions on Computational Logic. Preprint. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|