Joseph W. N. Paulus

Joseph W. N. Paulus

Auto-generated profile, based on publicly available information

Joseph W. N. Paulus

University of Groningen

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 November 2023
Verified
Book Chapter
Closed access
PDF file
BHBas van Den Heuvel
Bas van Den Heuvel
JPJoseph W. N. Paulus
Joseph W. N. Paulus
DNDaniele Nantes-Sobrinho
Daniele Nantes-Sobrinho
JPJorge A. Pérez
Jorge A. Pérez


22 October 2023
Verified
Conference Paper
Open access
JPJoseph W. N. Paulus
Joseph W. N. Paulus
JPJorge A. Pérez
Jorge A. Pérez
DNDaniele Nantes-Sobrinho
Daniele Nantes-Sobrinho
Termination is a central property in sequential programming models: a term is terminating if all its reduction sequences are finite. Termination is also important in concurrency in general, and for message-passing programs in particular. A variety of type systems that enforce termination by typing have been developed. In this paper, we rigorously compare several type systems for π -calculus processes from the unifying perspective of termination. Adopting session types as reference framework, we consider two different type systems: one follows Deng and Sangiorgi’s weight-based approach; the other is Caires and Pfenning’s Curry-Howard correspondence between linear logic and session types. Our technical results precisely connect these very different type systems, and shed light on the classes of client/server interactions they admit as correct.

10 October 2023 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
JPJoseph W. N. Paulus
Joseph W. N. Paulus
DNDaniele Nantes-Sobrinho
Daniele Nantes-Sobrinho
JPJorge A. Pérez
Jorge A. Pérez
We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider lambdafail, a new non-deterministic calculus in which intersection types control resources (terms); on the concurrent side, we consider spi, a pi-calculus in which non-determinism and failure rest upon a Curry-Howard correspondence between linear logic and session types. We present a typed encoding of lambdafail into spi and establish its correctness. Our encoding precisely explains the interplay of non-deterministic and fail-prone evaluation in lambdafail via typed processes in spi. In particular, it shows how failures in sequential evaluation (absence/excess of resources) can be neatly codified as interaction protocols.