Sort inheritance for order-sorted equational presentations [chapter]

Claus Hintermeier, Claude Kirchner, Hélène Kirchner
1995 Lecture Notes in Computer Science  
In an algebraic framework, where equational, membership and existence formulas can be expressed, decorated terms and rewriting provide operational semantics and decision procedures for these formulas. We focus in this work on testing sort inheritance, an undecidable property of speci cations, needed for uni cation in this context. A test and three speci c processes, based on completion of a set of rewrite rules, are proposed to check sort inheritance. They depend on the kinds of membership
more » ... las (t : A) allowed in the speci cations: at and linear, shallow and general terms t are studied.
doi:10.1007/bfb0014436 fatcat:3gatoaoiuzai7as2rvpzarelyq