An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 4, Issue 2, 1982, Pages 258-282

  Martelli, Alberto ^a   Montanari, Ugo ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976745321     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/357162.357169     Document Type: Article

References (25)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Baxter, L.D. A practically linear unification algorithm. Res. Rep. CS-76-13, Dep. of Applied Analysis and Computer Science, Univ. of Waterloo, Waterloo, Ontario, Canada.
3. Boyer, R.S., and Moore, J.S. The sharing of structure in theorem-proving programs. In Machine Intelligence, vol. 7, B. Meltzer and D. Michie (Eds.). Edinburgh Univ. Press, Edinburgh, Scotland, 1972, pp. 101-116.
4. Burstall, R.M., and Darlington, J. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan. 1977), 44-67.
5. Chang, C.L., and Lee, R.C. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
6. Hewitt, C. Description and Theoretical Analysis (Using Schemata) of PLANNER: A Language for Proving Theorems and Manipulating Models in a Robot. Ph.D. dissertation, Dep. of Mathematics, Massachusetts Institute of Technology, Cambridge, Mass., 1972.
7. Huet, G. Résolution d'équations dans les langages d'ordre 1, 2,…, u. Thèse d'état, Spécialité Mathèmatiques, Université Paris VII, 1976.
8. Huet, G.P. A unification algorithm for typed A-calculus. Theor. Comput. Sci. 1, 1 (June 1975) 27-57.
9. Knuth, D.E., and Bendix, P.B. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, J. Leech (Ed.). Pergamon Press, Elmsford, N.Y., 1970, pp. 263-297.
10. Kowalski, R. Predicate logic as a programming language. In Information Processing 74, Elsevier North-Holland, New York, 1974, pp. 569-574.
11. Levi, G., and Sirovich, F. Proving program properties, symbolic evaluation and logical procedural semantics. In Lecture Notes in Computer Science, vol. 32: Mathematical Foundations of Computer Science 1975. Springer-Verlag, New York, 1975, pp. 294-301.
12. Martelli, A., and Montanari, U. Theorem proving with structure sharing and efficient unification. Internal Rep. S-77-7,1st. di Scienze della Informazione, University of Pisa, Pisa, Italy; also in Proceedings of the 5th International Joint Conference on Artificial Intelligence, Boston 1977, p. 543.
13. Martelli, A., and Montanari, U. Unification in linear time and space: A structured presentation. Internal Rep. B76-16, 1st. di Elaborazione delle Informazione, Consiglio Nazionale delle Ricerche, Pisa, Italy, July 1976.
14. Milner, R. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 3 (Dec. 1978), 348-375.
15. Paterson, M.S., and Wegman, M.N. Linear unification. J. Comput. Syst. Sci. 16, 2 (April 1978), 158-167.
16. Robinson, J.A. Fast unification. In Theorem Proving Workshop, Oberwolfach, W. Germany, Jan. 1976.
17. Robinson, J.A. Computational logic: The unification computation. In Machine Intelligence, vol. 6, B. Meltzer and D. Michie (Eds.). Edinburgh Univ. Press, Edinburgh, Scotland, 1971, pp. 63-72.
18. Robinson, J.A. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23-41.
19. Shortliffe, E.H. Computer-Based Medical Consultation: MYCIN. Elsevier North-Holland, New York, 1976.
20. Stickel, M.E. A complete unification algorithm for associative-commutative functions. In Proceedings of the 4th International Joint Conference on Artificial Intelligence, Tbilisi, U.S.S.R., 1975, pp. 71-76.
21. Trum, P., and Winterstein, G. Description, implementation, and practical comparison of unification algorithms. Internal Rep. 6/78, Fachbereich Informatik, Univ. of Kaiserlautern, W. Germany.
22. Venturini zilli, M. Complexity of the unification algorithm for first-order expressions. Calcolo 12, 4 (Oct.-Dec. 1975), 361-372.
23. Von henke F.W., and Luckham, D.C. Automatic program verification III: A methodology for verifying programs. Stanford Artificial Intelligence Laboratory Memo AIM-256, Stanford Univ., Stanford, Calif., Dec. 1974.
24. Waldinger, R.J., and Levitt, K.N. Reasoning about programs. Artif. Intell. 5, 3 (Fall 1974), 235-316.
25. Warren, D.H.D., Pereira, L.M., and Pereira, F. PROLOG—The language and its implementation compared with LISP. In Proceedings of Symposium on Artificial Intelligence and Programming Languages, Univ. of Rochester, Rochester, N.Y., Aug. 15-17, 1977. Appeared as joint issue: SIGPLAN Notices (ACM) 12, 8 (Aug. 1977), and SIGART Newsl. 64 (Aug. 1977), 109-115.