Pages that link to "Item:Q1823656"
From MaRDI portal
The following pages link to Extraction and verification of programs by analysis of formal proofs (Q1823656):
Displaying 16 items.
- A complexity analysis of functional interpretations (Q557798) (← links)
- Extraction of redundancy-free programs from constructive natural deduction proofs (Q808284) (← links)
- Program extraction from normalization proofs (Q817701) (← links)
- Proofs and programs: A naïve approach to program extraction (Q912594) (← links)
- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction (Q1595930) (← links)
- Proof pearl: constructive extraction of cycle finding algorithms (Q1791179) (← links)
- Getting results from programs extracted from classical proofs (Q1882897) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Writing constructive proofs yielding efficient extracted programs (Q2703717) (← links)
- Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach (Q2802468) (← links)
- A large-scale experiment in executing extracted programs (Q2852042) (← links)
- Program extraction from proofs of weak head normalization (Q2852349) (← links)
- Extracting Imperative Programs from Proofs: In-place Quicksort (Q2968412) (← links)
- (Q4281467) (← links)
- Program verification through characteristic formulae (Q5176951) (← links)
- Studies of a theory of specifications with built-in program extraction (Q5951523) (← links)