Bounded Higher-order Unification using Regular Terms
Keyword(s):
We present an algorithm for the bounded unification of higher-order terms.The algorithm extends G. P. Huet's pre-unification algorithm with rules for the generation and folding of regular terms.The concise form of the algorithm allows the reuse of the pre-unification correctness proof. Furthermore, the regular termscan be restricted in order to decide the unifiability problem.Finally, the algorithm avoids re-computation of terms in a non-deterministic search which leads to a better performance in practice when compared to other boundedunification algorithms.
2021 ◽
Vol 222-223
◽
pp. 111003
2013 ◽
Vol 586
◽
pp. 237-240
◽
1990 ◽
Vol 235
(1-2)
◽
pp. 141-146
◽
2008 ◽
Vol 77
(7)
◽
pp. 074401
◽
Keyword(s):
2006 ◽
Vol 23
(10)
◽
pp. 2774-2777
◽
Keyword(s):
2012 ◽
Vol 249-250
◽
pp. 76-81
◽
Keyword(s):