Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Baldan, Paolo
Gadducci, Fabio
and
Montanari, Ugo
2006.
CONCUR 2006 – Concurrency Theory.
Vol. 4137,
Issue. ,
p.
279.
Ehrhard, Thomas
and
Laurent, Olivier
2007.
CONCUR 2007 – Concurrency Theory.
Vol. 4703,
Issue. ,
p.
333.
Lucchi, Roberto
and
Mazzara, Manuel
2007.
A pi-calculus based semantics for WS-BPEL.
The Journal of Logic and Algebraic Programming,
Vol. 70,
Issue. 1,
p.
96.
Paolini, Luca
and
Piccolo, Mauro
2008.
Semantically linear programming languages.
p.
97.
Paolini, Luca
and
Piccolo, Mauro
2009.
Types for Proofs and Programs.
Vol. 5497,
Issue. ,
p.
289.
Ehrhard, Thomas
and
Laurent, Olivier
2010.
Interpreting a finitary pi-calculus in differential interaction nets.
Information and Computation,
Vol. 208,
Issue. 6,
p.
606.
Hirschkoff, Daniel
Madiot, Jean-Marie
and
Sangiorgi, Davide
2013.
Name-Passing Calculi: From Fusions to Preorders and Types.
p.
378.
Dorman, Andrei
and
Mazza, Damiano
2013.
CONCUR 2013 – Concurrency Theory.
Vol. 8052,
Issue. ,
p.
197.
Mostrous, Dimitris
2014.
Multiparty Sessions based on Proof Nets.
Electronic Proceedings in Theoretical Computer Science,
Vol. 155,
Issue. ,
p.
1.
Hirschkoff, Daniel
Madiot, Jean-Marie
and
Sangiorgi, Davide
2014.
Computing with New Resources.
Vol. 8808,
Issue. ,
p.
307.
Beffara, Emmanuel
2014.
A proof-theoretic view on scheduling in concurrency.
Electronic Proceedings in Theoretical Computer Science,
Vol. 164,
Issue. ,
p.
78.
Hirschkoff, Daniel
Madiot, Jean-Marie
and
Xian, Xu
2015.
A behavioural theory for a π-calculus with preorders.
Journal of Logical and Algebraic Methods in Programming,
Vol. 84,
Issue. 6,
p.
806.
Mostrous, Dimitris
and
Yoshida, Nobuko
2015.
Session typing and asynchronous subtyping for the higher-order π-calculus.
Information and Computation,
Vol. 241,
Issue. ,
p.
227.
Hirschkoff, Daniel
Madiot, Jean-Marie
and
Xu, Xian
2015.
Fundamentals of Software Engineering.
Vol. 9392,
Issue. ,
p.
143.
Hirschkoff, Daniel
Madiot, Jean-Marie
and
Sangiorgi, Davide
2016.
Name-passing calculi: From fusions to preorders and types.
Information and Computation,
Vol. 251,
Issue. ,
p.
335.
Ong, C.-H. Luke
2017.
Quantitative semantics of the lambda calculus: Some generalisations of the relational model.
p.
1.
Silva, Miguel
Florido, Mário
and
Pfenning, Frank
2017.
Non-Blocking Concurrent Imperative Programming with Session Types.
Electronic Proceedings in Theoretical Computer Science,
Vol. 238,
Issue. ,
p.
64.
MAZZA, DAMIANO
2018.
The true concurrency of differential interaction nets.
Mathematical Structures in Computer Science,
Vol. 28,
Issue. 7,
p.
1097.
Aman, Bogdan
and
Ciobanu, Gabriel
2022.
Stochastic sharing calculus for reasoning about social networks.
Journal of Logic and Computation,
Vol. 32,
Issue. 6,
p.
1048.