EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO-Theor. Inf. Appl., 33 4-5 (1999) 467-493 Article references

Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness

Tobias Fritz, Fabio Gadducci, Davide Trotta and Andrea Corradini
Applied Categorical Structures 31 (5) (2023)
https://doi.org/10.1007/s10485-023-09750-z

Semantics-Preserving DPO-Based Term Graph Rewriting

Wolfram Kahl and Yuhang Zhao
Electronic Proceedings in Theoretical Computer Science 288 26 (2019)
https://doi.org/10.4204/EPTCS.288.3

Recent Trends in Algebraic Development Techniques

Paolo Baldan and Clara Bertolissi
Lecture Notes in Computer Science, Recent Trends in Algebraic Development Techniques 7137 27 (2012)
https://doi.org/10.1007/978-3-642-28412-0_4

Term Graph Rewriting and Parallel Term Rewriting

Andrea Corradini and Frank Drewes
Electronic Proceedings in Theoretical Computer Science 48 3 (2011)
https://doi.org/10.4204/EPTCS.48.3

AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System

Cezara Dragoi and Gheorghe Stefanescu
Electronic Notes in Theoretical Computer Science 203 (3) 69 (2008)
https://doi.org/10.1016/j.entcs.2008.04.087

Towards a Sharing Strategy for the Graph Rewriting Calculus

P. Baldan, C. Bertolissi, H. Cirstea and C. Kirchner
Electronic Notes in Theoretical Computer Science 204 111 (2008)
https://doi.org/10.1016/j.entcs.2008.03.057

A rewriting calculus for cyclic higher-order term graphs

PAOLO BALDAN, CLARA BERTOLISSI, HORATIU CIRSTEA and CLAUDE KIRCHNER
Mathematical Structures in Computer Science 17 (3) 363 (2007)
https://doi.org/10.1017/S0960129507006093

Formal Methods in Software and Systems Modeling

Fabio Gadducci and Ugo Montanari
Lecture Notes in Computer Science, Formal Methods in Software and Systems Modeling 3393 84 (2005)
https://doi.org/10.1007/978-3-540-31847-7_5

A Rewriting Calculus for Cyclic Higher-order Term Graphs

C. Bertolissi, P. Baldan, H. Cirstea and C. Kirchner
Electronic Notes in Theoretical Computer Science 127 (5) 21 (2005)
https://doi.org/10.1016/j.entcs.2005.01.034

CONCUR 2005 – Concurrency Theory

Roberto Bruni, Fabio Gadducci, Ugo Montanari and Paweł Sobociński
Lecture Notes in Computer Science, CONCUR 2005 – Concurrency Theory 3653 293 (2005)
https://doi.org/10.1007/11539452_24

Some algebraic laws for spans (and their connections with multirelations)1 1Research partly supported by the EC TMR Network getgrats and by the Italian MURST Project tosca.

Roberto Bruni and Fabio Gadducci
Electronic Notes in Theoretical Computer Science 44 (3) 175 (2003)
https://doi.org/10.1016/S1571-0661(04)80937-X

A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).

Fabio Gadducci and Ugo Montanari
Electronic Notes in Theoretical Computer Science 45 88 (2001)
https://doi.org/10.1016/S1571-0661(04)80957-5