A decision algorithm for distributive unification
From MaRDI portal
Publication:1275018
DOI10.1016/S0304-3975(98)00081-4zbMath0912.68060MaRDI QIDQ1275018
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (6)
Decidability of bounded second order unification ⋮ Bounded ACh unification ⋮ Unification and matching modulo nilpotence ⋮ Unification modulo ACUI plus distributivity axioms ⋮ Solvability of context equations with two context variables is decidable ⋮ \(\forall \exists^{5}\)-equational theory of context unification is undecidable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
- Algebra of communicating processes with abstraction
- Unification problems with one-sided distributivity
- Unification theory
- The undecidability of the second-order unification problem
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Solving \(*\)-problems modulo distributivity by a reduction to \(AC1\)- unification
- Higher-order unification revisited: Complete sets of transformations
- Process Algebra
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Hilbert's Tenth Problem is Unsolvable
- An algorithm for distributive unification
- Linear second-order unification
- On equality up-to constraints over finite trees, context unification, and one-step rewriting
- A Complete Mechanization of Second-Order Type Theory
This page was built for publication: A decision algorithm for distributive unification
