Generator induction in order sorted algebras
Olaf Owe, Ole-Johan Dahl · Formal Aspects of Computing · 1991
Abstract Linguistic and semantic consequences of combining the ideas of order sorted algebras (as in OBJ) and generator induction (as in Larch) are investigated. It is found that one can gain the advantages of both, in addition to increased flexibility in defining signatures and generator bases. Our treatment also gives rise to typing control stronger in a certain sense than that of OBJ, as well as the detection of inherently inconsistent signatures.