Abstract
In these notes we have described a method for eliminating equality tests from conditions in ctrs. Two applications have been shown: the first is the transformation of a conditional trs into an equivalent unconditional one; the second is the extension of the user syntax of K-LEAF, a logic+functional programming language.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, Journal of Computer and System Sciences 32 (1986), pp. 323–362.
P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi, A complete characterization of K-LEAF, a logic language with partial functions, Proc. 1987 Symp. on Logic Programming (IEEE Comp. Society Press, 1987).
N. Dershowitz and D.A. Plaisted, Equational programming, Report R-86-1265, University of Illinois, Urbana (1986).
S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giovannetti, E., Moiso, C. (1988). Notes on the elimination of conditions. In: Kaplan, S., Jouannaud, J.P. (eds) Conditional Term Rewriting Systems. CTRS 1987. Lecture Notes in Computer Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19242-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-19242-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19242-8
Online ISBN: 978-3-540-39166-1
eBook Packages: Springer Book Archive