English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Session types model structured communication-based programming. Inparticular, binary session types for the pi-calculus describe communicationbetween exactly two participants in a distributed scenario. Adding sessions tothe pi-calculus means augmenting it with type and term constructs. In aprevious paper, we tried to understand to which extent the session constructsare more complex and expressive than the standard pi-calculus constructs. Thus,we presented an encoding of binary session pi-calculus to the standard typedpi-calculus by adopting linear and variant types and the continuation-passingprinciple. In the present paper, we focus on recursive session types and wepresent an encoding into recursive linear pi-calculus. This encoding is aconservative extension of the former in that it preserves the results thereinobtained. Most importantly, it adopts a new treatment of the duality relation,which in the presence of recursive types has been proven to be quitechallenging.

Recursive Session Types Revisited