Abstract
In this paper we present a direct algorithm for session type inference for the \(\pi \)-calculus. Type inference for session types has previously been achieved by either imposing limitations and restriction on the \(\pi \)-calculus, or by reducing the type inference problem to that for linear types. Our approach is based on constraint generation and solving. We generate constraints for a process based on its syntactical components, and afterwards solve the generated constraints in a predetermined order. We prove the soundness, completeness, and termination of this approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bernardi, G., Dardha, O., Gay, S.J., Kouzapas, D.: On duality relations for session types. In: Maffei, M., Tuosto, E. (eds.) TGC 2014. LNCS, vol. 8902, pp. 51–66. Springer, Heidelberg (2014)
Dardha, O.: Recursive session types revisited. In: Carbone, M. (ed.) Proceedings of the Third Workshop on Behavioural Types, BEAT 2014. EPTCS, vol. 162, Rome, Italy, 1st, pp. 27–34, September 2014
Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. In: Proceedings of the 14th Symposium on Principles and Practice of Declarative Programming, pp. 139–150. ACM (2012)
Gay, S., Hole, M.: Subtyping for session types in the pi calculus. Acta Informatica 42(2–3), 191–225 (2005)
Giunti, M., Vasconcelos, V.T.: Linearity, session types and the pi calculus. Mathematical Structures in Computer Science, 1–32 (2013)
Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives, type discipline for structured communication-based programming. In: Hankin, C. (ed.) Programming Languages and Systems. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998). Observation of strains. Infect. Dis. Ther. 3(1), 35–43 (2011)
Kobayashi, N.: Type systems for concurrent programs. In: Aichernig, B.K. (ed.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 439–453. Springer, Heidelberg (2003)
Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity, the pi-calculus. ACM Trans. Program. Lang. Syst. (TOPLAS) 21(5), 914–947 (1999)
Lhoussaine, C.: Type inference for a distributed \(\pi \)-calculus. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 253–268. Springer, Heidelberg (2003)
Mezzina, L.G.: How to infer finite session types in a calculus of services and sessions. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 216–231. Springer, Heidelberg (2008)
Padovani, L.: Type reconstruction for the linear \(\pi \)-calculus with composite and equi-recursive types. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol. 8412, pp. 88–102. Springer, Heidelberg (2014)
Tasistro, A., Copello, E., Szasz, N.: Principal type scheme for session types. Int. J. Logic Comput. 3(1), 34–43 (2012)
Vasconcelos, V.T.: Fundamentals of session types. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 158–186. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Graversen, E.F., Harbo, J.B., Hüttel, H., Bjerregaard, M.O., Poulsen, N.S., Wahl, S. (2016). Type Inference for Session Types in the \(\pi \)-calculus. In: Hildebrandt, T., Ravara, A., van der Werf, J., Weidlich, M. (eds) Web Services, Formal Methods, and Behavioral Types. WS-FM WS-FM 2014 2015. Lecture Notes in Computer Science(), vol 9421. Springer, Cham. https://doi.org/10.1007/978-3-319-33612-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-33612-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33611-4
Online ISBN: 978-3-319-33612-1
eBook Packages: Computer ScienceComputer Science (R0)