Closed nominal rewriting and efficiently computable nominal algebra equality

DOI10.4204/EPTCS.34.5MaRDI QIDQ6941740zbMATH OpenFDO

Authors Maribel Fernández, Murdoch J. Gabbay

Publication date 19 August 2025

Copyright license Creative Commons license

Full work available at URL https://doi.org/10.4204/EPTCS.34.5

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Cites work

• A calculus of mobile processes. II
• A new approach to abstract syntax with variable binding
• An efficient nominal unification algorithm
• Automata, Languages and Programming
• Combinatory reduction systems: Introduction and survey
• Higher-order rewrite systems and their confluence
• scientific article; zbMATH DE number 2185713 (Why is no real title available?)
• scientific article; zbMATH DE number 5872263 (Why is no real title available?)
• scientific article; zbMATH DE number 3702108 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Nominal (universal) algebra: equational logic with names and binding
• Nominal equational logic
• Nominal Matching and Alpha-Equivalence
• Nominal rewriting
• Nominal unification
• Nominal unification from a higher-order perspective
• One-and-a-halfth-order Logic
• Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
• Solution of the Robbins problem

Cited in

(2)

• A nominal approach to equational problems in languages with binders
• Nominal Henkin semantics: simply-typed lambda-calculus models in nominal sets

This page was built for publication: Closed nominal rewriting and efficiently computable nominal algebra equality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941740)