The Unification of Infinite Sets of Terms and Its Applications

In various fields using first order terms — like automated reasoning, logic programming or term rewriting — we encounter infinite sequences of structurally similar terms, leading to non-terminating or at least time and space consuming computations. As a remedy we introduce a meta-language consisting of recursive terms (R-terms), which are a finite representation of infinite sets of terms.