@inproceedings{d4d714ecca24450d86174cc23ada6612,
title = "Efficient Full Higher-Order Unification",
abstract = "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 is implemented in the Zipperposition theorem prover. Experimental evaluation shows a clear advantage over Jensen and Pietrzykowski{\textquoteright}s procedure.",
author = "Petar Vukmirovic and Alexander Bentkamp and Visa Nummelin",
year = "2020",
doi = "10.4230/LIPIcs.FSCD.2020.5",
language = "English",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "1--17",
editor = "Ariola, \{Zena M.\}",
booktitle = "5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)",
}
