Dependent session types via intuitionistic linear type theory

PPDP'11 - Proceedings of the 2011 Symposium on Principles and Practices of Declarative Programming

Volumn , Issue , 2011, Pages 161-171

  Toninho, Bernardo ^a   Caires, Luís ^b   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

calculus; Dependent types; Session types; Type theory

Indexed keywords

AS INTERFACES; COMMUNICATION OVERHEADS; DEPENDENT TYPES; LINEAR TYPE THEORY; PROOF IRRELEVANCE; SESSION TYPES; TRUSTED PARTY; TYPE SYSTEMS; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

CALCULATIONS;

EID: 80052145663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2003476.2003499     Document Type: Conference Paper

References (31)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In 28th Symposium on Principles of Programming Languages, POPL'01, pages 104-115. ACM, 2001.
2. S. Abramsky. Computational Interpretations of Linear Logic. Theor. Comp. Sci., 111(1&2), 1993.
3. S. Awodey and A. Bauer. Propositions as [types]. J. Log. Comput., 14(4):447-471, 2004.
4. A. Barber and G. Plotkin. Dual Intuitionistic Linear Logic. Technical Report LFCS-96-347, Univ. of Edinburgh, 1997.
5. E. Beffara. A Concurrent Model for Linear Logic. ENTCS, 155:147- 168, 2006. (Pubitemid 44275091)
6. G. Bellin and P. Scott. on the -Calculus and Linear Logic. Theor. Comp. Sci., 135:11-65, 1994.
7. L. Bocchi, K. Honda, E. Tuosto, and N. Yoshida. A theory of designby- contract for distributed multiparty interactions. In 21st International Conference on Concurrency Theory, CONCUR'10, pages 162- 176. Springer LNCS 6269, 2010.
8. E. Bonelli, A. Compagnoni, and E. L. Gunter. Correspondence Assertions for Process Synchronization in Concurrent Communications. J. of Func. Prog., 15(2):219-247, 2005.
9. L. Caires. Logical Semantics of Types for Concurrency. In International Conference on Algebra and Coalgebra in Computer Science, CALCO'07, pages 16-35. Springer LNCS 4624, 2007.
10. L. Caires and F. Pfenning. Session types as intuitionistic linear propositions. In 21st International Conference on Concurrency Theory, CONCUR'10, pages 222-236. Springer LNCS 6269, 2010.
11. L. Caires and H. T. Vieira. Conversation types. Theor. Comput. Sci., 411(51-52):4399-4440, 2010.
12. I. Cervesato and F. Pfenning. A linear logical framework. Inf. & Comput., 179(1), 2002.
13. R. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
14. T. Coquand and G. Huet. The calculus of constructions. Inf. & Comput., 76:95-120, February 1988.
15. M. Fähndrich, M. Aiken, C. Hawblitzel, O. Hodson, G. C. Hunt, J. R. Larus, and S. Levi. Language support for fast and reliable messagebased communication in Singularity OS. In EuroSys 2006, pages 177- 190. ACM, 2006. (Pubitemid 47485746)
16. D. Garg, L. Bauer, K. Bowers, F. Pfenning, and M. Reiter. A linear logic of affirmation and knowledge. In Proceedings of the 11th European Symposium on Research in Computer Security, ESORICS'06, pages 297-312. Springer LNCS 4189, Sept. 2006.
17. S. Gay and M. Hole. Subtyping for Session Types in the Pi Calculus. Acta Informatica, 42(2-3):191-225, 2005.
18. M. Giunti and V. T. Vasconcelos. A Linear Account of Session Types in the Pi-Calculus. In 21st International Conference on Concurrency Theory, CONCUR'10, pages 432-446. Springer LNCS 6269, 2010.
19. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. J. ACM, 40:143-184, January 1993.
20. K. Honda. Types for dyadic interaction. In 4th International Conference on Concurrency Theory, CONCUR'93, pages 509-523. Springer LNCS 715, 1993.
21. K. Honda and O. Laurent. An exact correspondence between a typed pi-calculus and polarised proof-nets. Theor. Comp. Sci., 411:2223- 2238, 2010.
22. K. Honda, V. T. Vasconcelos, and M. Kubo. Language primitives and type discipline for structured communication-based programming. In 7th European Symposium on Programming Languages and Systems, ESOP'98, pages 122-138. Springer LNCS 1381, 1998. (Pubitemid 128054298)
23. A. Igarashi and N. Kobayashi. A generic type system for the picalculus. In 28th Symposium on Principles of Programming Languages, POPL'01, pages 128-141. ACM, 2001.
24. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the picalculus. In 23rd Symposium on Principles of Programming Languages, POPL'96, pages 358-371. ACM, 1996.
25. P.Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science VI, pages 153-175. North-Holland, 1980.
26. R. Milner. Functions as processes. Math. Struct. in Comp. Sci., 2(2):119-141, 1992.
27. G. C. Necula. Proof-carrying code. In 24th Symposium on Principles of Programming Languages, POPL'97, pages 106-119. ACM, 1997.
28. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, SE-412 96 G̈oteborg, Sweden, September 2007.
29. F. Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In 16th Symposium on Logic in Computer Science, LICS'01, pages 221-230. IEEE Computer Society, 2001. (Pubitemid 32795633)
30. D. Sangiorgi and D. Walker. The πcalculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
31. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In Conference on Programming Language Design and Implementation, PLDI'98, pages 249-257. ACM, 1998.