The following pages link to Mechanizing the metatheory of LF (Q2946633):
Displaying 19 items.
- Canonical HybridLF: extending Hybrid with dependent types (Q1744412) (← links)
- \texttt{slepice}: towards a verified implementation of type theory in type theory (Q2119108) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Formalizing adequacy: a case study for higher-order abstract syntax (Q2392483) (← links)
- Explicit contexts in LF (extended abstract) (Q2804940) (← links)
- A simplified account of the metatheory of linear LF (Q2844807) (← links)
- A bidirectional refinement type system for LF (Q2871879) (← links)
- Structural recursion with locally scoped names (Q3016213) (← links)
- Mechanised Computability Theory (Q3088013) (← links)
- Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem (Q3100205) (← links)
- Mechanizing the Metatheory of mini-XQuery (Q3100214) (← links)
- Formalising Observer Theory for Environment-Sensitive Bisimulation (Q3183528) (← links)
- The Isabelle Framework (Q3543647) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Mechanizing proofs with logical relations – Kripke-style (Q4691187) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- Formal SOS-Proofs for the Lambda-Calculus (Q5178966) (← links)
- Mechanizing metatheory in a logical framework (Q5308093) (← links)
- General Bindings and Alpha-Equivalence in Nominal Isabelle (Q5892493) (← links)
