Classical realizability as a classifier for nondeterminism. - Guillaume Geoffroy (LICS, 2018)

Preserving cardinals and weak forms of Zorn's lemma in realizability models. - Laura Fontanella; Guillaume Geoffroy (Math. Struct. Comput. Sci., 2020)

A Partial Metric Semantics of Higher-Order Types and Approximate Program Transformations. - Guillaume Geoffroy; Paolo Pistone (CSL, 2021)

Drowsiness Detection Using Joint EEG-ECG Data With Deep Learning. - Guillaume Geoffroy; Lotfi Chaâri; Jean-Yves Tourneret; Herwig Wendt (EUSIPCO, 2021)

Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case. - Guillaume Geoffroy (CoRR, 2021)

A first-order completeness result about characteristic Boolean algebras in classical realizability. - Guillaume Geoffroy (LICS, 2022)

Realizability Models for Large Cardinals. - Laura Fontanella; Guillaume Geoffroy; Richard Matthews (CSL, 2024)

Integration in Cones. - Thomas Ehrhard; Guillaume Geoffroy (Log. Methods Comput. Sci., 2025)