On encoding pπ in mπ | SpringerLink
Skip to main content
Springer Nature Link
Log in

On encoding pπ in mπ

  • Conference paper
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1530))

Abstract

This paper is about the encoding of pπ, the polyadic π-calculus, in mπ, the monadic π-calculus. A type system for mπ processes is introduced which captures the interaction regime underlying the encoding of pπ processes respecting a sorting. A full-abstraction result is shown: two pπ processes are typed barbed congruent iff their mπ encodings are monadic-typed barbed congruent.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 9151
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Honda, K.: Types for Dyadic Interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509–523. Springer, Heidelberg (1993)

    Google Scholar 

  2. Kobayashi, N.: A partially deadlock-free typed process calculus. In: Proc. 12th IEEE Symp. LICS, pp. 128–139 (1997)

    Google Scholar 

  3. Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-Calculus. In: Proc. 23rd ACM Symp. POPL, pp. 358–371 (1996)

    Google Scholar 

  4. Liu, X., Walker, D.: A Polymorphic Type System for the Polyadic π-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 103–116. Springer, Heidelberg (1995)

    Google Scholar 

  5. Milner, R.: The Polyadic π-Calculus: a Tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification, pp. 203–246. Springer, Heidelberg (1992)

    Google Scholar 

  6. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I and II. Information and Computation 100(1), 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nestmann, U., Steffen, M.: Typing Confluence. In: Gnesi, S., Latella, D. (eds.) Proc. 2nd Int. ERCIM Workshop on Formal Methods in Industrial Critical Systems, pp. 77–101 (1997)

    Google Scholar 

  8. Pierce, B.C., Sangiorgi, D.: Typing and Subtyping for Mobile Processes. In: Proc. 8th IEEE Symp. LICS, pp. 376–385 (1993)

    Google Scholar 

  9. Pierce, B.C., Sangiorgi, D.: Behavioral Equivalence in the Polymorphic Pi-Calculus. In: Proc. 24th ACM Symp. POPL, pp. 242–255 (1997)

    Google Scholar 

  10. Sangiorgi, D.: The name discipline of uniform receptiveness. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 303–313. Springer, Heidelberg (1997)

    Google Scholar 

  11. Turner, D.N.: The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Comp. Sc. Dep., Edinburgh University, 1996. Report ECS-LFCS-96-345

    Google Scholar 

  12. Vasconcelos, V.T., Honda, K.: Principal typing schemes in a polyadic π-calculus. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715. Springer, Heidelberg (1993)

    Google Scholar 

  13. Yoshida, N.: Graph Types for Monadic Mobile Processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 371–386. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS – Basic Research in Computer Science, Centre of the Danish National Research Foundation Aarhus University, Denmark

    Paola Quaglia

  2. Oxford University Computing Laboratory, U.K.

    David Walker

Authors
  1. Paola Quaglia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Walker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Vikraman Arvind

  2. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Ramanujam

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Quaglia, P., Walker, D. (1998). On encoding pπ in mπ . In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65384-4

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation