The use of types in designing unification algorithms: two case studies

10 pages•Published: July 28, 2014

Serdar Erbatur, Santiago Escobar and Paliath Narendran

Abstract

We discuss the use of type systems in a non-strict sense
when designing unification algorithms. We first give a
new (rule-based) algorithm for an equational theory which represents
a property of El-Gamal signature schemes and show how
a type system can be used to prove termination of the algorithm.
Lastly, we reproduce termination result for theory of partial
exponentiation given earlier.

Keyphrases: el gamal signature scheme, equational unification, type systems

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

Links:	https://easychair.org/publications/paper/Mqw
	https://doi.org/10.29007/lbk5

BibTeX entry

@inproceedings{UNIF2012:use_types_designing_unification,
  author    = {Serdar Erbatur and Santiago Escobar and Paliath Narendran},
  title     = {The use of types in designing unification algorithms: two case studies},
  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/Mqw},
  doi       = {10.29007/lbk5},
  pages     = {7-16},
  year      = {2014}}

Download PDF Open PDF in browser