J. Robinson. A maclfine-oriented logic based on the resolution principle. Journal of the AUM, 12(1):23-41, 1965.  Home/Search   Document Not in Database   Summary   Related Articles

....variables to hsts of types. In the following, we use A x to denote the set of type assumptions in A except those for variable x, and A(x) to denote the set of types associated with variable x in A. We als0 use Unifyto denote Robinson s original unification algorithm on classical term algebras [26]. Unify takes a set of pairs of types and returns a substitution (the most general unifier) Figure 1 gives the assumption inference algorithm W and 441 the matching algorithm Match. W takes an ML expression, and returns a type and an assumption environment. Match takes an ML type environment ....

J. Robinson. A maclfine-oriented logic based on the resolution principle. Journal of the AUM, 12(1):23-41, 1965.

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