Skip to main content

A Polymorphic Type System with Progress for Binary Sessions

  • Conference paper
Web Information Systems and Mining (WISM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7529))

Included in the following conference series:

Abstract

A static bounded polymorphic type system is presented in this paper, which ensures the progress property, i.e., the property that once a communication has been established, well-formed programs will never starve at communication points. The introduction of subtyping for session types and the relaxed duality relation increases the flexibility of the type system, and allows the participants in a conversation to follow different protocols that are nevertheless compatible in a sense defined by the subtyping relation. In addition, to keep progress in sessions, the type compliance is defined to associate with the relaxed duality relation, where the environment is balanced. Finally, the soundness and communication safety of the type system are proved, and some related work and possible future work in this area are discussed.

This work has been supported by the Natural Science Foundation of China under grant 60873234 and Top Key Discipline of Computer Software and Theory in Zhejiang Provincial Colleges at Zhejiang Normal University.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Pierce, B.C., Sangiorgi, D.: Typing and subtyping for mobile processes. Mathematical Structures in Computer Science 6(5), 409–453 (1996)

    MathSciNet  MATH  Google Scholar 

  2. Pierce, B.C., Sangiorgi, D.: Behavioral equivalence in the polymorphic Pi-calculus. Journal of the ACM 47(3), 531–584 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Turner, D.N.: The polymorphic Pi-Calculus: theory and implementation. PhD thesis, University of Edinburgh (1996)

    Google Scholar 

  4. Gay, S.J.: A sort inference algorithm for the polyadic Pi-calculus. In: 20th ACM Symposium on Principles of Programming Languages, pp. 429–438. ACM Press (1993)

    Google Scholar 

  5. Gay, S.J., Hole, M.: Types and Subtypes for Client-Server Interactions. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol. 1576, pp. 74–90. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Gay, S.J., Hole, M.J.: Bounded polymorphism in session types. Technical Report, Department of Computing Science, University of Glasgow (2003)

    Google Scholar 

  7. Gay, S.J., Hole, M.J.: Subtyping for session types in the Pi-Calculus. Acta Informatica 42(2/3), 191–225 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gay, S.J.: Bounded polymorphism in session types. Mathematical Structures in Computer Science 18, 895–930 (2007)

    Article  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  10. Takeuchi, K., Honda, K., Kubo, M.: An Interaction-Based Language and Its Typing System. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398–413. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  11. Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: 32nd Symposium on Principles of Programming Languages, pp. 273–284. ACM Press, New York (2008)

    Google Scholar 

  13. Reynolds, J.C.: Towards a Theory of Type Structure. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol. 19, pp. 408–425. Springer, Heidelberg (1974)

    Chapter  Google Scholar 

  14. Girard, J.Y.: Interprétation fonctionnelle et élimination des coupures dans l’arithmétique d’ordre supétieur, PhD thesis, University of Paris VII (1972)

    Google Scholar 

  15. Acciai, L., Boreale, M.: A Type System for Client Progress in a Service-Oriented Calculus. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 642–658. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  17. Coppo, M., Dezani-Ciancaglini, M., Yoshida, N.: Asynchronous Session Types and Progress for Object Oriented Languages. In: Bonsangue, M.M., Johnsen, E.B. (eds.) FMOODS 2007. LNCS, vol. 4468, pp. 1–31. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Dezani-Ciancaglini, M., Mostrous, D., Yoshida, N., Drossopoulou, S.: Session Types for Object-Oriented Languages. In: Hu, Q. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 328–352. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Dezani-Ciancaglini, M., de’Liguoro, U., Yoshida, N.: On Progress for Structured Communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 257–275. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Castagna, G., Dezani-Ciancaglini, M., Padovani, L.: On global types and multi-party sessions. Logical Methods in Computer Science 8(1), 1–45 (2012)

    Article  MathSciNet  Google Scholar 

  21. Yoshida, N., Vasconcelos, V.: Language primitives and type disciplines for structured communication-based programming revisited. In: 1st International Workshop on Security and Rewriting Techniques. ENTCS, vol. 171, pp. 73–93. Elsevier (2007)

    Google Scholar 

  22. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II, Information and Computation, pp. 1–77 (1992)

    Google Scholar 

  23. Vasconcelos, V.T., Honda, K.: Principal Typing Schemes in a Polyadic Pi-Calculus. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 524–538. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  24. Yang, Z., Zhong, F., Zhang, J.: A bounded polymorphic type system for client-server interactions. In: 4th International Conference on Networking and Digital Society; Journal of Digital Content Technology and its Application (to appear, 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, Z., Zhong, F., Zhang, J. (2012). A Polymorphic Type System with Progress for Binary Sessions. In: Wang, F.L., Lei, J., Gong, Z., Luo, X. (eds) Web Information Systems and Mining. WISM 2012. Lecture Notes in Computer Science, vol 7529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33469-6_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33469-6_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33468-9

  • Online ISBN: 978-3-642-33469-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics