Corecursion and non-divergence in session-typed processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8902, Issue , 2014, Pages 159-175

  Toninho, Bernardo ^a,b   Caires, Luis ^a   Pfenning, Frank ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENT AND DISTRIBUTED SYSTEMS; CURRY-HOWARD CORRESPONDENCE; DIVERGENT BEHAVIORS; INDUCTIVE-TYPE; LOGICAL RELATIONS; NOCV1; REDUCTION SEQUENCE; SESSION TYPES; TYPE SYSTEMS;

CALCULATIONS;

EID: 84996598696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-45917-1_11     Document Type: Article

References (26)

1. Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509-523. Springer, Heidelberg (1993)
2. 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)
3. Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL, pp. 273-284 (2008)
4. Caires, L., Pfenning, F.: Session types as intuitionistic linear propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222-236. Springer, Heidelberg (2010)
5. Wadler, P.: Propositions as sessions. In: ICFP 2012, pp. 273-286 (2012)
6. Toninho, B., Caires, L., Pfenning, F.: Dependent session types via intuitionistic linear type theory. In: PPDP 2011, pp. 161-172 (2011)
7. Pfenning, F., Caires, L., Toninho, B.: Proof-carrying code in a session-typed process calculus. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 21-36. Springer, Heidelberg (2011)
8. Caires, L., Pérez, J.A., Pfenning, F., Toninho, B.: Behavioral polymorphism and parametricity in session-based communication. In: Felleisen, M., Gardner, P. (eds.) Programming Languages and Systems. LNCS, vol. 7792, pp. 330-349. Springer, Heidelberg (2013)
9. Toninho, B., Caires, L., Pfenning, F.: Higher-order processes, functions, and sessions: A monadic integration. In: Felleisen, M., Gardner, P. (eds.) Programming Languages and Systems. LNCS, vol. 7792, pp. 350-369. Springer, Heidelberg (2013)
10. Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press (2001)
11. The Coq Development Team: The Coq Proof Assistant Reference Manual (2013)
12. Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)
13. Abel, A., Pientka, B.: Wellfounded recursion with copatterns: A unified approach to termination and productivity. In: LICS (2013)
14. Pérez, J.A., Caires, L., Pfenning, F., Toninho, B.: Linear logical relations for session-based concurrency. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol. 7211, pp. 539-558. Springer, Heidelberg (2012)
15. Aranda, J., Di Giusto, C., Palamidessi, C., Valencia, F.: On recursion, replication and scope mechanisms in process calculi. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 185-206. Springer, Heidelberg (2007)
16. Gay, S., Hole, M.: Subtyping for Session Types in the Pi Calculus. Acta Informatica 42(2-3), 191-225 (2005)
17. Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the pi -calculus. Inf. Comput. 191(2), 145-202 (2004)
18. Gay, S., Vasconcelos, V.T.: Linear type theory for asynchronous session types. J. Funct. Programming 20(1), 19-50 (2010)
19. Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP, vol. 155, pp. 619-632. Springer, Boston (2004)
20. Sangiorgi, D.: Termination of processes. Math. Struct. in Comp. Sci. 16(1), 1-39 (2006)
21. Morris, J.G., Lindley, S., Wadler, P.: The least must speak with the greatest (2014) Draft
22. Baelde, D.: Least and greatest fixed points in linear logic. TOCL 13(1) (January 2012)
23. Abel, A.: Strong normalization and equi-(co)inductive types. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 8-22. Springer, Heidelberg (2007)
24. Mendler, N.P.: Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic 5(12), 159-172 (1991)
25. Giménez, E.: Structural recursive definitions in type theory. In: Larsen, K.G., Skyum, S.,Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 397-408. Springer, Heidelberg (1998)
26. Grégoire, B., Sacchini, J.L.: On strong normalization of the calculus of constructions with type-based termination. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 333-347. Springer, Heidelberg (2010)