47 citations · 105 across the 13 of their papers we have counts for
15 papers
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
Patrick Baillot, Ugo Dal Lago, Cynthia Kop +1
The class of type-two basic feasible functionals () is the analogue of (polynomial time functions) for type-2 functionals, that is, functionals that c…
Bunched Fuzz: Sensitivity for Vector Metrics
june wunder, Arthur Azevedo de Amorim, Patrick Baillot +1
Program sensitivity measures the distance between the outputs of a program when run on two related inputs. This notion, which plays a key role in areas such as data privacy and opt…
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes
Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi
We address the problem of analysing the complexity of concurrent programs written in Pi-calculus. We are interested in parallel complexity, or span, understood as the execution tim…
Types for Parallel Complexity in the Pi-calculus
Patrick Baillot, Alexis Ghyselen
Type systems as a way to control or analyze programs have been largely studied in the context of functional programming languages. Some of those work allow to extract from a typing…
An affine-intuitionistic system of types and effects: confluence and termination
Roberto Amadio, Patrick Baillot, Antoine Madet
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs…
An affine-intuitionistic system of types and effects: confluence and termination
Roberto Amadio, Patrick Baillot, Antoine Madet
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs…