Unification of quantified terms
Unification algorithms for quantified terms are needed for the implementation of extended functional and logic programming languages, and also for the implementation of other symbolic computation systems such as theorem provers and proof editors. This paper describes and proves correct such a unification algorithm. Although discussed here in a theoretically convenient way, the algorithm is suitable for enhancement of conventional unification algorithms for free variable terms, such as are found in, for example, Prolog interpreters. The algorithm has been demonstrated by modifying a conventional Prolog interpreter so as to interpret formulas which include previously declared quantifiers.
KeywordsInductive Hypothesis General Unifier Function Symbol Binding State Unification Algorithm
Unable to display preview. Download preview PDF.
- 1.dE BRUIJN, N.G., Lambda calculus notation with nameless dummies. Nederl. Akad. Wetensch. Series A 75 (1972) 381–392.Google Scholar
- 2.LLOYD, J.W. AND TOPOR, R., Making Prolog more expressive. Univ. Melb. Dept Comp. Sci. Tech. Report 84/8 (1984).Google Scholar
- 3.O'DONNELL, M.J., Equational logic as a programming language. M.I.T. Press, Cambridge, Mass., 1985.Google Scholar
- 4.STAPLES, JOHN, A new technique for analysing parameter passing, applied to the lambda calculus. Austral. Comp. Sci. Commun. 3 (1981) 201–210.Google Scholar