The use of types in designing unification algorithms: two case studies
Keyword(s):
We discuss the use of type systems in a non-strict sensewhen designing unification algorithms. We first give anew (rule-based) algorithm for an equational theory which representsa property of El-Gamal signature schemes and show howa type system can be used to prove termination of the algorithm.Lastly, we reproduce termination result for theory of partialexponentiation given earlier.
Keyword(s):
1995 ◽
Vol 5
(1)
◽
pp. 1-35
◽
Keyword(s):
2017 ◽
Vol 33
(3)
◽
pp. 625-657
◽
Keyword(s):
2012 ◽
Vol 22
(2)
◽
pp. 153-180
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol 24
(1)
◽
pp. 56-112
◽
Keyword(s):