Getting results from programs extracted from classical proofs
From MaRDI portal
Recommendations
Cites work
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus
- A semantics of evidence for classical arithmetic
- Dependent choice, `quote' and the clock
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 482822 (Why is no real title available?)
- Mixed logic and storage operators
- Pruning simply typed -terms
- Refined program extraction from classical proofs
- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
Cited in
(12)- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
- Extraction and verification of programs by analysis of formal proofs
- Programs from proofs using classical dependent choice
- Refined program extraction from classical proofs: Some case studies
- Practical program extraction from classical proofs
- Exploring the computational content of the infinite pigeonhole principle
- scientific article; zbMATH DE number 65537 (Why is no real title available?)
- scientific article; zbMATH DE number 1301852 (Why is no real title available?)
- Modal functional (``Dialectica) interpretation
- Refined program extraction from classical proofs
- PML2: integrated program verification in ML
- Program extraction from classical proofs
This page was built for publication: Getting results from programs extracted from classical proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882897)