Activities per year
Abstract
By integrating constructs from the lambda-calculus and the pi-calculus, in higher order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HO pi, the higher-order pi-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HO pi which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. We show that HO can encode HO pi fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session pi-calculus (pi). Overall, under the discipline of session types, HO pi, HO, and pi are equally expressive; however, we show that HO pi is more tightly related to HO than to pi. (C) 2019 Elsevier Inc. All rights reserved.
Original language | English |
---|---|
Article number | 104433 |
Number of pages | 54 |
Journal | Information and Computation |
Volume | 268 |
DOIs | |
Publication status | Published - Oct-2019 |
Keywords
- Concurrency
- Process calculi
- Behavioural types
- Session types
- Expressiveness
- LINEARITY
- CALCULUS
Fingerprint
Dive into the research topics of 'On the relative expressiveness of higher-order session processes'. Together they form a unique fingerprint.Activities
- 1 Academic presentation
-
Session Types and Higher-Order Concurrency
Perez Parra, J. (Invited speaker)
24-Feb-2021Activity: Talk and presentation › Academic presentation › Academic