Confluence of conditional rewrite systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 308 LNCS, Issue , 1988, Pages 31-44

  Dershowitz, Nachum ^a   Okada, Mitsuhiro ^b   Sivakumar, G ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL MECHANICS; FORMAL LOGIC;

ALGEBRAIC DATA-TYPES; COMPUTATIONAL PARADIGM; CONDITIONAL REWRITE SYSTEMS; CONDITIONAL REWRITING; JOINABILITY; REWRITE SYSTEMS;

FUNCTIONAL PROGRAMMING;

EID: 85034823126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-19242-5_3     Document Type: Conference Paper

References (9)

1. Bergstra, J. A., and Klop, J. W. “Conditional rewrite rules: Confluency and termination”, JCSS 32, pp. 323-362, 1986.
2. Dershowitz, N., Okada, M., and Sivakumar, G. “Canonical conditional rewrite systems”, submitted.
3. Dershowitz, N., and Plaisted, D. A. “Equational programming”. In Machine Intelligence 11: The logic and acquisition of knowledge (J. E. Hayes, D. Michie, and J. Richards, eds.), Clarendon Press, London, 1987.
4. Fribourg, L. “Slog: A logic programming language interpreter based on clausal superposition and rewriting”. Proceedings of the 1985 Symposium on Logic Programming, Boston, MA (July 1985), pp. 172-184.
5. Goguen, J. A., and Meseguer, J. “Eqlog: Equality, types and generic modules for logic programming”. In Logic Programming: Functions, relations and equations (D. DeGroot and G. Lindstrom, eds.), Prentice-Hall, Englewood Cliffs, NJ, pp. 295-363, 1986.
6. Huet, G. “Confluent reductions: Abstract properties and applications to term rewriting systems”, J. ACM 27, pp. 797-821.
7. Jouannaud, J.-P., and Waldmann, B. “Reductive conditional term rewriting systems”. Proceedings of the Third IFIP Working Conference on Formal Description of Programming Concepts, Ebberup, Denmark.
8. Kaplan, S. “Simplifying conditional term rewriting systems: Unification, termination and confluence”, Journal of Symbolic Computation, to appear.
9. Zhang, H., and Rémy, J. L. “Contextual rewriting”. Proceedings First International Conference on Rewriting Techniques and Applications, Dijon, France (May 1985), pp. 46-62 (available as Vol. 202, Lecture Notes in Computer Science, Springer, Berlin [September 1985]).