A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Parallel Complexity Analysis with Temporal Session Types
[article]
2018
arXiv
pre-print
We study the problem of parametric parallel complexity analysis of concurrent, message-passing programs. To make the analysis local and compositional, it is based on a conservative extension of binary session types, which structure the type and direction of communication between processes and stand in a Curry-Howard correspondence with intuitionistic linear logic. The main innovation is to enrich session types with the temporal modalities next ( A), always ( A), and eventually ( A), to
arXiv:1804.06013v1
fatcat:ajqgodmbejbbnbnbx2sua6rdhi