Pages that link to "Item:Q817701"
From MaRDI portal
The following pages link to Program extraction from normalization proofs (Q817701):
Displayed 8 items.
- Extraction of expansion trees (Q670704) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- A Context-based Approach to Proving Termination of Evaluation (Q2805157) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- Extraction in Coq: An Overview (Q3507450) (← 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)