Nominal AC-matching
From MaRDI portal
Publication:6118812
DOI10.1007/978-3-031-42753-4_4MaRDI QIDQ6118812
Daniele Nantes-Sobrinho, Mauricio Ayala-Rincón, Maribel Fernández, Temur Kutsia, Gabriel Ferreira Silva
Publication date: 28 February 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to abstract syntax with variable binding
- Nominal techniques in Isabelle/HOL
- A polynomial nominal unification algorithm
- Matching and alpha-equivalence check for nominal terms
- Associative-commutative unification
- Efficient solution of linear diophantine equations
- Competing for the \(AC\)-unification race
- Nominal C-unification
- On solving nominal fixpoint equations
- Completeness in PVS of a nominal unification algorithm
- Nominal unification
- Nominal rewriting
- Nominal unification of higher order expressions with recursive let
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
- Nominal Sets
- A Unification Algorithm for Associative-Commutative Functions
- Formalising nominal C-unification generalised with protected variables
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let
- FreshML
- An Efficient Nominal Unification Algorithm
- (Nominal) Unification by Recursive Descent with Triangular Substitutions
- Nominal Unification from a Higher-Order Perspective
- Rewriting Techniques and Applications
This page was built for publication: Nominal AC-matching
