Pages that link to "Item:Q1595930"
From MaRDI portal
The following pages link to The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction (Q1595930):
Displaying 11 items.
- Abstract derivation of transitive closure algorithms (Q287162) (← links)
- Mathematical method and proof (Q857692) (← links)
- The metamathematics of ergodic theory (Q1006602) (← links)
- Proof pearl: constructive extraction of cycle finding algorithms (Q1791179) (← links)
- Extraction and verification of programs by analysis of formal proofs (Q1823656) (← links)
- Getting results from programs extracted from classical proofs (Q1882897) (← links)
- Light Dialectica program extraction from a classical Fibonacci proof (Q2864211) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- Decision procedure of some relevant logics: a constructive perspective (Q3647218) (← links)
- Proof-theoretic notions for software maintenance (Q4923374) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)