This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bachmair, N. Dershowitz and J. Hsiang, “Orderings for equational proofs.” Proceedings of the Symposium on Logic in Computer Science, Cambridge, MA, 346–357, June 1986.
Bergstra, J.A. and W. Klop, “Conditional rewrite rules: Confluence and termination”, Report IW 198/82 MEI, Mathematische Centrum, Amsterdam, 1982.
Dershowitz, N., “A note on simplification orderings,”, Inf. Proc. Lett. 9, 212–215, 1979.
Dershowitz, N. and Z. Manna, “Proving termination with multiset orderings,” Commun. ACM 22, 465–476, 1979.
Dershowitz, N. and M. Okada, “Proof theoretic techniques for conditional rewrite systems,” Proceedings of the Third Annual Symposium on Logic in Computer Science, Edinburgh, July 1988. To appear.
Dershowitz, N. and D.A. Plaisted, “Equational programming,” in Machine Intelligence,” 1987.
Dershowitz, N., M. Okada and G. Sivakumar, “Confluence of conditional term rewriting systems,” Proceedings of Workshop on Conditional Rewrite Systems, Orsay, France, July 1987.
Huet, G., “Confluent reductions: Abstract properties and applications to term rewriting systems,” J. Assoc. Comp. Mach. 27, 797–821, 1980. (Previous version in Proceedings of the Symposium on Foundations of Computer Science, Providence, RI, 30–45, (October 1977)).
Huet, G. and D.C. Oppen, “Equations and rewrite rules: A survey,” in Formal Language Theory: Perspectives and Open Problems, ed. R. Book, Academic Press, New York, 349–405, 1980.
Jouannaud, J.P. and B. Waldmann, “Reductive conditional term rewriting systems,” Proc. of the Third IFIP Working Conference on Formal Description of Programming Concept, 1986.
Kaplan, S. “Conditional rewrite rules,” Theoretical Computer Science 33, 175–193, 1984.
Kaplan, S., “Fair conditional term rewriting systems: Unification, termination and confluency,” Laboratoire de Recherche en Informatique, Université de Paris-Sud, Orsay, France, November 1984.
Knuth, D.E. and P.B. Bendix, “Simple word problems in universal algebras. In: (Leech, J., ed.) Computational Problems in Abstract Algebra, 263–297, Oxford: Pergamon Press, 1970.
Okada, M., “Ordering structures of term-rewriting theory and theory of proof theoretic ordinals,” Report 86 SF 20-1, Information Processing Society of Japan, 1–8, 1987.
Okada, M. “A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams,” Journal of Symbolic Logic 52, 577–581, 1987.
Okada, M. and G. Takeuti, “On the theory of quasi-ordinal diagrams,” in Logic and Combinatorics, ed. S. Simpson, Contemporary Mathematics 65, 295–308, 1987.
Okada, M., “Report on conditional rewrite systems,” (unpublished), Department of Computer Science, University of Illinois, Urbana, IL, May 1987.
Rémy, J.L. and H. Zhang, “Reveur 4: a system for validating conditional algebraic specifications of abstract data types,” Report 54506, Centre de Recherche en Informatique de Nancy, France, 1984.
Zhang, H. and J.L. Rémy, “Contextual rewriting,” Proceedings of First International Conference on Rewriting Techniques and Applications, Dijon, France (May 1985), Lecture Notes in Computer Science 202, Springer, Berlin, 46–62, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okada, M. (1988). A logical analysis on theory of conditional rewriting. 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_14
Download citation
DOI: https://doi.org/10.1007/3-540-19242-5_14
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