Advertisement

Types for dyadic interaction

  • Kohei Honda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 715)

Abstract

We formulate a typed formalism for concurrency where types denote freely composable structure of dyadic interaction in the symmetric scheme. The resulting calculus is a typed reconstruction of name passing process calculi. Systems with both the explicit and implicit typing disciplines, where types form a simple hierarchy of types, are presented, which are proved to be in accordance with each other. A typed variant of bisimilarity is formulated and it is shown that typed β-equality has a clean embedding in the bisimilarity. Name reference structure induced by the simple hierarchy of types is studied, which fully characterises the typable terms in the set of untyped terms. It turns out that the name reference structure results in the deadlock-free property for a subset of terms with a certain regular structure, showing behavioural significance of the simple type discipline.

Keywords

Functional Type Atomic Type Reference Structure Dyadic Interaction Constant Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Abramsky, S., Computational interpretations of linear logic. Technical Report DOC 90/20, Imperial College, Department of Computing, October 1990. to appear in Theoretical Computer Science.Google Scholar
  2. [2]
    Barendregt, H. and Hemerik, K., Types in lambda calculi and programming languages. In Proceeding of ESOP 90, 1990.Google Scholar
  3. [3]
    Boudol, G., Asynchrony and π-calculus. Manuscript. 1992.Google Scholar
  4. [4]
    Engberg, U. and Nielsen, M., A Calculus of Communicating Systems with Label Passing. Research Report DAIMI PB-208, Computer Science Department, University of Aarhus, 1986.Google Scholar
  5. [5]
    Gay, S. J., A sort inference algorizm for the poliadic π-calculus. POPL, 1993.Google Scholar
  6. [6]
    Hindley R., The Principal Type-Scheme in Objects in Combinatory Logic, Trans. American. Math. Soc. 146.Google Scholar
  7. [7]
    Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication, In: Proc. of European Conference on Object-Oriented Programming, LNCS, Springer-Verlag, July 1991.Google Scholar
  8. [8]
    Honda, K., Representing Functions in an Object Calculus, a typescript, 19pp, October 1991. Revised version as Keio CS Report 92-005, 1992.Google Scholar
  9. [9]
    Honda, K., Two Bisimilarities in ν-calculus, September 1992, submitted. Revised version as Keio CS Report 92-002, 1992.Google Scholar
  10. [10]
    Honda, K., Types for Dyadic Interaction (the full version), Keio CS Report 92-003, 1993.Google Scholar
  11. [11]
    Honda, K., and Yoshida, N., On Process Based Reduction Semantics, Keio CS technical report 93-002, 1993.Google Scholar
  12. [12]
    Lafont, Y., Interaction Nets, POPL 1990.Google Scholar
  13. [13]
    Milner, R., A Theory of Type Polymorphism in Programming, Journal of ACM, 1978.Google Scholar
  14. [14]
    Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes. Part I, II. ECS-LFCS-89-85/86, Edinburgh University, 1989.Google Scholar
  15. [15]
    Milner, R., Functions as Processes. In Automate, Language and Programming, LNCS 443, 1990.Google Scholar
  16. [16]
    Milner,R. and Sangiriorgi, D., Barbed Bisimulation, ICALP, 1992.Google Scholar
  17. [17]
    Milner, R., Polyadic π-calculus, LFCS report, Edinburgh University 1992.Google Scholar
  18. [18]
    Mitchell, J., Type Systems for Programming Languages, Handbook of Theoretical Computer Science, P 367–458, Elsevier Science Publishers B.V., 1990.Google Scholar
  19. [19]
    Pierce, B. and Sangiorgi, D., Typing and Subtyping for Mobile Processes.Google Scholar
  20. [20]
    Vasco, V. and Honda, K., Principal typing scheme for polyadic π-Calculus, in this volume.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Kohei Honda
    • 1
  1. 1.Department of Computer ScienceKeio UniversityYokohamaJapan

Personalised recommendations