Alpha equivalence equalities
From MaRDI portal
Publication:428860
DOI10.1016/j.tcs.2012.01.030zbMath1244.68030OpenAlexW2063470124MaRDI QIDQ428860
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.030
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Nominal lambda calculus: an internal language for FM-Cartesian closed categories ⋮ Equational logic and categorical semantics for multi-languages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to abstract syntax with variable binding
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Capture-avoiding substitution as a nominal algebra
- Nominal unification
- Nominal logic, a first order theory of names and binding
- Some lambda calculus and type theory formalized
- Nominal rewriting
- A general mathematics of names
- Completeness of bisimilarity for contextual equivalence in linear theories
- The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective)
- The representational adequacy of <scp>Hybrid</scp>
- Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
- Binding in Nominal Equational Logic
- Proof Pearl: De Bruijn Terms Really Do Work
- Nominal Renaming Sets
- (Nominal) Unification by Recursive Descent with Triangular Substitutions
- Nominal Unification from a Higher-Order Perspective
This page was built for publication: Alpha equivalence equalities