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

Abstract

We discuss the use of type systems in a non-strict sense when designing uni cation algorithms. We rst 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 a termination result for theory of partial exponentiation given earlier.