Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-25T04:37:18.640Z Has data issue: false hasContentIssue false
  • English
  • Français

On session types and polynomial time

Published online by Cambridge University Press:  14 January 2015

UGO DAL LAGO  and
PAOLO DI GIAMBERARDINO
UGO DAL LAGO
Affiliation:
Università di Bologna & INRIA Sophia Antipolis, Mura Anteo Zamboni, 7 40127 Bologna, Italy Email: dallago@cs.unibo.it
PAOLO DI GIAMBERARDINO
Affiliation:
Dipartimento di Matematica e Informatica, Università di Cagliari, Via Ospedale, 72 09124 Cagliari, Italy Email: digiambe@unica.it.
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 26 , Special Issue 8: Special Issue: Express'11 , December 2016 , pp. 1433 - 1458
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

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 27–41.Google Scholar
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 330–349.CrossRefGoogle Scholar
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 222–236.Google Scholar
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.Google Scholar
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 21–36.Google Scholar
Dal Lago, U. and Baillot, P. (2006) On light logics, uniform encodings and polynomial time. Mathematical Structures in Computer Science 16 (4) 717–733.Google Scholar
Dal Lago, U. and Di Giamberardino, P. (2011) Soft session types. In: Expressiveness in Concurrency 2011. Electronic Proceedings in Theoretical Computer Science 64 59–73.Google Scholar
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 46–60.CrossRefGoogle Scholar
Dal Lago, U., Masini, A. and Zorzi, M. (2010) Quantum implicit computational complexity. Theoretical Computer Science 411 (2) 377–409.Google Scholar
Girard, J. Y. (1987) Linear logic. Theoretical Computer Science 50 1–102.Google Scholar
Honda, K., Nobuko, Y. and Carbone, M. (2008) Multiparty asynchronous session types. In: Principles of Programming Languages 2008, 273–284.CrossRefGoogle Scholar
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.Google Scholar
Lafont, Y. (2004) Soft linear logic and polynomial time. Theoretical Computer Science 318 (1–2) 163–180.CrossRefGoogle Scholar
Mairson, H. G. (1992) A simple proof of a theorem of Statman. Theoretical Computer Science 103 (2) 387–394.Google Scholar
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 321–335.Google Scholar
Statman, R. (1979) The typed lambda-calculus is not elementary recursive. Theoretical Computer Science 9 73–81.CrossRefGoogle Scholar