Unification for infinite sets of equations between finite terms
From MaRDI portal
Recommendations
Cites work
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- A Machine-Oriented Logic Based on the Resolution Principle
- An Efficient Unification Algorithm
- An improved proof procedure1
- Fundamental properties of infinite trees
- Generalizations of unification
- scientific article; zbMATH DE number 3181598 (Why is no real title available?)
- scientific article; zbMATH DE number 592368 (Why is no real title available?)
- scientific article; zbMATH DE number 851596 (Why is no real title available?)
- Linear unification
- Properties of substitutions and unifications
Cited in
(9)- Unification of kinded infinite trees
- A remark on infinite matching vs infinite unification
- Unification and infinite series
- scientific article; zbMATH DE number 36613 (Why is no real title available?)
- scientific article; zbMATH DE number 1267560 (Why is no real title available?)
- scientific article; zbMATH DE number 702882 (Why is no real title available?)
- On unification of terms with integer exponents
- scientific article; zbMATH DE number 1389857 (Why is no real title available?)
- Variants in the Infinitary Unification Wonderland
This page was built for publication: Unification for infinite sets of equations between finite terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287056)