Writing constructive proofs yielding efficient extracted programs
From MaRDI portal
Recommendations
- Extraction and verification of programs by analysis of formal proofs
- Towards the theory of programming in constructive logic
- Extraction of redundancy-free programs from constructive natural deduction proofs
- Proofs and programs: A naïve approach to program extraction
- Analysis of methods for extraction of programs from non-constructive proofs.
Cited in
(6)- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
- Proof pearl: constructive extraction of cycle finding algorithms
- Using subtyping in program optimization
- Extracting Algorithms from Intuitionistic Proofs
- Extracting general recursive program schemes in Nuprl's type theory
- Extraction of redundancy-free programs from constructive natural deduction proofs
This page was built for publication: Writing constructive proofs yielding efficient extracted programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2703717)