Soft Session Types

Abstract : 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.
Document type :
Reports
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00616388
Contributor : Paolo Di Giamberardino <>
Submitted on : Monday, August 22, 2011 - 1:52:28 PM
Last modification on : Tuesday, February 5, 2019 - 3:12:17 PM
Long-term archiving on : Monday, November 12, 2012 - 3:42:11 PM

File

SOSE.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00616388, version 1

Citation

Ugo Dal Lago, Paolo Di Giamberardino. Soft Session Types. 2011. ⟨hal-00616388v1⟩

Share

Metrics

Record views

5

Files downloads

1