Unification for infinite sets of equations between finite terms
From MaRDI portal
Publication:287056
DOI10.1016/S0020-0190(97)00063-XzbMath1337.68238MaRDI QIDQ287056
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Cites Work
- Fundamental properties of infinite trees
- Properties of substitutions and unifications
- Linear unification
- Generalizations of unification
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- An improved proof procedure1
- An Efficient Unification Algorithm
- A Machine-Oriented Logic Based on the Resolution Principle
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unification for infinite sets of equations between finite terms