Abstract
Unlike in the unsorted case the application of an order-sorted rewrite rule to a term t may be prohibited although the left hand side of the rule matches with a subterm of t, since the resulting term would be ill-formed. A rewrite rule is called compatible, if it may be applied to a term, whenever its left hand side matches with a subterm. We show that compatibility in finite signatures is decidable.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In W. Brauer, editor, 12th International Colloquium on Automata, Languages and Programming. Proceedings. Nafplion, Greece, LNCS 194, pages 221–231. Springer-Verlag, 1985.
J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Draft, Programming Research Group, University of Oxford and SRI International, 1989.
M. Gogolla. Über partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen. Dissertation, Universität Braunschweig, Naturwissenschaftliche Fakultät, 1986.
G. Huet and D. C. Oppen. Equations and rewrite rules: A survey. In R. Book, editor, Formal Languages: Perspectives and Open Problems, pages 349–405. Academic Press, 1980.
G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-sorted equational computation. SEKI-Report SR-87-14, Universität Kaiserslautern, Fachbereich Informatik, 1987. Revised version in H. Aït-Kaci and M. NIvat, editors, Resolution of Equations in Algebraic Structures, volume 2, pages 297–367. Academic Press, 1989.
M. Schmidt-Schauß. Computational Aspects of an Order-Sorted Logic with Term Declarations. Dissertation, Universität Kaiserslautern, Fachbereich Informatik, 1988.
U. Waldmann. Semantics of order-sorted specifications. Forschungsbericht 297, Universität Dortmund, Fachbereich Informatik, 1989.
U. Waldmann. Complexities of order-sorted computations. In preparation, Universität Dortmund, Fachbereich Informatik, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waldmann, U. (1991). Compatibility of order-sorted rewrite rules. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_109
Download citation
DOI: https://doi.org/10.1007/3-540-54317-1_109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54317-6
Online ISBN: 978-3-540-47558-3
eBook Packages: Springer Book Archive