Abr93

Samson Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, v.111 n.1-2, p.3-57, April 12, 1993  [doi>10.1016/0304-3975(93)90181-R]

Agh86

Gul Agha, Actors: a model of concurrent computation in distributed systems, MIT Press, Cambridge, MA, 1986

AGN94

Samson Abramsky , Simon Gay , Rajagopal Nagarajan, Interaction categories and the foundations of typed concurrent programming, Proceedings of the NATO Advanced Study Institute on Deductive program design, p.35-113, July 26-August 07, 1994, Marktoberdorf, Germany

Bak92

Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992  [doi>10.1145/142137.142162]

Car86

L Cardelli, Amber, Proc. of the thirteenth spring school of the LITP on Combinators and functional programming languages, p.21-47, October 1986, Val d'Ajol, France

FG96

Cédric Fournet , Georges Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.372-385, January 21-24, 1996, St. Petersburg Beach, Florida, United States  [doi>10.1145/237721.237805]

Gay93

Simon J. Gay, A sort inference algorithm for the polyadic &pgr;-calculus, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.429-438, March 1993, Charleston, South Carolina, United States  [doi>10.1145/158511.158701]

Gir87

Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987  [doi>10.1016/0304-3975(87)90045-4]

GLT89

Jean-Yves Girard , Paul Taylor , Yves Lafont, Proofs and types, Cambridge University Press, New York, NY, 1989

GMP89

Alessandro Giacalone , Prateek Mishra , Sanjiva Prasad, Facile: a symmetric integration of concurrent and functional programming, International Journal of Parallel Programming, v.18 n.2, p.121-160, Apr. 1990  [doi>10.1007/BF01491213]

GN95

Simon Gay , Rajagopal Nagarajan, A Typed Calculus of Synchronous Processes, Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, p.210, June 26-29, 1995

Hew77

C. Hewitt. Viewing control structures as patterns of passing messages. Artificial Intelligence, 8:323-364, 1977.

Hod92

J. S. Hodas. Lolli: An extension of ~Prolog with linear context management. In D. Miller, editor, Workshop on the AProlog Programming Language, pages 159-168, Philadelphia, Pennsylvania, August 1992.

Hon93

Kohei Honda, Types for Dynamic Interaction, Proceedings of the 4th International Conference on Concurrency Theory, p.509-523, August 23-26, 1993

HT91

Kohei Honda , Mario Tokoro, An Object Calculus for Asynchronous Communication, Proceedings of the European Conference on Object-Oriented Programming, p.133-147, July 15-19, 1991

Jon93

Cliff B. Jones, A pi-Calculus Semantics for an Object-Based Design Notation, Proceedings of the 4th International Conference on Concurrency Theory, p.158-172, August 23-26, 1993

KNY95

Naoki Kobayashi , Motoki Nakade , Akinori Yonezawa, Static Analysis of Communication for Asynchronous Concurrent Programming Languages, Proceedings of the Second International Symposium on Static Analysis, p.225-242, September 25-27, 1995

KPT95

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus, 1995. Technical report, Department of Information Science, University of Tokyo and Computer Laboratory, University of Cambridge.

KY94

Naoki Kobayashi , Akinori Yonezawa, Type-theoretic foundations for concurrent object-oriented programing, Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications, p.31-45, October 23-28, 1994, Portland, Oregon, United States

KY95

Naoki Kobayashi , Akinori Yonezawa, Toward foundations of concurrent object-oriented programming-types and language design, Theory and Practice of Object Systems, v.1 n.4, p.243-268, 1995

LW95a

Xinxin Liu , David Walker, Confluence of Processes and Systems of Objects, Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.217-231, May 22-26, 1995

LW95b

Xinxin Liu , David Walker, A Polymorphic Type System for the Polyadic pi-calculus, Proceedings of the 6th International Conference on Concurrency Theory, p.103-116, August 21-24, 1995

Mac94

Inn Mackie. Lilac: A lunch.tonal programming language based on linear logic. Journal of Functwnal Programmz#9, 4(4):395-433, October 1994.

Mil90

Robin Milner. Functions as processes. Research Report 1154, INRIA, Sofia Antipolis, 1990. Final version in Journal of Mathematical Structures #n Computer Science 2(2):119-141, 1992.

Mil91

Robin Milner. The polyadic u-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Proceedzngs of the International Summer School on Logic and Algebra of Specification, Marktoberdorf, August 1991. Reprinted in Logzc and Algebra of Specification, ed. F. L. Bauer, W. Brauer, and H. Schwichtenberg, Springer-Verlag, 1993.

