Soft Session Types
Logic in Computer Science
2011-08-24 v1 Programming Languages
Abstract
We show how systems of session types can enforce interactions 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.
Keywords
Cite
@article{arxiv.1108.4467,
title = {Soft Session Types},
author = {Ugo Dal Lago and Paolo Di Giamberardino},
journal= {arXiv preprint arXiv:1108.4467},
year = {2011}
}
Comments
In Proceedings EXPRESS 2011, arXiv:1108.4077