Hugo Paquet

Biography

I am a research associate, working with Sam Staton on the foundations of probabilistic programming. More broadly I am interested in the semantics of programming languages and logics, including categorical models, denotational semantics and game semantics. 

Until May 2020 I was an RA with Luke Ong, and before that (2015-2019) I was a PhD student with Glynn Winskel in the Computer Lab at the University of Cambridge, working on probabilistic concurrent game semantics. [thesis pdf] 

Selected Publications

View AllManage publications

• Probabilistic Programming Inference via Intensional Semantics

  Simon Castellan and Hugo Paquet

  In Programming Languages and Systems − 28th European Symposium on Programming‚ ESOP 2019‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2019‚ Prague‚ Czech Republic‚ April 6−11‚ 2019‚ Proceedings. Pages 322–349. 2019.

  Details about Probabilistic Programming Inference via Intensional Semantics | BibTeX data for Probabilistic Programming Inference via Intensional Semantics | DOI (10.1007/978-3-030-17184-1\_12) | Link to Probabilistic Programming Inference via Intensional Semantics

• Continuous Probability Distributions in Concurrent Games

  Hugo Paquet and Glynn Winskel

  In Electr. Notes Theor. Comput. Sci.. Vol. 341. Pages 321–344. 2018.

  Details about Continuous Probability Distributions in Concurrent Games | BibTeX data for Continuous Probability Distributions in Concurrent Games | DOI (10.1016/j.entcs.2018.11.016) | Link to Continuous Probability Distributions in Concurrent Games

• Fully Abstract Models of the Probabilistic lambda−calculus

  Pierre Clairambault and Hugo Paquet

  In 27th EACSL Annual Conference on Computer Science Logic‚ CSL 2018‚ September 4−7‚ 2018‚ Birmingham‚ UK. Pages 16:1–16:17. 2018.

  Details about Fully Abstract Models of the Probabilistic lambda−calculus | BibTeX data for Fully Abstract Models of the Probabilistic lambda−calculus | DOI (10.4230/LIPIcs.CSL.2018.16) | Link to Fully Abstract Models of the Probabilistic lambda−calculus