Abstract
A standard result from unification theory says that if a finite set E of equations between finite terms is unifiable, then there exists a most general unifier for E. In this paper, the theorem is generalized to the case where E may be infinite. In order to obtain this result, substitutions are allowed to have an infinite domain.
| Original language | English |
|---|---|
| Pages (from-to) | 183-188 |
| Number of pages | 6 |
| Journal | Information Processing Letters |
| Volume | 62 |
| Issue number | 4 |
| Publication status | Published - 28 May 1997 |
Keywords
- Infinite sets
- Logic programming
- Most general unifier
- Programming languages