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.
[1] Michael J. O'Donnell,et al. Equational Logic as a Programming Language , 1985, Logic of Programs.
[2] J. W. LLOYD,et al. Making Prolog more Expressive , 1984, J. Log. Program..
[3] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .