The following pages link to (Q4281462):
Displaying 15 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem (Q616850) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- A solution to the PoplMark challenge based on de Bruijn indices (Q1945917) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- A Third-Order Representation of the λμ-Calculus (Q2841236) (← links)
- Normalization for the Simply-Typed Lambda-Calculus in Twelf (Q2871835) (← links)
- Programming Inductive Proofs (Q3058448) (← links)
- Mechanizing proofs with logical relations – Kripke-style (Q4691187) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- A PVS Theory for Term Rewriting Systems (Q5178962) (← links)
- Formalization of a λ-calculus with explicit substitutions in Coq (Q6061881) (← links)
- Proving strong normalization of CC by modifying realizability semantics (Q6083688) (← links)
- Closure under alpha-conversion (Q6083699) (← links)