Name
Abstract | ||
|---|---|---|
Order-sorted specifications can be transformed into equivalent many-sorted ones by using injections to implement subsort relations. In this paper we improve previous results about the relation between order-sorted and many-sorted rewriting. We then apply techniques for the completion of many-sorted conditional equations to systems obtained from translating order-sorted conditional equations. Emphasis will be on ways to overcome some of the problems with non-sort-decreasing rules. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0304-3975(90)90105-Q | Theoretical Computer Science |
Keywords | DocType | Volume |
order-sorted completion | Journal | 89 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 25 |
PageRank | References | Authors |
1.67 | 15 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harald Ganzinger | 1 | 1513 | 155.21 |