3 citations · 4 across the 5 of their papers we have counts for
6 papers
Typed Non-determinism in Concurrent Calculi: The Eager Way
Bas van den Heuvel, Daniele Nantes-Sobrinho, Joseph W. N. Paulus +1
We consider the problem of designing typed concurrent calculi with non-deterministic choice in which types leverage linearity for controlling resources, thereby ensuring strong cor…
On the Expressivity of Typed Concurrent Calculi
Joseph William Neal Paulus
This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (seque…
Termination in Concurrency, Revisited
Joseph W. N. Paulus, Jorge A. Pérez, 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…
Typed Non-determinism in Functional and Concurrent Calculi
Bas van den Heuvel, Joseph W. N. Paulus, Daniele Nantes-Sobrinho +1
We study functional and concurrent calculi with non-determinism, along with type systems to control resources based on linearity. The interplay between non-determinism and linearit…
Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version)
Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez
Type-preserving translations are effective rigorous tools in the study of core programming calculi. In this paper, we develop a new typed translation that connects sequential and c…
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
Joseph W. N. Paulus, Daniele Nantes-Sobrinho, 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,…