We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen and Pietrzykowski. Our procedure removes many redundant unifiers by carefully restricting the search space and tightly integrating decision procedures for fragments that admit a finite complete set of unifiers. We identify a new such fragment and describe a procedure for computing its unifiers. Our unification procedure, together with new higher-order term indexing data structures, is implemented in the Zipperposition theorem prover. Experimental evaluation shows a clear advantage over Jensen and Pietrzykowski's procedure.

翻译：根据Jensen和Pietrzykowski的工作,我们制定了一套程序,以列出全套高单单化物。我们的程序通过仔细限制搜索空间和严格整合接受一定全单化物的碎片的决定程序,消除了许多多余的单化物。我们确定了一种新的这种碎片,并描述了计算其单化物的程序。我们的统一程序,加上新的高单术语索引化数据结构,在Zipperposition定理仪中实施。实验评估明显优于Jensen和Pietrzykowski的程序。