Skip to main content
SpringerLink
Log in

Asynchronous communication model based on linear logic

  • Published:
Formal Aspects of Computing

Abstract

We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind oflinear logic programming framework, where its operational semantics is described in terms ofproof construction in linear logic. We also give a model-theoretic semantics based onphase semantics, a model of linear logic. Our framework well captures concurrent computation based on asynchronous communication. It will, therefore, provide us with a new insight into other models of asynchronous concurrent computation from alogical point of view. We also expect ACL to become a formal framework for analysis, synthesis and transformation of concurrent programs by the use of techniques for traditional logic programming. ACL's attractive features for concurrent programming paradigms are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramsky, S.: “Computational Interpretations of Linear Logic,”Theoretical Computer Science, vol. 111, pp. 3–57, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. Agha, G.:Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.

  3. Agha, G.: “The Structure and Semantics of Actor Language,” inProceedings of the School/Workshop on Foundations of Object-Oriented Languages, Springer Verlag, 1991.

  4. Agha, G. and Callsen, C. J.: “ActorSpaces: An Open Distributed Programming Paradigm,” inProceedings of Principles and Practices of Parallel Programming, pp. 23–32, 1993.

  5. Andreoli, J.-M. and Pareschi, R.: “Linear Objects: Logical processes with built-in inheritance,”New Generation Computing, vol. 9, pp. 445–173, 1991.

    Article  Google Scholar 

  6. Andreoli, J.-M. and Pareschi, R.: “Communication as Fair Distribution of Knowledge,” inProceedings of OOPSLA '91, pp. 212–229, 1991.

  7. Andreoli, J.-M. and Pareschi, R.: “Associative Communication and its Optimization via Abstract Interpretation,” 1992. Submitted for publication.

  8. Asperti, A., Ferrari, G. L. and Gorrieri, R.: “Implicative Formulae in the “Proofs as Computations Analogy”,” inProceedings of SIGACT/SIGPLAN Symposium on Principles of Programming Language, pp. 59–71, 1990.

  9. Bellin, G. and van de Wiele, J.: “Proof Nets and Typed Lambda Calculus I. Empires and Kingdoms.” draft, 1993.

  10. Brookes, S. D., Hoare, C. A. R. and Roscoe, A. W.: “A Theory of Communicating Sequential Processes,”Journal of ACM, vol. 31, no. 3, pp. 560–599, July 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. Dershowitz, N. and Jouannaud, J.-P.: “Rewrite Systems,” inHandbook of Theoretical Computer Science Volume B (J. V. Leeuwen, ed.), ch. 6, pp. 243–320, The MIT press/Elsevier, 1990.

  12. Engberg, U. and Winskel, G.: “Petri Nets as Models of Linear Logic,” inProceedings of CAAP'90, vol. 431 ofLecture Notes in Computer Science, pp. 147–161, 1990.

    Article  MathSciNet  Google Scholar 

  13. Gehlot, V. and Gunter, C.: “ Normal Process Representatives,” inProceedings of IEEE Symposium on Logic in Computer Science, pp. 200–207, 1990.

  14. Gelernter, D.: “Generative Communication in Linda,”ACM Transactions on Programming Language and Systems, vol. 7, no. 1, pp. 80–112, 1985.

    Article  MATH  Google Scholar 

  15. Girard, J.-Y.: “Linear Logic,”Theoretical Computer Science, vol. 50, pp. 1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  16. Girard, J.-Y., Lafont, Y. and Taylor, P.:Proofs and Types. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990.

  17. Hirschberg, D. S.: “ A linear space algorithm for computing maximal common subsequence,”Communications of the ACM, vol. 18, no. 6, pp. 341–343, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  18. Kobayashi, N. and Yonezawa, A.: “ ACL — A Concurrent Linear Logic Programming Paradigm,” inProceedings of International Logic Programming Symposium, pp. 279–294, MIT Press, 1993.

  19. Kobayashi, N. and Yonezawa, A.: “Logical, Testing, and Observation Equivalence for Processes in a Linear Logic Programming,” Tech. Rep. 93-4, Department of Information Science, University of Tokyo, 1993. presented at Linear Logic Workshop, Cornell University.

  20. Lafont, Y.: “Interaction Nets,” inProceedings of Seventeenth ACM SIGPLAN/SIGACT Symposium on Principles Of Programming Language, pp. 95–108, 1990.

  21. Lloyd, J.:Foundations of Logic Programming. Springer-Verlag, 2nd ed., 1987.

  22. Marti-Oliet, N. and Meseguer, J.: “From Petri Nets to Linear Logic,” inCategory Theory and Computer Science, vol. 389 ofLecture Notes in Computer Science, pp. 313–337, Springer Verlag, 1989.

  23. Miller, D.: “The π-calculus as a theory in linear logic: Preliminary results,“ inProceedings of the 1992 Workshop on Extensions to Logic Programming, vol. 660of Lecture Notes in Computer Science, pp. 242–265, 1992.

    Google Scholar 

  24. Milner, R.: “Calculi for Synchrony and Asynchrony,”Theoretical Computer Science, vol. 25, pp. 267–310, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  25. Milner, R.:Communication and Concurrency. Prentice Hall, 1989.

  26. Milner, R.: “Function as Processes,” inAutomata, Language and Programming, vol. 443 ofLecture Notes in Computer Science, pp. 167–180, Springer Verlag, 1990.

  27. Milner, R., Parrow, J. and Walker, D.: “A Calculus of Mobile Processes, Part I,”Information and Computation, pp. 1–40, September 1992.

  28. Milner, R., Parrow, J. and Walker, D.: “A Calculus of Mobile Processes, Part II,”Information and Computation, pp. 1–40, September 1992.

  29. Nicola, R. D. and Hennessy, M. C. B.: “Testing Equivalence for Processes,”Theoretical Computer Science, vol. 34, pp. 83–133, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  30. Saraswat, V. and Lincoln, P.: “Higher-order, linear, concurrent constraint programming,” July 1992. draft.

  31. Shapiro, E.: “The Family of Concurrent Logic Programming Languages,”ACM Computing Surveys, vol. 21, no. 3, pp. 413–510, September 1989.

    Article  Google Scholar 

  32. Yonezawa, A.:ABCL: An Object-Oriented Concurrent System. MIT Press, 1990.

  33. Yonezawa, A. and Tokoro, M.:Object-Oriented Concurrent Programming. The MIT Press, 1987.

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113, Tokyo, Japan

    Naoki Kobayashi & Akinori Yonezawa

Authors
  1. Naoki Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akinori Yonezawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kobayashi, N., Yonezawa, A. Asynchronous communication model based on linear logic. Formal Aspects of Computing 7, 113–149 (1995). https://doi.org/10.1007/BF01211602

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01211602

Keywords

Search

Navigation