activity
20202026
most citedDensities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere

12 citations · 16 across the 8 of their papers we have counts for

collaborators

11 papers

cs.LO2026

Concurrent Strategies as Street Fibrations

Hugo Paquet, Glynn Winskel

Concurrent games and strategies based on event structures are an established and expressive model of interactive computation. In this paper we revisit the problem of equipping this…

cs.LO2026

Universal Properties of Petri Net Unfoldings

Serge Lechenne, Hugo Paquet

It is an established idea in concurrency theory that every Petri net admits an unfolding semantics. This is a denotational object that represents its domain of possible executions.…

cs.LO2024

Element-Free Probability Distributions and Random Partitions

Victor Blanchi, Hugo Paquet

An "element-free" probability distribution is what remains of a probability distribution after we forget the elements to which the probabilities were assigned. These objects natura…

cs.LO2023★ 2 cited

Effectful Semantics in 2-Dimensional Categories: Premonoidal and Freyd Bicategories

Hugo Paquet, Philip Saville

Premonoidal categories and Freyd categories provide an encompassing framework for the semantics of call-by-value programming languages. Premonoidal categories are a weakening of mo…

cs.LO2023★ 1 cited

Effectful Semantics in Bicategories: Strong, Commutative, and Concurrent Pseudomonads

Hugo Paquet, Philip Saville

We develop the theory of strong and commutative monads in the 2-dimensional setting of bicategories. This provides a framework for the analysis of effects in many recent models whi…

cs.LO2023

Stabilized profunctors and stable species of structures

Marcelo Fiore, Zeinab Galal, Hugo Paquet

We introduce a bicategorical model of linear logic which is a novel variation of the bicategory of groupoids, profunctors, and natural transformations. Our model is obtained by end…

cs.LO2023

From Thin Concurrent Games to Generalized Species of Structures (Extended Version)

Pierre Clairambault, Federico Olimpieri, Hugo Paquet

Two families of denotational models have emerged from the semantic analysis of linear logic: dynamic models, typically presented as game semantics, and static models, typically bas…

cs.PL2022

Affine Monads and Lazy Structures for Bayesian Programming

Swaraj Dash, Younesse Kaddar, Hugo Paquet +1

We show that streams and lazy data structures are a natural idiom for programming with infinite-dimensional Bayesian methods such as Poisson processes, Gaussian processes, jump pro…

cs.LO2022★ 1 cited

Bi-invariance for Uniform Strategies on Event Structures

Hugo Paquet

A recurring problem in game semantics is to enforce uniformity in strategies. Informally, a strategy is uniform when the Player's behaviour does not depend on the particular indexi…

cs.LO2021

The Quantitative Collapse of Concurrent Games with Symmetry

Pierre Clairambault, Hugo Paquet

We explore links between the thin concurrent games of Castellan, Clairambault and Winskel, and the weighted relational models of linear logic studied by Laird, Manzonetto, McCusker…

cs.LO2020★ 12 cited

Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere

Carol Mak, C. -H. Luke Ong, Hugo Paquet +1

We study the differential properties of higher-order statistical probabilistic programs with recursion and conditioning. Our starting point is an open problem posed by Hongseok Yan…