Lu\'ıs Caires & Frank Pfenning (2010):
Session Types as Intuitionistic Linear Propositions.
In: CONCUR 2010,
LNCS 6269.
Springer,
pp. 222–236,
doi:10.1007/978-3-642-15375-4_16.
Lu\'ıs Caires, Bernardo Toninho & Frank Pfenning (2011):
Dependent Session Types via Intuitionistic Linear Type Theory.
In: PPDP 2011.
ACM Press.
To appear..
Ugo Dal Lago & Patrick Baillot (2006):
On light logics, uniform encodings and polynomial time.
Mathematical Structures in Computer Science 16(4),
pp. 713–733,
doi:10.1017/S0960129506005421.
Ugo Dal Lago & Paolo Di Giamberardino:
Soft Session Types (Long Version).
Available at http://arxiv.org/abs/1107.4478.
Ugo Dal Lago, Simone Martini & Davide Sangiorgi (2010):
Light Logics and Higher-Order Processes.
In: EXPRESS'10,
EPTCS 41,
pp. 46–60,
doi:10.4204/EPTCS.41.4.
Ugo Dal Lago, Andrea Masini & Margherita Zorzi (2010):
Quantum implicit computational complexity.
Theor. Comput. Sci. 411(2),
pp. 377–409,
doi:10.1016/j.tcs.2009.07.045.
Kohei Honda, Vasco Thudichum Vasconcelos & Makoto Kubo (1998):
Language Primitives and Type Discipline for Structured Communication-Based Programming.
In: ESOP,
LNCS 1381,
pp. 122–138,
doi:10.1007/BFb0053567.
Kohei Honda, Nobuko Yoshida & Marco Carbone (2008):
Multiparty asynchronous session types.
In: POPL 2008.
ACM Press,
pp. 273–284,
doi:10.1145/1328438.1328472.
Yves Lafont (2004):
Soft linear logic and polynomial time.
Theor. Comput. Sci. 318(1-2),
pp. 163–180,
doi:10.1016/j.tcs.2003.10.018.
Harry G. Mairson (1992):
A Simple Proof of a Theorem of Statman.
Theor. Comput. Sci. 103(2),
pp. 387–394,
doi:10.1016/0304-3975(92)90020-G.
Dimitris Mostrous & Nobuko Yoshida (2007):
Two Session Typing Systems for Higher-Order Mobile Processes.
In: TLCA 2007,
LNCS 4583,
pp. 321–335,
doi:10.1007/978-3-540-73228-0_23.
Richard Statman (1979):
The Typed lambda-Calculus is not Elementary Recursive.
Theor. Comput. Sci. 9,
pp. 73–81,
doi:10.1016/0304-3975(79)90007-0.
eptcs@eptcs.org