A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Sort inheritance for order-sorted equational presentations
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
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
doi:10.1007/bfb0014436
fatcat:3gatoaoiuzai7as2rvpzarelyq