Martín Abadi & Andrew D. Gordon (1997):
A Calculus for Cryptographic Protocols: The Spi Calculus.
In: CCS 1997.
ACM,
pp. 36–47,
doi:10.1145/266420.266432.
Richard Banach, J. Balázs & George A. Papadopoulos (1995):
A Translation of the Pi-Calculus Into MONSTR.
J.UCS 1(6),
pp. 339–398,
doi:10.3217/jucs-001-06-0339.
Gérard Boudol (1992):
Asynchrony and the Pi-calculus.
Technical Report Research Report RR-1702,inria-00076939.
INRIA, France.
Available at https://hal.inria.fr/inria-00076939.
Mauricio Cano, Jaime Arias & Jorge A. Pérez (2017):
Session-Based Concurrency, Reactively.
In: FORTE 2017,
LNCS 10321.
Springer,
pp. 74–91,
doi:10.1007/978-3-319-60225-7_6.
Avik Chaudhuri (2009):
A concurrent ML library in concurrent Haskell.
In: ICFP 2009.
ACM,
pp. 269–280,
doi:10.1145/1596550.1596589.
Koen Claessen & David Sands (1999):
Observable Sharing for Functional Circuit Description.
In: ASIAN 1999,
LNCS 1742.
Springer,
pp. 62–73,
doi:10.1007/3-540-46674-6_7.
Cédric Fournet & Georges Gonthier (2002):
The Join Calculus: A Language for Distributed Mobile Programming.
In: APPSEM 2000,
LNCS 2395.
Springer,
pp. 268–332,
doi:10.1007/3-540-45699-6_6.
Andy Gill (2009):
Type-safe observable sharing in Haskell.
In: Haskell 2009.
ACM,
pp. 117–128,
doi:10.1145/1596638.1596653.
Rob van Glabbeek, Ursula Goltz, Christopher Lippert & Stephan Mennicke (2019):
Stronger Validity Criteria for Encoding Synchrony.
In: The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday,
LNCS 11760.
Springer,
pp. 182–205,
doi:10.1007/978-3-030-31175-9_11.
Rob J. van Glabbeek (2018):
On the validity of encodings of the synchronous in the asynchronous π-calculus.
Inf. Process. Lett. 137,
pp. 17–25,
doi:10.1016/j.ipl.2018.04.015.
Daniele Gorla (2010):
Towards a unified approach to encodability and separation results for process calculi.
Inf. Comput. 208(9),
pp. 1031–1053,
doi:10.1016/j.ic.2010.05.002.
Kohei Honda & Mario Tokoro (1991):
An Object Calculus for Asynchronous Communication.
In: ECOOP 1991.
Springer-Verlag,
pp. 133–147,
doi:10.1007/BFb0057019.
Robin Milner (1999):
Communicating and mobile systems - the Pi-calculus.
Cambridge University Press.
Robin Milner, Joachim Parrow & David Walker (1992):
A Calculus of Mobile Processes, I & II.
Inform. and Comput. 100(1),
pp. 1–77,
doi:10.1016/0890-5401(92)90008-4.
Joachim Niehren, David Sabel, Manfred Schmidt-Schauß & Jan Schwinghammer (2007):
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.
Electron. Notes Theor. Comput. Sci. 173,
pp. 313–337,
doi:10.1016/j.entcs.2007.02.041.
Dominic A. Orchard & Nobuko Yoshida (2016):
Effects as sessions, sessions as effects.
In: POPL 2016.
ACM,
pp. 568–581,
doi:10.1145/2837614.2837634.
Catuscia Palamidessi (1997):
Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus.
In: POPL 1997.
ACM Press,
pp. 256–265,
doi:10.1145/263699.263731.
Catuscia Palamidessi (2003):
Comparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi.
Math. Structures Comput. Sci. 13(5),
pp. 685–719,
doi:10.1017/S0960129503004043.
Simon L. Peyton Jones, Andrew Gordon & Sigbjorn Finne (1996):
Concurrent Haskell.
In: POPL 1996.
ACM,
pp. 295–308,
doi:10.1145/237721.237794.
Corrado Priami (1995):
Stochastic pi-Calculus.
Comput. J. 38(7),
pp. 578–589,
doi:10.1093/comjnl/38.7.578.
George Russell (2001):
Events in Haskell, and How to Implement Them.
In: ICFP 2001.
ACM,
pp. 157–168,
doi:10.1145/507635.507655.
David Sabel & Manfred Schmidt-Schauß (2011):
A contextual semantics for Concurrent Haskell with futures.
In: PPDP 2011.
ACM,
pp. 101–112,
doi:10.1145/2003476.2003492.
David Sabel & Manfred Schmidt-Schauß (2012):
Conservative Concurrency in Haskell.
In: LICS 2012.
IEEE,
pp. 561–570,
doi:10.1109/LICS.2012.66.
David Sabel & Manfred Schmidt-Schauß (2015):
Observing Success in the Pi-Calculus.
In: WPTE 2015,
OASICS 46,
pp. 31–46,
doi:10.4230/OASIcs.WPTE.2015.31.
Davide Sangiorgi & David Walker (2001):
On Barbed Equivalences in pi-Calculus.
In: CONCUR 200,
LNCS 2154.
Springer,
pp. 292–304,
doi:10.1007/3-540-44685-0_20.
Davide Sangiorgi & David Walker (2001):
The π-calculus: a theory of mobile processes.
Cambridge university press.
Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer & David Sabel (2008):
Adequacy of Compositional Translations for Observational Semantics.
In: IFIP TCS 2008,
IFIP 273.
Springer,
pp. 521–535,
doi:10.1007/978-0-387-09680-3_35.
Manfred Schmidt-Schauß & David Sabel (2020):
Embedding the Pi-Calculus into a Concurrent Functional Programming Language.
Frank report 60.
Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main.
Available at http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank-60v5.pdf.
Manfred Schmidt-Schauß, David Sabel & Nils Dallmeyer (2018):
Sequential and Parallel Improvements in a Concurrent Functional Programming Language.
In: PPDP 2018.
ACM,
pp. 20:1–20:13,
doi:10.1145/3236950.3236952.
Manfred Schmidt-Schauß, David Sabel, Joachim Niehren & Jan Schwinghammer (2015):
Observational program calculi and the correctness of translations.
Theor. Comput. Sci. 577,
pp. 98–124,
doi:10.1016/j.tcs.2015.02.027.
Jan Schwinghammer, David Sabel, Manfred Schmidt-Schauß & Joachim Niehren (2009):
Correctly translating concurrency primitives.
In: ML 2009.
ACM,
pp. 27–38,
doi:10.1145/1596627.1596633.
Ping Yang, C. R. Ramakrishnan & Scott A. Smolka (2004):
A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution.
STTT 6(1),
pp. 38–66,
doi:10.1007/s10009-003-0136-3.
eptcs@eptcs.org