Nominal Matching and Alpha-Equivalence
From MaRDI portal
Publication:3511452
DOI10.1007/978-3-540-69937-8_11zbMath1155.68362OpenAlexW1593245524MaRDI QIDQ3511452
Christophe Calvès, Maribel Fernández
Publication date: 10 July 2008
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69937-8_11
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Nominal syntax with atom substitutions ⋮ Unity in nominal equational reasoning: the algebra of equality on nominal sets ⋮ The First-Order Nominal Link ⋮ A polynomial nominal unification algorithm
Cites Work
- Unnamed Item
- A new approach to abstract syntax with variable binding
- Nominal unification
- Nominal logic, a first order theory of names and binding
- Nominal rewriting
- On theories with a combinatorial definition of 'equivalence'
- Nominal Equational Logic
- Implementing Nominal Unification
- Capture-Avoiding Substitution as a Nominal Algebra
- FreshML
- OCaml + XDuce
This page was built for publication: Nominal Matching and Alpha-Equivalence