Structured Contextual Rewriting

In this paper, we develop a mechanism, which we call structured contextual system, (SCS for short,) to deal with some non-finitely-based algebraic specifications. The sufficient condition for confluence and termination of this kind of systems is also considered, based on a generalization of the approach by O'Donell.

[1]  Michael J. O'Donnell,et al.  Computing in systems described by equations , 1977, Lecture Notes in Computer Science.

[2]  Nachum Dershowitz,et al.  Existence, Uniqueness, and Construction of Rewrite Systems , 1988, SIAM J. Comput..

[3]  Ronald V. Book,et al.  Formal language theory : perspectives and open problems , 1980 .

[4]  Friedrich L. Bauer,et al.  The Munich Project CIP , 1988, Lecture Notes in Computer Science.

[5]  Michael J. O'Donnell,et al.  Equational Logic as a Programming Language , 1985, Logic of Programs.

[6]  Joseph A. Goguen,et al.  The Semantics of CLEAR, A Specification Language , 1979, Abstract Software Specifications.

[7]  Hans-Jörg Kreowski.  Partial Algebras Flow From Algebraic Specifications , 1987, ICALP.

[8]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[9]  Friedrich L. Bauer,et al.  The Munich Project CIP: Volume I: The Wide Spectrum Language CIP-L , 1985 .

[10]  W. Taylor.  Equational logic , 1979 .

[11]  Friedrich L. Bauer,et al.  Algorithmic Language and Program Development , 1982, Texts and Monographs in Computer Science.

[12]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[13]  Nachum Dershowitz,et al.  Computing with Rewrite Systems , 1985, Inf. Control..