Variations on Mobile Processes

The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. Two bisimilarities, local bisimilarity and barbed bisimilarity, on chi processes are studied and are shown to be congruence relations. The former equivalence turns out to be strictly stronger than the latter. It is shown that chi calculus is capable of modeling sequential computation in that it captures the operational semantics of call-by-name lambda calculus. A translation from pi calculus to chi calculus is given, demonstrating that, practically speaking, pi is a sublanguage of chi. A higher-order version of chi calculus is proposed and examined. It combines the communication mechanism of chi calculus and the recursion mechanism of full lambda calculus, and therefore extends both.

[1]  Samson Abramsky.  Interaction categories and communicating sequential processes , 1994 .

[2]  Yuxi Fu.  A Proof Theoretical Approach to Communication , 1997, ICALP.

[3]  Robin Milner,et al.  Action Structures and the Pi Calculus , 1995 .

[4]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[5]  R. Milner.  Calculi for interaction , 1996, Acta Informatica.

[6]  Rocco De Nicola,et al.  Testing Equivalence for Mobile Processes , 1995, Inf. Comput..

[7]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[8]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[9]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[10]  Bent Thomsen.  A Theory of Higher Order Communicating Systems , 1995, Inf. Comput..

[11]  Davide Sangiorgi.  pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[12]  Davide Sangiorgi,et al.  Techniques of \ weak bisimulation up to " , 1992 .

[13]  D. Sangiorgi.  - calculus , internal mobility , and agent-passing calculi , 1995 .

[14]  Yves Lafont.  Interaction Combinators , 1997, Inf. Comput..

[15]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[16]  Huimin Lin.  Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus , 1998, ICALP.

[17]  Robin Milner,et al.  Control structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[18]  Rajagopal Nagarajan,et al.  Interaction categories and the foundations of typed concurrent programming , 1996, NATO ASI DPD.

[19]  Björn Victor,et al.  Concurrent Constraints in the Fusion Calculus , 1998 .

[20]  A. Troelstra.  Lectures on linear logic , 1992 .

[21]  Huimin Lin,et al.  Unique Fixpoint Induction for Mobile Processes , 1995, CONCUR.

[22]  C. K. R. T. Jones,et al.  The ϱ-Calculus , 1981, Math. Log. Q..

[23]  Yuxi Fu.  Bisimulation Lattice of Chi Processes , 1998, ASIAN.

[24]  Davide Sangiorgi.  The Lazy Lambda Calculus in a Concurrency Scenario , 1994, Inf. Comput..

[25]  S. Abramsky.  The lazy lambda calculus , 1990 .

[26]  Samson Abramsky,et al.  Computational Interpretations of Linear Logic , 1993, Theor. Comput. Sci..

[27]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[28]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[29]  Michele Boreale,et al.  On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1996, Theor. Comput. Sci..

[30]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[31]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[32]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[33]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[34]  Gianluigi Bellin,et al.  On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[35]  Robin Milner.  Action Calculi, or Syntactic Action Structures , 1993, MFCS.

[36]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[37]  R. A. G. Seely,et al.  Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .

[38]  E. Keith Lloyd,et al.  Reaction Graphs , 1998 .

[39]  A classical mind: essays in honour of C. A. R. Hoare , 1994 .

[40]  Joachim Parrow.  Interaction Diagrams , 1995, Nord. J. Comput..

[41]  Mark Ryan,et al.  Proceedings of the First Imperial College Department of Computing Workshop on Theory and formal methods 1993 , 1993, FME 1993.

[42]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[43]  Huimin Lin.  Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus , 1995, TAPSOFT.

[44]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[45]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[46]  Davide Sangiorgi,et al.  Lazy functions and mobile processes , 2000, Proof, Language, and Interaction.

[47]  C.-H. Luke Ong.  The Lazy Lambda Calculus : an investigation into the foundations of functional programming , 1988 .

[48]  Jean-Yves Girard,et al.  Towards a geometry of interaction , 1989 .

[49]  I. H. Öğüş,et al.  NATO ASI Series , 1997 .

[50]  Yuxi Fu.  The /spl chi/-calculus , 1997, Proceedings. Advances in Parallel and Distributed Computing.

[51]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[52]  Cheng-Shang Chang.  Calculus , 2020, Bicycle or Unicycle?.

[53]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[54]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[55]  Samson Abramsky,et al.  Proofs as Processes , 1992, Theor. Comput. Sci..

[56]  Davide Sangiorgi,et al.  Algebraic Theories for Name-Passing Calculi , 1993, Inf. Comput..

[57]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[58]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[59]  David Walker,et al.  Objects in the pi-Calculus , 1992, Inf. Comput..

[60]  H. Barendregt.  Lambda Calculus kHV its Hovels , 1984 .

[61]  Michael Barr,et al.  *-Autonomous categories and linear logic , 1991, Mathematical Structures in Computer Science.

[62]  Samson Abramsky,et al.  Interaction Categories , 1993, Theory and Formal Methods.

[63]  Robin Milner.  Functions as Processes , 1990, ICALP.

[64]  Björn Victor,et al.  The Tau-Laws of Fusion , 1998, CONCUR.

[65]  David Walker,et al.  Pi-Calculus Semantics of Object-Oriented Programming Languages , 1991, TACS.

[66]  Björn Victor,et al.  The Update Calculus (Extended Abstract) , 1997, AMAST.