论文信息 - Order-Sorted Termination: The Unsorted Way

Order-Sorted Termination: The Unsorted Way

We consider the problem of proving termination of order-sorted rewrite systems. The dominating method for proving termination of order-sorted systems has been to simply ignore sort information, and use the techniques developed for unsorted rewriting. The problem with this approach is that many order-sorted rewrite systems terminate because of the structure of the set of sorts. In these cases the corresponding unsorted system would not terminate.

Peter Csaba Ölveczky | Olav Lysne | P. C. Ölveczky | Olav Lysne

[1] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .

[2] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[3] Isabelle Gnaedig,et al. Termination of Order-sorted Rewriting , 1992, ALP.

[4] Isabelle Gnaedig,et al. ELIOS-OBJ Theorem Proving in a Specification Language , 1992, ESOP.

[5] Hans Zantema,et al. Termination of Term Rewriting by Semantic Labelling , 1995, Fundam. Informaticae.

[6] Claude Kirchner,et al. Equational Completion in Order-Sorted Algebras , 1990, Theor. Comput. Sci..

[7] N. A C H U M D E R S H O W I T Z. Termination of Rewriting' , 2022 .

[8] Olaf Owe,et al. Formal Development with ABEL , 1991, VDM Europe.

[9] José Meseguer,et al. Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[10] Harald Ganzinger,et al. Order-Sorted Completion: The Many-Sorted Way , 1991, Theor. Comput. Sci..

[11] Nachum Dershowitz,et al. Natural Termination , 1995, Theor. Comput. Sci..

[12] Uwe Waldmann,et al. Semantics of Order-Sorted Specifications , 1992, Theor. Comput. Sci..