| Katherine Yelick. A generalized approach to equational unification. Technical Report MIT/LCS/TR-344, M.I.T., August 1985. 137 |
....first step in reducing a term T by G: LHS RHS is to obtain a substitution oe by matching LHS to T . The guard must then be discharged by reducing oe(G) to true. Only then can the original term be reduced. 6.2. 2 Operator Theories Operator theories enhance term rewriting by generalizing matching [54]. Each function symbol has an operator theory. The three operator theories handled by LP are: empty, commutative, and associativecommutative. These restrictions on the use of quantifiers will be removed in the next release of LP. 85 A function s operator theory determines how LP performs ....
Katherine Yelick. A generalized approach to equational unification. Technical Report MIT/LCS/TR-344, M.I.T., August 1985. 137
....that one can come surprisingly close to satisfying this assumption. The two programs that we studied perform very different tasks and are written in different programming languages. One program, AC Unify, computes the unifying substitutions for terms containing associative commutative operators [22]. It is 8,000 lines of commented CLU code. The other program, SIM, simulates an object oriented database [7] and is 7,000 lines of commented C code. These programs did have some key attributes in common. Although both were carefully designed for algorithmic efficiency, neither had been highly ....
K. Yelick. A generalized approach to equational unification. Technical Report MIT/LCS/TR-344, M.I.T., August 1985.
No context found.
Yelick, K. A. (1985b), "A Generalized Approach to Equational Unification", Ph.D.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC