A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Extended unification algorithms for the integration of functional programming into logic programming

1987
*
The Journal of Logic Programming
*

1) m' if u= A. (2) f(m, ,..., m,[u+m'] ,..., mJ if m=f(m, ,..., m, ,..., m,) and u=i.u with iEN+. Example 2. Let m = f (g( X, a), b). Then m[l +f(a, a)] =f(f(a, a>, b). DeJinition 4. The depth of an occurrence u is the integer dp(u) defined as follows: dp(u) = 1~1, where lul is the length of the string u. We can now define the notions of term-rewriting systems, reduction, and normal form. EXTENDED UNIFICATION ALGORITHMS 203 Dejkition 5. A term-rewriting system [31] is a set of pairs of terms

doi:10.1016/0743-1066(87)90002-1
fatcat:62tfw5gz75fglc4ij3acev4bwq