Chargé de recherche
INRIA Paris hugo.paquet@inria.fr
I am a researcher at INRIA, member of the
ANTIQUE team at
École Normale Supérieure in Paris.
I am interested in topics related to programming language
theory. My research is about:
Probabilistic programming
for statistical modelling: semantics,
inference algorithms, nonparametric models.
Categorical semantics
and foundations: game semantics,
models of concurrency, adjunction models,
2-dimensional categories, combinatorial
species.
Before starting my current position in October 2024, I was a
postdoc at
LIPN,
funded by a Marie Skłodowska-Curie Award under the
Paris Region
Fellowship Programme. Before that, I was a postdoc in
Oxford
with Sam
Staton (2020-2022)
and Luke
Ong (2019-2020). Before that (2015-2019) I
was a PhD student
withGlynn
Winskel in Cambridge.
Publications and
preprints
Victor
Blanchi
and
Hugo
Paquet.Element-Free
Probability
Distributions
and
Random
Partitions.
Proceedings
of
the
Thirty-Ninth
Annual
ACM/IEEE
Symposium
on
Logic
in
Computer
Science
(LICS),
2024. [doi][arxiv]
Hugo
Paquet
and
Philip
Saville.Effectful
Semantics
in
Bicategories:
Strong,
Commutative,
and
Concurrent
Pseudomonads.
Proceedings
of
the
Thirty-Ninth
Annual
ACM/IEEE
Symposium
on
Logic
in
Computer
Science
(LICS),
2024. [doi][arxiv]
Marcelo
Fiore,
Zeinab
Galal,
and
Hugo
Paquet.Stabilized
profunctors
and
stable
species
of
structures. Logical
Methods
in
Computer
Science,
2024. (Special
Issue
for
FSCD
2022.) [doi]
Pierre
Clairambault,
Federico Olimpieri,
and Hugo
Paquet.From
Thin
Concurrent
Games
to
Generalized
Species
of
Structures. 38th
Annual
ACM/IEEE
Symposium
on
Logic
in
Computer
Science
(LICS),
2023. (Selected
for
the
LMCS
special
issue.) [doi][extended version]
Swaraj
Dash,
Younesse
Kaddar,
Hugo
Paquet,
and
Sam
Staton.Affine
Monads
and
Lazy
Structures
for
Bayesian
Programming. Proceedings
of
the
ACM
on
Programming
Languages
(POPL),
2023. [doi][arxiv]
Hugo
Paquet
and
Philip
Saville.Effectful
Semantics
in
2-Dimensional
Categories:
Premonoidal
and
Freyd
Bicategories. Electronic
Proceedings
in
Theoretical
Computer
Science,
Sixth
International
Conference
on
Applied
Category
Theory
(ACT),
2023. [doi]
Marcelo
Fiore,
Zeinab
Galal,
and
Hugo
Paquet.A
Combinatorial
Approach
to
Higher-Order
Structure
for
Polynomial
Functors. 7th
International
Conference
on
Formal
Structures
for
Computation
and
Deduction
(FSCD),
2022. (Selected
for
the
LMCS
special
issue.) [doi]
Hugo
Paquet.Bi-invariance
for
Uniform Strategies on
Event
Structures. Proceedings
of
the 38th Conference
on
Mathematical
Foundations of
Programming
Semantics (MFPS),
2022. [doi][arxiv]
Carol
Mak,
C.-H. Luke
Ong,
Hugo
Paquet,
and
Dominik
Wagner.Densities
of
Almost-Surely
Terminating
Probabilistic
Programs
are
Differentiable
Almost
Everywhere. Programming
Languages
and
Systems
-
28th
European
Symposium
on
Programming
(ESOP),
2021. [doi][arxiv]
Hugo
Paquet.Bayesian
Strategies:
Probabilistic
Programs as
Generalised
Graphical
Models. Programming
Languages
and Systems - 28th
European
Symposium
on Programming
(ESOP),
2021. [doi][pdf]
Simon
Castellan
and
Hugo
Paquet.Probabilistic
Programming
Inference
via
Intensional
Semantics. Programming
Languages
and
Systems
-
26th
European
Symposium
on
Programming
(ESOP),
2019. [doi][pdf]
Pierre
Clairambault
and
Hugo
Paquet.Fully
Abstract
Models of the
Probabilistic
lambda-calculus. 27th
EACSL
Annual
Conference
on Computer
Science
Logic (CSL),
2018. [doi][pdf]
Simon
Castellan,
Pierre Clairambault,
Hugo Paquet, and
Glynn
Winskel.The
Concurrent
Game Semantics of
Probabilistic
PCF. 37th
Annual
ACM/IEEE Symposium on
Logic in
Computer
Science (LICS),
2018. [doi][pdf]
Hugo
Paquet
and
Glynn
Winskel.Continuous
Probability
Distributions
in
Concurrent
Games. Proceedings
of
the
Thirty-Fourth
Conference
on
the
Mathematical
Foundations
of
Programming
Semantics
(MFPS),
2018. [doi][pdf]
Alessio
Lomuscio
and Hugo
Paquet.Verification
of
Multi-Agent Systems
via SDD-based Model
Checking
(Extended
Abstract). AAMAS
2015. [doi]
Thesis
My thesis
is about a
theory of games
for semantics
known
as
concurrent
games, based on
event
structures.
The
main
contribution is
a cartesian
closed
bicategory of
probabilistic
strategies,
which gives a
semantics for
languages
with continuous
distributions. The
manuscript is
available
here.