2011
DOI: 10.4204/eptcs.64.4
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: We present a type system to guarantee termination of π-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 λ -calculus, … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Most of the results presented in this paper first appeared in Cristescu and Hirschkoff (2011). With respect to that version, we provide here more detailed explanations, as well as proofs, that were omitted in Cristescu and Hirschkoff (2011) due to lack of space. Section 4 has been considerably expanded (in particular, Sections 4.1 and 4.2.2 are new).…”
Section: On the Contents Of This Papermentioning
confidence: 99%
“…Most of the results presented in this paper first appeared in Cristescu and Hirschkoff (2011). With respect to that version, we provide here more detailed explanations, as well as proofs, that were omitted in Cristescu and Hirschkoff (2011) due to lack of space. Section 4 has been considerably expanded (in particular, Sections 4.1 and 4.2.2 are new).…”
Section: On the Contents Of This Papermentioning
confidence: 99%
“…Our type system is based on Milner's sorts for the πcalculus [12], later refined into I/O types [16] and their variants [17]. Based on these types is a system for termination of π-terms [5] that uses a notion of levels, enabling the definition of a lexicographical ordering. Our type system can also be used to determine termination of π-terms in an approximate but conservative way, by composing it with a procedure for deciding termination of depth-bounded systems.…”
Section: Related Workmentioning
confidence: 99%