Efficient Full Higher-Order Unification

Efficient Full Higher-Order Unification

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 o...

Full description

Bibliographic Details
Main Authors: Petar Vukmirović, Alexander Bentkamp, Visa Nummelin
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2021-12-01
Series:Logical Methods in Computer Science
Subjects:
computer science - logic in computer science
Online Access:https://lmcs.episciences.org/6919/pdf

Similar Items

Similar Items