Abstract
We consider the problem of orienting equations into rewrite rules in the framework of a modular algebraic specification language. When a specification is built from “modules”, the orientation should neither be done globally for all modules, nor independently for each module. The termination ordering we define respects the modules boundaries. Equations of a module are partitioned into two sets: the ones that can be “statically” oriented, in a reusable way, and the ones with potential inter-modules conflicts which are handled in a “dynamic” phase.
Work partially supported by ESPRIT Basic Research Working Group 6112 COMPASS-II and the C.N.R.S. GDR-PRC “Programmation”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137–159, 1987.
M. Bidoit. Pluss, un langage pour le développement de spécifications algébriques modulaires. Thèse d'Etat, Université de Paris Sud, 1989.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.
N. Dershowitz. Hierarchical termination. In Workshop on C. T. R. S., pages 89–105, Jerusalem, Israel, 1994. LNCS 968, Springer Verlag.
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, chapter 6, pages 243–320. Elsevier, Amsterdam, 1990.
M. Fernandez. Modèles de calcul multi-paradigmes fondés sur la réécriture. Thèse de doctorat, Université de Paris Sud, 1993.
M. Fernandez and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In Recent Trend in Data Type Specification, 10th Workshop on Specification of Abstract Data Types, joint with the 5th Compass Workshop, pages 255–272, S. Margherita, Italy, 1995. LNCS 906, Springer Verlag.
S. Garland and J. V. Guttag. A Guide to LP, The Larch Prover. Technical Report 82, DEC-SRC, 1991.
J. V. Guttag and J. J. Horning. Larch: Languages and Tools for Formal Specification. Texts and Monographs in Computer Science. Springer-Verlag, 1993. ISBN 0-387-94006-5/ISBN 3-540-94006-5.
M.R.K. Krishna Rao. Simple termination of hierarchical combinations of term rewriting systems. In 11th Symposium on Theoretical Aspects of Computer Science, pages 203–223. LNCS 789, Springer Verlag, 1994.
R. Nakajima, M. Honda, and Nakahara, R., Hierarchical program specification and verification — a many-sorted logical approach. Acta Informatica, 14:135–155, 1980.
E. Ohlebusch. Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universität Bielefeld, Germany, 1994.
C. Roques. Modularité dans les spécifications algébriques: Théorie et Applications. Thèse de doctorat, Université de Paris Sud, 1994.
A. Rubio. Extension orderings. In Proc. of the 22th ICALP, Szeged, Hungary, 1995.
D.T. Sannella and R. M. Burstall. Structured theories in l.c.f. In C.A.A.P., pages 377–391, 1983.
Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Inf. Process. Lett., 25:141–143, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voisin, F., Bidoit, M. (1996). Modular algebraic specifications and the orientation of equations into rewrite rules. In: Haveraaen, M., Owe, O., Dahl, OJ. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1995 1995. Lecture Notes in Computer Science, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61629-2_60
Download citation
DOI: https://doi.org/10.1007/3-540-61629-2_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61629-0
Online ISBN: 978-3-540-70642-7
eBook Packages: Springer Book Archive