Order-Sorted Completion: The Many-Sorted Way (Extended Abstract)

Order-sorted specifications can be transformed into equivalent many-sorted ones by using injections to implement subsort relations. In this paper we improve a result of Goguen/Jouannaud/Meseguer about the relation between order-sorted and many-sorted rewriting. We then apply recent techniques in 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.

[1]  Michaël Rusinowitch,et al.  On Word Problems in Equational Theories , 1987, ICALP.

[2]  Axel Poigné.  Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications , 1987, ADT.

[3]  Harald Ganzinger.  Completion with History-Dependent Complexities for Generated Equations , 1987, ADT.

[4]  Nachum Dershowitz,et al.  Confluence of Conditional Rewrite Systems , 1988, CTRS.

[5]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .

[6]  Stéphane Kaplan.  Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

[7]  Michaël Rusinowitch,et al.  On Word Problems in Horn Theories , 1988, J. Symb. Comput..

[8]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[9]  Claude Kirchner,et al.  Equational Completion in Order-Sorted Algebras (Extended Abstract) , 1988, CAAP.

[10]  Jean-Pierre Jouannaud,et al.  Operational Semantics for Order-Sorted Algebra , 1985, ICALP.

[11]  Hantao Zhang,et al.  Contextual Rewriting , 1985, RTA.

[12]  Jean-Pierre Jouannaud,et al.  Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

[13]  Bruno Buchberger,et al.  A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.

[14]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules , 1988, FGCS.

[15]  Harald Ganzinger.  A Completion Procedure for Conditional Equations , 1987, CTRS.

[16]  Stéphane Kaplan,et al.  A Compiler for Conditional Term Rewriting Systems , 1987, RTA.

[17]  José Meseguer,et al.  Operational Semantics of OBJ-3 (Extended Abstract) , 1988, ICALP.

[18]  Harald Ganzinger,et al.  A Completion Procedure for Conditional Equations , 1988, J. Symb. Comput..

[19]  Stéphane Kaplan,et al.  Completion Algorithms for Conditional Rewriting Systems , 1989 .

[20]  Harald Ganzinger,et al.  Completion-Time Optimization of Rewrite-Time Goal Solving , 1989, RTA.