Safety and conservativity of definitions in HOL and Isabelle/HOL
Kunčar, Ondřej and Popescu, Andrei (2018) Safety and conservativity of definitions in HOL and Isabelle/HOL. Proceedings of the ACM on Programming Languages, 2 , 24. pp. 1-26. ISSN 2475-1421 [Article] (doi:10.1145/3158112)
|
PDF
- Published version (with publisher's formatting)
Download (809kB) | Preview |
|
|
PDF
- Final accepted version (with author's formatting)
Download (796kB) | Preview |
Abstract
Definitions are traditionally considered to be a safe mechanism for introducing concepts on top of a logic known to be consistent. In contrast to arbitrary axioms, definitions should in principle be treatable as a form of abbreviation, and thus compiled away from the theory without losing provability. In particular, definitions should form a conservative extension of the pure logic. These properties are crucial for modern interactive theorem provers, since they ensure the consistency of the logic, as well as a valid environment for total/certified functional programming.
We prove these properties, namely, safety and conservativity, for Higher-Order Logic (HOL), a logic implemented in several mainstream theorem provers and relied upon by thousands of users. Some unique features of HOL, such as the requirement to give non-emptiness proofs when defining new types and the impossibility to unfold type definitions, make the proof of these properties, and also the very formulation of safety, nontrivial.
Our study also factors in the essential variation of HOL definitions featured by Isabelle/HOL, a popular member of the HOL-based provers family. The current work improves on recent results which showed a weaker property, consistency of Isabelle/HOL’s definitions.
| Item Type: | Article |
|---|---|
| Additional Information: | Proceedings of the ACM on Programming Languages, Volume 2 Issue POPL, January 2018. The published article is available on open access at: https://doi.org/10.1145/3158112 |
| Research Areas: | A. > School of Science and Technology > Computer Science |
| Item ID: | 23359 |
| Notes on copyright: | As a Gold Open Access journal, PACMPL is committed to making high-quality peer-reviewed scientific research in programming languages free of restrictions on both access and (re-)use. Through the generous support of ACM and SIGPLAN, all papers published in PACMPL are guaranteed permanent free online access to the definitive version in the ACM Digital Library.
Accepted version: Copyright © 2017 ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the ACM on Programming Languages, Volume 2 Issue POPL, January 2018, Article No. 24 , http://dx.doi.org/10.1145/3158112 |
| Useful Links: | |
| Depositing User: | Andrei Popescu |
| Date Deposited: | 19 Jan 2018 16:11 |
| Last Modified: | 29 Nov 2022 20:17 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/23359 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)