Safety and conservativity of definitions in HOL and Isabelle/HOL

Author:

Kunčar Ondřej1,Popescu Andrei2

Affiliation:

1. TU Munich, Germany

2. Middlesex University, UK / Institute of Mathematics at Romanian Academy, Romania

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.

Funder

Deutsche Forschungsgemeinschaft

Engineering and Physical Sciences Research Council

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Admissible Types-to-PERs Relativization in Higher-Order Logic;Proceedings of the ACM on Programming Languages;2023-01-09

2. A Formalization and Proof Checker for Isabelle’s Metalogic;Journal of Automated Reasoning;2022-12-12

3. Isabelle/HOL/GST: A Formal Proof Environment for Generalized Set Theories;Lecture Notes in Computer Science;2022

4. Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading;Electronic Proceedings in Theoretical Computer Science;2021-01-12

5. Isabelle’s Metalogic: Formalization and Proof Checker;Automated Deduction – CADE 28;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3