Pages that link to "Item:Q817701"
From MaRDI portal
The following pages link to Program extraction from normalization proofs (Q817701):
Displaying 14 items.
- Extraction of expansion trees (Q670704) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Proof normalization with nonstandard objects (Q1178706) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Intuitionistic model constructions and normalization proofs (Q2785696) (← links)
- A context-based approach to proving termination of evaluation (Q2805157) (← links)
- Eliminating proofs from programs (Q2844809) (← links)
- Program extraction from proofs of weak head normalization (Q2852349) (← links)
- Normalization for the simply-typed lambda-calculus in Twelf (Q2871835) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- Extraction in Coq: An Overview (Q3507450) (← links)
- (Q4281467) (← links)
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention (Q5022932) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)