3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Integration in Cones
Thomas Ehrhard, Guillaume Geoffroy
Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which accommodates "continuous…
A first-order completeness result about characteristic Boolean algebras in classical realizability
Guillaume Geoffroy
We prove the following completeness result about classical realizability: given any Boolean algebra with at least two elements, there exists a Krivine-style classical realizability…
Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case
Guillaume Geoffroy
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is…
Classical realizability as a classifier for nondeterminism
Guillaume Geoffroy
We show how the language of Krivine's classical realizability may be used to specify various forms of nondeterminism and relate them with properties of realizability models. More s…