Barendregt’s Variable Convention in Rule Inductions
From MaRDI portal
Publication:3608761
Recommendations
Cited in
(18)- A formalized general theory of syntax with bindings
- A solution to the PoplMark challenge based on de Bruijn indices
- A formalized general theory of syntax with bindings: extended version
- Rensets and renaming-based recursion for syntax with bindings
- A canonical locally named representation of binding
- Formalizing adequacy: a case study for higher-order abstract syntax
- On the role of names in reasoning about -tree syntax specifications
- Mechanizing the metatheory of mini-XQuery
- The role of indirections in lazy natural semantics
- Nominal Inversion Principles
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention
- Psi-calculi in Isabelle
- Psi-calculi in Isabelle
- Rensets and renaming-based recursion for syntax with bindings extended version
- Invertibility in Sequent Calculi
- Strong Normalization of Moggis's Computational Metalanguage
- Nominal techniques in Isabelle/HOL
- External and internal syntax of the \(\lambda \)-calculus
This page was built for publication: Barendregt’s Variable Convention in Rule Inductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608761)