Skip to main content
×
Home

On session types and polynomial time

  • UGO DAL LAGO (a1) and PAOLO DI GIAMBERARDINO (a2)
Abstract

We show how systems of session types can enforce interactions to take bounded time for all typable processes. The type system we propose is based on Lafont's soft linear logic and is strongly inspired by recent works about session types as intuitionistic linear logic formulas. Our main result is the existence, for every typable process, of a polynomial bound on the length of reduction sequences starting from it and on the size of its reducts.

Copyright
References
Hide All
Baillot P. and Mogbil V. (2004) Soft lambda-calculus: A language for polynomial time computation. In: International Conference on Foundations of Software Science and Computation Structures 2004. Lecture Notes in Computer Science 2987 2741.
Caires L., Perez A, Pfenning F. and Toninho B. (2013) Behavioral polymorphism and parametricity in session-based communication. In: European Symposium on Programming 2013. Lecture Notes in Computer Science 7792 330349.
Caires L. and Pfenning F. (2010) Session types as intuitionistic linear propositions. In: International Conference on Concurrency Theory 2010. Lecture Notes in Computer Science 6269 222236.
Caires L., Pfenning F. and Toninho B. (2011a) Dependent session types via intuitionistic linear type theory. In: International Symposium on Principles and Practice of Declarative Programming 2011, 161–172.
Caires L., Pfenning F. and Toninho B. (2011b) Proof-carrying code in a session-typed process calculus. In: Certified Programs and Proofs. Lecture Notes in Computer Science 7086 2136.
Dal Lago U. and Baillot P. (2006) On light logics, uniform encodings and polynomial time. Mathematical Structures in Computer Science 16 (4) 717733.
Dal Lago U. and Di Giamberardino P. (2011) Soft session types. In: Expressiveness in Concurrency 2011. Electronic Proceedings in Theoretical Computer Science 64 5973.
Dal Lago U., Martini S. and Sangiorgi D. (2010) Light logics and higher-order processes. Expressiveness in Concurrency 2010. Electronic Proceedings in Theoretical Computer Science 41 4660.
Dal Lago U., Masini A. and Zorzi M. (2010) Quantum implicit computational complexity. Theoretical Computer Science 411 (2) 377409.
Girard J. Y. (1987) Linear logic. Theoretical Computer Science 50 1102.
Honda K., Nobuko Y. and Carbone M. (2008) Multiparty asynchronous session types. In: Principles of Programming Languages 2008, 273–284.
Honda K., Vasconcelos V. and Kubo M. (1998) Language primitives and type discipline for structured communication-based programming. In: European Symposium on Programming 1998, 122–138.
Lafont Y. (2004) Soft linear logic and polynomial time. Theoretical Computer Science 318 (1–2) 163180.
Mairson H. G. (1992) A simple proof of a theorem of Statman. Theoretical Computer Science 103 (2) 387394.
Mostrous D. and Yoshida N. (2007) Two session typing systems for higher-order mobile processes. In: Typed Lambda Calculi and Applications 2007. Lecture Notes in Computer Science 4583 321335.
Statman R. (1979) The typed lambda-calculus is not elementary recursive. Theoretical Computer Science 9 7381.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 25 *
Loading metrics...

Abstract views

Total abstract views: 134 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 18th November 2017. This data will be updated every 24 hours.