Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
From MaRDI portal
Recommendations
- Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
- Program extraction in simply-typed higher order logic
- Towards the theory of programming in constructive logic
- Practical program extraction from classical proofs
- Extraction and verification of programs by analysis of formal proofs
Cited in
(5)- Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
- Unifying Sets and Programs via Dependent Types
- Unifying sets and programs via dependent types
- A Normalizing Intuitionistic Set Theory with Inaccessible Sets
- Extracting the resolution algorithm from a completeness proof for the propositional calculus
This page was built for publication: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613407)