论文信息 - Soft Session Types

Soft Session Types

We show how systems of sessions types can enforce interaction to be bounded 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 any reduction sequence starting from it and on the size of any of its reducts.

Ugo Dal Lago | Paolo Di Giamberardino

[1] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[2] Ugo Dal Lago,et al. Light Logics and Higher-Order Processes , 2010 .

[3] A. Kruse. A simple proof of a theorem of Isbell , 1967 .

[4] Ugo Dal Lago,et al. Soft Session Types (Long Version) , 2011, ArXiv.

[5] Ugo Dal Lago,et al. On light logics, uniform encodings and polynomial time , 2006, Math. Struct. Comput. Sci..

[6] Bernardo Toninho,et al. Dependent session types via intuitionistic linear type theory , 2011, PPDP.

[7] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .

[8] Yves Lafont,et al. Soft linear logic and polynomial time , 2004, Theor. Comput. Sci..

[9] Frank Pfenning,et al. Session Types as Intuitionistic Linear Propositions , 2010, CONCUR.

[10] Vasco Thudichum Vasconcelos,et al. Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication , 1998, SecReT@ICALP.

[11] Richard Statman,et al. The Typed lambda-Calculus is not Elementary Recursive , 1979, Theor. Comput. Sci..

[12] Harry G. Mairson. A Simple Proof of a Theorem of Statman , 1992, Theor. Comput. Sci..

[13] Nobuko Yoshida,et al. Two Session Typing Systems for Higher-Order Mobile Processes , 2007, TLCA.

[14] Ugo Dal Lago,et al. Quantum implicit computational complexity , 2010, Theor. Comput. Sci..