MPW92

Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, I, Information and Computation, v.100 n.1, p.1-40, Sept. 1992  [doi>10.1016/0890-5401(92)90008-4]

MS92

Robin Milner , Davide Sangiorgi, Barbed Bisimulation, Proceedings of the 19th International Colloquium on Automata, Languages and Programming, p.685-695, July 13-17, 1992

Nie96

Joachim Niehren, Functional computation as concurrent computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-343, January 21-24, 1996, St. Petersburg Beach, Florida, United States  [doi>10.1145/237721.237801]

NN94

Hanne Riis Nielson , Flemming Nielson, Higher-order concurrent programs with finite communication topology (extended abstract), Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.84-97, January 16-19, 1994, Portland, Oregon, United States  [doi>10.1145/174675.174538]

NN95

Hanne Riis Nielson , Flemming Nielson, Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages, Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.590-604, May 22-26, 1995

Ode95

Martin Odersky, Polarized Name Passing, Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, p.324-337, December 18-20, 1995

OTPT95

P. W. O'Hearn, M. Takayama, A. a. Power, and R. D. Tennent. Syntactic control of interference revisited. In MFPS XI. conference o# Mathematical Foundations of Program Semantzcs. volume 1 of Electromc Notes in Theoretzcal Computer Sczence. Elsevier. March 1995.

PS93

Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Logac an Computer Scacnce, 1993. Full version to appear in Mathematical Structures in Computer Sczence.

PT95a

Benjamin C. Pierce, Concurrent Objects in a Process Calculus, Proceedings of the International Workshop on Theory and Practice of Parallel Programming, p.187-215, November 07-09, 1994

PT95b

Benjamin C. Pierce and David N. Turner. Pier: A programming language based on the picalculus. To appear, 1995.

Rep91

John H. Reppy, CML: A higher concurrent language, Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, p.293-305, June 24-28, 1991, Toronto, Ontario, Canada

San92

Davide Sangiorgi. Expressing Mobility #n Process Algebras: First-Order and Higher.Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, 1992.

San93

Davide Sangiorgi, An Investigation into Functions as Processes, Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics, p.143-159, April 07-10, 1993

SN95

Martin Steffen and Uwe Nestmann. Typing confluence. Interner Bericht IMMDT-xx/95, informatik VII, Universit#t Erlangen-N{irnberg, 1995.

THK94

Kaku Takeuchi , Kohei Honda , Makoto Kubo, An Interaction-based Language and its Typing System, Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe, p.398-413, July 04-08, 1994

Tur95

David N. Turner. The #r-calulus: Types, polymorphism and implementation, 1995. Forthcoming Ph.D. thesis, LFCS, University of Edinburgh.

TWM95

David N. Turner , Philip Wadler , Christian Mossin, Once upon a type, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.1-11, June 26-28, 1995, La Jolla, California, United States  [doi>10.1145/224164.224168]

Vas94

Vasco Thudichum Vasconcelos, Typed Concurrent Objects, Proceedings of the 8th European Conference on Object-Oriented Programming, p.100-117, July 04-08, 1994

VH93

Vasco Thudichum Vasconcelos , Kohei Honda, Principal Typing Schemes in a Polyadic pi-Calculus, Proceedings of the 4th International Conference on Concurrency Theory, p.524-538, August 23-26, 1993

Wad91

Philip Wadler, Is there a use for linear logic?, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.255-273, June 17-19, 1991, New Haven, Connecticut, United States

Wal95

David Walker, Objects in the &pgr;-calculus, Information and Computation, v.116 n.2, p.253-271, Feb. 1, 1995  [doi>10.1006/inco.1995.1018]

Benjamin C. Pierce , Davide Sangiorgi, Behavioral equivalence in the polymorphic pi-calculus, Journal of the ACM (JACM), v.47 n.3, p.531-584, May 2000

Francesca Levi , Davide Sangiorgi, Controlling interference in ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.352-364, January 19-21, 2000, Boston, MA, USA

Joachim Niehren, Functional computation as concurrent computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-343, January 21-24, 1996, St. Petersburg Beach, Florida, United States

Asis Unyapoth , Peter Sewell, Nomadic pict: correct communication infrastructure for mobile computation, ACM SIGPLAN Notices, v.36 n.3, p.116-127, March 2001

Matthew Hennessy , James Riely, Resource access control in systems of mobile agents, Information and Computation, v.173 n.1, p.82-120, February 25, 2002

Franz Puntigam , Christof Peter, Changeable interfaces and promised messages for concurrent components, Proceedings of the 1999 ACM symposium on Applied computing, p.141-145, February 28-March 02, 1999, San Antonio, Texas, United States

