A type checking algorithm for qualified session types

Details A type checking algorithm for qualified session types A type checking algorithm for qualified session types

2011-08-11

arxiv.org/abs/1108.2360v1

EPTCS 61, 2011, pp. 96-114

Computer Science

Programming Languages

In Proceedings WWV 2011, arXiv:1108.2085

Scientific paper

10.4204/EPTCS.61.7

We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session protocols are described by a type constructor that denotes the two ends of one and the same communication channel. We ensure the soundness of the algorithm by showing that processes consuming all linear resources are accepted by a type system preserving typings during the computation and that type checking is consistent w.r.t. structural congruence.

Affiliated with

Also associated with

No associations

Rating

A type checking algorithm for qualified 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 A type checking algorithm for qualified session types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A type checking algorithm for qualified session types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275809