[AH87]Gul Agha and Carl Hewitt. Actors: A conceptual foundation for concurrent object-oriented programming. In Research Directions in Object-Oriented Programming, pages 49–74. 1987.
[Cai04]Lu\’ıs Caires. Behavioral and spatial observations in a logic for the pi-calculus. In Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, 72–89. 2004. URL:, doi:10.1007/978-3-540-24727-2_7.
[FG00]Cédric Fournet and Georges Gonthier. The join calculus: A language for distributed mobile programming. In Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures, 268–332. 2000. URL:, doi:10.1007/3-540-45699-6_6.
[GZ97]David Gelernter and Lenore D. Zuck. On what linda is: formal description of linda as a reactive system. In Coordination Languages and Models, Second International Conference, COORDINATION ‘97, Berlin, Germany, September 1-3, 1997, Proceedings, 187–204. 1997. URL:, doi:10.1007/3-540-63383-9_81.
[HWT14]Jiansen He, Philip Wadler, and Philip W. Trinder. Typecasting actors: from akka to takka. In Proceedings of the Fifth Annual Scala Workshop, SCALA@ECOOP 2014, Uppsala, Sweden, July 28-29, 2014, 23–33. 2014. URL:, doi:10.1145/2637647.2637651.
[KSFS05]Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, and Amr Sabry. Backtracking, interleaving, and terminating monad transformers: (functional pearl). In Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005, 192–203. 2005. URL:, doi:10.1145/1086365.1086390.
[MB03]Greg Meredith and Steve Bjorg. Contracts and types. Commun. ACM, 46(10):41–47, 2003. URL:, doi:10.1145/944217.944236.
[MR05a]L. Gregory Meredith and Matthias Radestock. A reflective higher-order calculus. Electr. Notes Theor. Comput. Sci., 141(5):49–67, 2005. URL:, doi:10.1016/j.entcs.2005.05.016.
[MR05b]L. Gregory Meredith and Matthias Radestock. Namespace logic: A logic for a reflective higher-order calculus. In Trustworthy Global Computing, International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005, Revised Selected Papers, 353–369. 2005. URL:, doi:10.1007/11580850_19.
[Mer15]Lucius Gregory Meredith. Linear types can change the blockchain. CoRR, 2015. URL:
[MSD13]Lucius Gregory Meredith, Mike Stay, and Sophia Drossopoulou. Policy as types. CoRR, 2013. URL:
[Mil92]Robin Milner. The polyadic pi-calculus (abstract). In CONCUR ‘92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992, Proceedings, 1. 1992. URL:, doi:10.1007/BFb0084778.
[SMTA95]Munindar P. Singh, Greg Meredith, Christine Tomlinson, and Paul C. Attie. An event algebra for specifying and scheduling workflows. In Database Systems for Advanced Applications ‘95, Proceedings of the 4th International Conference on Database Systems for Advanced Applications (DASFAA), Singapore, April 11-13, 1995, 53–60. 1995.
[SM15]Mike Stay and Lucius Gregory Meredith. Higher category models of the pi-calculus. CoRR, 2015. URL:
[SM16]Mike Stay and Lucius Gregory Meredith. Logic as a distributive law. CoRR, 2016. URL:
[TKS+89]Chris Tomlinson, Won Kim, Mark Scheevel, Vineet Singh, B. Will, and Gul Agha. Rosette: an object-oriented concurrent systems architecture. SIGPLAN Notices, 24(4):91–93, 1989. URL:, doi:10.1145/67387.67410.
[TCMW93]Christine Tomlinson, Philip Cannata, Greg Meredith, and Darrell Woelk. The extensible services switch in carnot. IEEE P&DT, 1(2):16–20, 1993. URL:, doi:10.1109/88.218171.
[WAC+93]Darrell Woelk, Paul C. Attie, Philip Cannata, Greg Meredith, Amit P. Sheth, Munindar P. Singh, and Christine Tomlinson. Task scheduling using intertask dependencies in carot. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993., 491–494. 1993. URL:, doi:10.1145/170035.170150.