Cédric Fournet , Georges Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.372-385, January 21-24, 1996, St. Petersburg Beach, Florida, United States

Kenjiro Taura , Akinori Yonezawa, An effective garbage collection strategy for parallel programming languages on large scale distributed-memory machines, ACM SIGPLAN Notices, v.32 n.7, p.264-275, July 1997

Martín Abadi, Secrecy by typing in security protocols, Journal of the ACM (JACM), v.46 n.5, p.749-786, Sept. 1999

Kohei Honda , Nobuko Yoshida, A uniform type structure for secure information flow, ACM SIGPLAN Notices, v.37 n.1, p.81-92, Jan. 2002

Nobuko Yoshida , Matthew Hennessy, Assigning types to processes, Information and Computation, v.174 n.2, p.143-179, May 1 2002

Naoki Kobayashi, Quasi-linear types, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.29-42, January 20-22, 1999, San Antonio, Texas, United States

Luca Cardelli , Andrew D. Gordon, Types for mobile ambients, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.79-92, January 20-22, 1999, San Antonio, Texas, United States

Benjamin C. Pierce , Davide Sangiorgi, Behavioral equivalence in the polymorphic pi-calculus, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.242-255, January 15-17, 1997, Paris, France

Josva Kleist , Davide Sangiorgi, Imperative objects as mobile processes, Science of Computer Programming, v.44 n.3, p.293-342, September 2002

Silvano Dal Zilio, Mobile processes: a commented bibliography, Modeling and verification of parallel processes, Springer-Verlag New York, Inc., New York, NY, 2001

Denis Caromel , Ludovic Henrio , Bernard Paul Serpette, Asynchronous and deterministic objects, ACM SIGPLAN Notices, v.39 n.1, p.123-134, January 2004

Francesca Levi , Davide Sangiorgi, Mobile safe ambients, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.1, p.1-69, January 2003

Naoki Kobayashi, A partially deadlock-free typed process calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.2, p.436-482, March 1998

Roberto M. Amadio , Gérard Boudol , Cédric Lhoussaine, On message deliverability and non-uniform receptivity, Fundamenta Informaticae, v.53 n.2, p.105-129, November 2002

Rocco de Nicola , Gian Luigi Ferrari , Rosario Pugliese, KLAIM: A Kernel Language for Agents Interaction and Mobility, IEEE Transactions on Software Engineering, v.24 n.5, p.315-330, May 1998

Luís Lopes , Vasco T. Vasconcelos , Fernando Silva, Fine-Grained Multithreading with Process Calculi, IEEE Transactions on Computers, v.50 n.8, p.852-862, August 2001

Nobuko Yoshida , Martin Berger , Kohei Honda, Strong normalisation in the π-calculus, Information and Computation, v.191 n.2, p.145-202, 15 June 2004

Massimo Merro , Josva Kleist , Uwe Nestmann, Mobile objects as mobile processes, Information and Computation, v.177 n.2, p.195-241, 15 September 2002

Elie Najm , Abdelkrim Nimour , Jean-Bernard Stefani, Behavioural typing for objects and process calculi, Formal methods for distributed processing: a survey of object-oriented approaches, Cambridge University Press, New York, NY, 2001

Paola Quaglia , David Walker, Types and full abstraction for polyadic π-calculus, Information and Computation, v.200 n.2, p.215-246, 1 August 2005

Davide Sangiorgi, From λ to π; or, Rediscovering continuations, Mathematical Structures in Computer Science, v.9 n.4, p.367-401, August 1999

Franz Puntigam , Christof Peter, Types for Active Objects with Static Deadlock Prevention, Fundamenta Informaticae, v.48 n.4, p.315-341, December 2001

Joachim Niehren, Uniform confluence in concurrent computation, Journal of Functional Programming, v.10 n.5, p.453-499, September 2000

Ilaria Castellani, State-oriented Noninterference for CCS, Electronic Notes in Theoretical Computer Science (ENTCS), v.194 n.1, p.39-60, November, 2007

Reynald Affeldt , Naoki Kobayashi, A Coq Library for Verification of Concurrent Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 199, p.17-32, February, 2008

Davide Ancona , Sonia Fagorzi , Elena Zucca, A Parametric Calculus for Mobile Open Code, Electronic Notes in Theoretical Computer Science (ENTCS), v.192 n.3, p.3-22, November, 2008

Denis Caromel , Ludovic Henrio , Bernard Paul Serpette, Asynchronous sequential processes, Information and Computation, v.207 n.4, p.459-495, April, 2009

Naoki Kobayashi: colleagues

Benjamin C. Pierce: colleagues

David N. Turner: colleagues