MPI-I-92-207
Semi-unification
Socher-Ambrosius, Rolf
February 1992, 10 pages.
.
Status: available - back from printing
Semi-unifiability is a generalization of both unification and matching. It is used to check nontermination of rewrite rules. In this paper an inference system is presented that decides semi-unifiability of two terms s and t and computes a semi-unifier. In contrast to an algorithm by Kapur, Musser et al, this inference system comes very close to the one for ordinary unification.
-
MPI-I-92-207.pdf
- Attachement: MPI-I-92-207.ps (695 KBytes); MPI-I-92-207.pdf (61 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-207
BibTeX
@TECHREPORT{Socher-Ambrosius92b,
AUTHOR = {Socher-Ambrosius, Rolf},
TITLE = {Semi-unification},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-92-207},
MONTH = {February},
YEAR = {1992},
ISSN = {0946-011X},
}