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.
CITATION STYLE
Zhenyu, Q. (1987). Structured contextual rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 256 LNCS, pp. 168–179). Springer Verlag. https://doi.org/10.1007/3-540-17220-3_15
Mendeley helps you to discover research relevant for your work.