Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)
A logic for conditional term rewriting systems
KeywordsTuring Machine Function Symbol Order Logic Critical Pair Horn Clause
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.
Unable to display preview. Download preview PDF.
- Brand, D., Darringer, J., and Joyner, W., Completeness of conditional reductions, IBM Research Center, York-town Heights, 1978.Google Scholar
- Bergstra, J. and Klop, J., Conditional rewrite rules: confluency and termination, Department of Computer Science preprint, Mathematische Centrum, Amsterdam, 1982.Google Scholar
- Dershowitz, N. and Plaisted, D., Equational programming, 1987, to appear in Machine Intelligence 11.Google Scholar
- Kaplan, S., Conditional rewrite rules, Report No. 150, LRI-Orsay, France, 1983. Revised version in: Theoretical Computer Science 33 (1984).Google Scholar
- Kaplan, S., Fair conditional term rewriting systems: unification, termination, and confluence, Report No. 194, LRI-Orsay, France, 1984.Google Scholar
- Kapur, D. and Otto, F., On ground-confluence of term rewriting systems, 1987, unpublished.Google Scholar
- Knuth, D. and Bendix, P., Simple word problems in universal algebras, Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press, Oxford, 1970, pp. 263–297.Google Scholar
- O'Donnell, M., Computing in Systems Described by Equations, Lecture Notes in Computer Science 58, Springer-Verlag, 1977.Google Scholar
- Remy, J., Proving conditional identities by equational case reasoning, rewriting, and normalization, unpublished manuscript, C.R.I.N., Nancy, 1983.Google Scholar
- Zhang, H. and Remy, J., Contextual rewriting, Rewriting Techniques and Applications, J.-P. Jouannaud, ed. (Springer-Verlag, New York, 1985), pp. 46–62.Google Scholar
© Springer-Verlag Berlin Heidelberg 1988