Bounded Higher-order Unification using Regular Terms

22 pages•Published: July 28, 2014

Abstract

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 terms
can 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 bounded
unification algorithms.

Keyphrases: bounded unification, bounded unification algorithms, exponent of periodicity, higher order unification, regular terms

In: Santiago Escobar, Konstantin Korovin and Vladimir Rybakov (editors). UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, vol 24, pages 28-49.

Links:	https://easychair.org/publications/paper/B6J
	https://doi.org/10.29007/zhpc

BibTeX entry

@inproceedings{UNIF2012:Bounded_Higher_order_Unification,
  author    = {Tomer Libal},
  title     = {Bounded Higher-order Unification using Regular Terms},
  booktitle = {UNIF 2012 Post-Worskhop Proceedings. The 26th International  Workshop on Unification},
  editor    = {Santiago Escobar and Konstantin Korovin and Vladimir Rybakov},
  series    = {EPiC Series in Computing},
  volume    = {24},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/B6J},
  doi       = {10.29007/zhpc},
  pages     = {28-49},
  year      = {2014}}

Download PDF Open PDF in browser