Rewriting on cyclic structures: Equivalence between the operational and the categorical description-Reference-Cited by-同舟云学术

Rewriting on cyclic structures: Equivalence between the operational and the categorical description

Published:1999-07 Issue:4-5 Volume:33 Page:467-493
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Corradini Andrea,Gadducci Fabio

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita:1999128/pdf

Reference59 articles.

1. EQUATIONAL TERM GRAPH REWRITING

2. Z.M. Ariola, J.W. Klop and D. Plump, Confluent rewriting of bisimilar term graphs, C. Palamidessi and J. Parrow, Eds.,Expressiveness in Concurrency. Elsevier Sciences,Electron. Notes Theoret. Comput. Sci.7(1997). Available at http://www.elsevier.nl/locate/entcs/volume7.html/.

3. Term graph rewriting

4. Semantics of flowchart programs and the free Conway theories

5. Minimal and Optimal Computations of Recursive Programs

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness;Applied Categorical Structures;2023-09-28

2. Semantics-Preserving DPO-Based Term Graph Rewriting;Electronic Proceedings in Theoretical Computer Science;2019-02-06

3. Sharing in the Graph Rewriting Calculus;Recent Trends in Algebraic Development Techniques;2012

4. Term Graph Rewriting and Parallel Term Rewriting;Electronic Proceedings in Theoretical Computer Science;2011-02-11

5. A Note on an Old-Fashioned Algebra for (Disconnected) Graphs;Electronic Notes in Theoretical Computer Science;2009-11