Rational term rewriting

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

Volumn 1378, Issue , 1998, Pages 156-171

  Corradini, A ^a   Gadducci, F ^b  

^a UNIVERSITY OF PISA   (Italy)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC DESCRIPTION; RATIONAL TERMS; REWRITING LOGIC FORMALISM; REWRITING RULES; SUBTERMS; TERM REWRITING; TERM REWRITING SYSTEMS;

COMPUTATION THEORY;

EID: 84947945693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053548     Document Type: Conference Paper

References (27)

1. A. Arnold and M. Nivat. The metric space of infinite trees, algebraic and topological properties. Fundamenta Informaticae, 4:445-476, 1980.
2. S. Bloom. Varieties of ordered algebras. Journal of Computer and System Science, 13:200-210, 1976.
3. S. Bloom and Z. Esik. Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1993.
4. S. Bloom and Z. Esik. Solving polinomials fixed point equations. In Mathematical Foundations of Computer Science, volume 841 of LNCS, pages 52-67. Springer Verlag, 1994.
5. S.L. Bloom, Z. Esik, A. Labella, and E.G. Manes. Iteration 2-theories. In Proceedings AMAST’97, 1997. To appear.
6. G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, pages 170-235. Cambridge University Press, 1985.
7. A. Corradini. Term rewriting in CT. In Proceedings CAAP ’93, volume 668 of LNCS, pages 468-484. Springer Verlag, 1993.
8. A. Corradini and F. Drewes. (Cyclic) term graph rewriting is adequate for rational parallel term rewriting. Technical Report TR-97-14, Dipartimento di Informatica, Pisa, 1997.
9. A. Corradini and F. Gadducci. CPO Models for infinite term rewriting. In Algebraic Methodology and Software Technology, volume 936 of LNCS, pages 368-384. Springer Verlag, 1995.
10. A. Corradini and U. Montanari. An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci., 103:51-106, 1992.
11. N. Dershowitz and S. Kaplan. Rewrite, rewrite, rewrite, rewrite, rewrite. In Proc. POPL’89, Austin, pages 250-259, 1989.
12. N. Dershowitz, S. Kaplan, and D.A. Plaisted. Infinite normal forms (plus corrigendum). In Proc. ICALP’89, pages 249-262, 1989.
13. C. C. Elgot. Monadic computations and iterative algebraic theories. In Logic Colloquium 1973, volume 80 of Studies in Logic, pages 153-169. North Holland, 1975.
14. C.C. Elgot, C.C. Bloom, and R. Tindell. The algebraic structure of rooted trees. Journal of Computer and System Science, 16:362-339, 1978.
15. W.M. Farmer, J.D. Ramsdell, and R.J. Watro. A correctness proof for combinator reduction with cycles. ACM Trans. Program. Lang. Syst., 12:123-134, 1990.
16. W.M. Farmer and R.J. Watro. Redex capturing in term graph rewriting. In R.V. Book, editor, Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA ’91), volume 488 of LNCS, pages 13-24. Springer Verlag, 1991.
17. S Ginali. Regular trees and the free iterative theory. Journal of Computer and System Science, 18:222-242, 1979.
18. J.A. Goguen, J.W. Tatcher, E.G. Wagner, and J.R Wright. Some fundamentals of order-algebraic semantics. In Mathematical Foundations of Computer Science, volume 45 of LNCS, pages 153-168. Springer Verlag, 1976.
19. J.A. Goguen, J.W. Tatcher, E.G. Wagner, and J.R Wright. Initial algebra semantics and continuous algebras. Journal of the ACM, 24:68-95, 1977.
20. P. Inverardi and M. Venturini-Zilli. Rational rewriting. In Mathematical Foundations of Computer Science, volume 841 of LNCS, pages 433-442. Springer Verlag, 1994.
21. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. On the adequacy of graph rewriting for simulating term rewriting. ACM Trans. Program. Lang. Syst., 16:493-523, 1994.
22. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Tïansfinite reductions in orthogonal term rewriting system. Information and Computation, 119:18-38, 1995.
23. C. Laneve and U. Montanari. Axiomatizing permutation equivalence in the λ-calculus. Mathematical Structures in Computer Science, 6:219-249, 1996.
24. F.W. Lawvere. Functorial semantics of algebraic theories. Proc. National Academy of Science, 50:869-872, 1963.
25. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73-155, 1992.
26. A.J. Power. An abstract formulation for rewrite systems. In Proceedings Category Theory in Computer Science, volume 389 of LNCS, pages 300-312. Springer Verlag, 1989.
27. D.E. Rydehard and E.G. Stell. Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms. In Proceedings Category Theory in Computer Science, volume 283 of LNCS, pages 114-139. Springer Verlag, 1987.