Termination in a Pi-calculus with Subtyping

Details Termination in a Pi-calculus with Subtyping Termination in a Pi-calculus with Subtyping

2011-07-28

arxiv.org/abs/1107.5722v3

18th International Workshop on Expressiveness in Concurrency, Aachen : Germany (2011)

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.64.4

We present a type system to guarantee termination of pi-calculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. We show that our system improves over previously existing proposals by accepting more processes as terminating. This increased expressiveness allows us to capture sensible programming idioms. We demonstrate how our system can be extended to handle the encoding of the simply typed lambda-calculus, and discuss questions related to type inference.

Affiliated with

Also associated with

No associations

Rating

Termination in a Pi-calculus with Subtyping 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 Termination in a Pi-calculus with Subtyping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Termination in a Pi-calculus with Subtyping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414292