Theorem Proving in Dependently-Typed Higher-Order Logic
Rothgang, Colin; Rabe, Florian; Benzmüller, Christoph (2023): Theorem Proving in Dependently-Typed Higher-Order Logic, in: Bamberg: Otto-Friedrich-Universität, S. 438–455.
Details
- Faculty/Chair
- Faculty/Professorship
- Author
- Rothgang, ColinRabe, Florian
- Publisher Information
- Otto-Friedrich-Universität : Bamberg
- Year of publication
- 2023
- Source/Other editions
- Automated Deduction – CADE 29 : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings / Brigitte Pientka, Cesare Tinelli (Hg.). - Cham: Springer Nature Switzerland, 2023, S. 438–455. - ISBN: 978-3-031-38498-1
- Year of first publication
- 2023
- Language
- English
- Licence
- URN
- Abstract
Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. But its type system lacks advanced features where types may depend on terms. Dependent type theory offers such a rich type system, but has rather substantial conceptual differences to HOL, as well as comparatively poor proof automation support.
We introduce a dependently-typed extension DHOL of HOL that retains the style and conceptual framework of HOL. Moreover, we build a translation from DHOL to HOL and implement it as a preprocessor to a HOL theorem prover, thereby obtaining a theorem prover for DHOL.
- GND Keywords
- HOLTypentheorie
- Keywords
- Dependently-Typed Higher-Order Logic
- DDC Classification
- 004 Computer science
- RVK Classification
- ST 304
- Peer Reviewed
- yes
- International Distribution
- yes
- Type
- Conferenceobject
- URI
- Activation date
- 2023-11-06