Soft Session Types

Details Soft Session Types Soft Session Types

2011-08-23

arxiv.org/abs/1108.4467v1

EPTCS 64, 2011, pp. 59-73

Computer Science

Logic in Computer Science

In Proceedings EXPRESS 2011, arXiv:1108.4077

Scientific paper

10.4204/EPTCS.64.5

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.

Affiliated with

Also associated with

No associations

Rating

Soft Session Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Soft Session Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Soft Session Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66565