Programs from proofs using classical dependent choice
From MaRDI portal
Publication:2482844
Recommendations
Cites work
- A constructive proof of Higman's lemma in Isabelle
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus
- A syntactic theory of sequential control
- An inductive version of Nash-Williams' minimal-bad-sequence argument for Higman's lemma
- Constructive topology and combinatorics
- Dependent choice, `quote' and the clock
- Ein starker Normalisationssatz für die bar-rekursiven Funktionale
- Getting results from programs extracted from classical proofs
- Higman's lemma in type theory
- scientific article; zbMATH DE number 4033746 (Why is no real title available?)
- scientific article; zbMATH DE number 65537 (Why is no real title available?)
- scientific article; zbMATH DE number 3614784 (Why is no real title available?)
- scientific article; zbMATH DE number 1552509 (Why is no real title available?)
- scientific article; zbMATH DE number 2174396 (Why is no real title available?)
- scientific article; zbMATH DE number 2222013 (Why is no real title available?)
- scientific article; zbMATH DE number 2247255 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- On the computational content of the axiom of choice
- Proving open properties by induction
- Recursive programming with proofs
- Refined program extraction from classical proofs
- The greatest common divisor: A case study for program extraction from classical proofs
- Theorem Proving in Higher Order Logics
- Uniform Heyting arithmetic
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(11)- Dependent choice, `quote' and the clock
- Refined program extraction from classical proofs: Some case studies
- Refinement of classical proofs for program extraction
- Exploring the computational content of the infinite pigeonhole principle
- A Constructive Proof of Dependent Choice, Compatible with Classical Logic
- A realization of the negative interpretation of the axiom of choice
- The equivalence of bar recursion and open recursion
- The Peirce translation
- scientific article; zbMATH DE number 895269 (Why is no real title available?)
- scientific article; zbMATH DE number 2247255 (Why is no real title available?)
- Refined program extraction from classical proofs
This page was built for publication: Programs from proofs using classical dependent choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482844)