Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Abramsky, Samson
1996.
CONCUR '96: Concurrency Theory.
Vol. 1119,
Issue. ,
p.
1.
Katis, Piergiulio
Sabadini, N.
and
Walters, R. F. C.
1997.
Algebraic Methodology and Software Technology.
Vol. 1349,
Issue. ,
p.
322.
Gardner, Philippa
and
Hasegawa, Masahito
1997.
Theoretical Aspects of Computer Software.
Vol. 1281,
Issue. ,
p.
583.
Hasegawa, Masahito
1997.
Typed Lambda Calculi and Applications.
Vol. 1210,
Issue. ,
p.
196.
Grosu, R.
Stefanescu, G.
and
Broy, M.
1998.
Visual formalisms revisited.
p.
41.
Barber, Andrew
Gardner, Philippa
Hasegawa, Masahito
and
Plotkin, Gordon
1998.
Computer Science Logic.
Vol. 1414,
Issue. ,
p.
78.
Hildebrandt, Thomas
Panangaden, Prakash
and
Winskel, Glynn
1998.
CONCUR'98 Concurrency Theory.
Vol. 1466,
Issue. ,
p.
613.
Gadducci, F.
and
Heckel, R.
1998.
Recent Trends in Algebraic Development Techniques.
Vol. 1376,
Issue. ,
p.
223.
Nielsen, Mogens
and
Sassone, Vladimiro
1998.
Lectures on Petri Nets I: Basic Models.
Vol. 1491,
Issue. ,
p.
587.
Selinger, Peter
1999.
Categorical Structure of Asynchrony.
Electronic Notes in Theoretical Computer Science,
Vol. 20,
Issue. ,
p.
158.
Schweimeier, Ralf
and
Jeffrey, Alan
1999.
A Categorical and Graphical Treatment of Closure Conversion.
Electronic Notes in Theoretical Computer Science,
Vol. 20,
Issue. ,
p.
481.
Corradini, Andrea
and
Gadducci, Fabio
1999.
Rewriting on cyclic structures: Equivalence between the operational and the categorical description.
RAIRO - Theoretical Informatics and Applications,
Vol. 33,
Issue. 4-5,
p.
467.
Errington, Lindsay
1999.
On the Semantics of Message Passing Processes.
Electronic Notes in Theoretical Computer Science,
Vol. 29,
Issue. ,
p.
50.
Grosu, Radu
Broy, Manfred
Selic, Bran
and
Stefănescu, Gheorghe
1999.
Behavioral Specifications of Businesses and Systems.
p.
75.
Gardner, Philippa
2000.
CONCUR 2000 — Concurrency Theory.
Vol. 1877,
Issue. ,
p.
69.
Simpson, A.
and
Plotkin, G.
2000.
Complete axioms for categorical fixed-point operators.
p.
30.
Abramsky, Samson
and
Lenisa, Marina
2000.
Computer Science Logic.
Vol. 1862,
Issue. ,
p.
140.
Blute, R.F.
Cockett, J.R.B.
and
Seely, R.A.G.
2000.
Feedback for linearly distributive categories: traces and fixpoints.
Journal of Pure and Applied Algebra,
Vol. 154,
Issue. 1-3,
p.
27.
Gadducci, Fabio
and
Montanari, Ugo
2001.
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)..
Electronic Notes in Theoretical Computer Science,
Vol. 45,
Issue. ,
p.
88.
Paterson, Ross
2001.
A new notation for arrows.
ACM SIGPLAN Notices,
Vol. 36,
Issue. 10,
p.
229.