Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for influential proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We factor HOL into a constructive core plus axioms of excluded middle and choice. We similarly factor standard...
Main Authors: | Robert Constable, Wojciech Moczydlowski |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2008-09-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1140/pdf |
Similar Items
-
Normalization of IZF with Replacement
by: Wojciech Moczydlowski
Published: (2008-04-01) -
A Normalizing Intuitionistic Set Theory with Inaccessible Sets
by: Wojciech Moczydlowski
Published: (2007-08-01) -
Classical BI: Its Semantics and Proof Theory
by: James Brotherston, et al.
Published: (2010-07-01) -
Intuitionistic Layered Graph Logic: Semantics and Proof Theory
by: Simon Docherty, et al.
Published: (2018-10-01) -
A Finite-Model-Theoretic View on Propositional Proof Complexity
by: Erich Grädel, et al.
Published: (2022-06-01)