Formalizing adequacy: a case study for higher-order abstract syntax
From MaRDI portal
Publication:2392483
Recommendations
Cites work
- scientific article; zbMATH DE number 65534 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- A framework for defining logics
- A new approach to abstract syntax with variable binding
- A third-order representation of the \(\lambda\mu\)-calculus
- Alpha-structural recursion and induction
- Barendregt’s Variable Convention in Rule Inductions
- Equivalences between logics and their representing type theories
- Formalising in nominal Isabelle Crary's completeness proof for equivalence checking
- Logical frameworks
- Mechanizing metatheory in a logical framework
- Mechanizing the metatheory of LF
- Nominal system T
- Nominal techniques in Isabelle/HOL
- Proof Pearl: De Bruijn Terms Really Do Work
- The representational adequacy of Hybrid
- Types for Proofs and Programs
- Uniform proofs as a foundation for logic programming
Cited in
(2)
This page was built for publication: Formalizing adequacy: a case study for higher-order abstract syntax
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392483)