Abstract
The agent expressions of the π-calculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of π-calculus (unlabeled) reduction is identified with “entailedby”. Under this translation, parallel composition is mapped to the multiplicative disjunct (“par”) and restriction is mapped to universal quantification. Prefixing, non-deterministic choice (+), replication (!), and the match guard are all represented using non-logical constants, which are specified using a simple form of axiom, called here a process clause. These process clauses resemble Horn clauses except that they may have multiple conclusions; that is, their heads may be the par of atomic formulas. Such multiple conclusion clauses are used to axiomatize communications among agents. Given this translation, it is nature to ask to what extent proof theory can be used to understand the meta-theory of the π-calculus. We present some preliminary results along this line for πo, the “propositional” fragment of the π-calculus, which lacks restriction and value passing (πo is a subset of CCS). Using ideas from proof-theory, we introduce co-agents and show that they can specify some testing equivalences for πo. If negation-as-failure-to-prove is permitted as a co-agent combinator, then testing equivalence based on co-agents yields observational equivalence for πo. This latter result follows from observing that co-agents directly represent formulas in the Hennessy-Milner modal logic.
Preview
Unable to display preview. Download preview PDF.
References
Samson Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225–241, 1987.
Samson Abramsky. Computational interpretations of linear logic. Technical Report Research Report DOC 90/20, Imperial College, October 1990.
Samson Abramsky. Proofs as processes. Copy of transparencies, 1991.
J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with builtin inheritance. New Generation Computing, 9:3–4, 1991. (Special issue of papers selected from ICLP'90).
Amy Felty. A logic program for transforming sequent proofs to natural deduction proofs. In Peter Schroeder-Heister, editor, Extensions of Logic Programming: International Workshop, Tübingen FRG, December 1989, volume 475 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991.
Gerhard Gentzen. Investigations into logical deductions, 1935. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68–131. North-Holland Publishing Co., Amsterdam, 1969.
Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
Matthew Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
Joshua Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 1992. Invited to a special issue of papers from the 1991 LICS conference.
Stephen Cole Kleene. Permutabilities of inferences in gentzen's calculi LK and LJ. Memoirs of the American Mathematical Society, 10, 1952.
Dale Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6:79–108, 1989.
Robin Milner. Functions as processes. Research Report 1154, INRIA, 1990.
Robin Milner. The polyadic π-calculus: A tutorial. LFCS Report Series ECS-LFCS-91-180, University of Edinburgh, October 1991.
Dale Miller. Abstract syntax and logic programming. In Logic Programming: Proceedings of the First and Second Russian Conferences on Logic Programming, number 592 in Lecture Notes in Artificial Intelligence, pages 322–337. Springer-Verlag, 1992. Also available as technical report MS-CIS-91-72, UPenn.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, Part I. LFCS Report Series ECS-LFCS-89-85, University of Edinburgh, June 1989.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, Part II. LFCS Report Series ECS-LFCS-89-86, University of Edinburgh, June 1989.
Robin Milner, Joachim Parrow, and David Walker. Modal logics for mobile processes. LFCS Report Series ECS-LFCS-91-136, University of Edinburgh, April 1991.
Gopalan Nadathur and Dale Miller. Higher-order Horn clauses. Journal of the ACM, 37(4):777–814, October 1990.
Garrel Pottinger. Normalization as a homomorphic image of cut-elimination. Annals of Mathematical Logic, 12(3):223–357, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, D. (1993). The π-calculus as a theory in linear logic: Preliminary results. In: Lamma, E., Mello, P. (eds) Extensions of Logic Programming. ELP 1992. Lecture Notes in Computer Science, vol 660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56454-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-56454-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56454-6
Online ISBN: 978-3-540-47562-0
eBook Packages: Springer Book Archive