9 citations · 13 across the 7 of their papers we have counts for
8 papers
Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
Crubillé Raphaëlle
We establish a connection between two results in the literature on probabilistic semantics: a formulation of De Finetti's theorem in the language of category theory due to Jacobs a…
On Feller Continuity and Full Abstraction (Long Version)
Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago +1
We study the nature of applicative bisimilarity in -calculi endowed with operators for sampling from continuous distributions. On the one hand, we show that bisimilarity, logica…
On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem
Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago +1
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order…
On Higher-Order Cryptography (Long Version)
Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago
Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-…
Probabilistic Stable Functions on Discrete Cones are Power Series (long version)
Raphaëlle Crubillé
We study the category Cstabm of measurable cones and measurable stable functions, which is a denotational model of an higher-order language with continuous probabilities and full r…
Metric Reasoning About -Terms: The General Case (Long Version)
Raphaëlle Crubillé, Ugo Dal Lago
In any setting in which observable properties have a quantitative flavour, it is natural to compare computational objects by way of \emph{metrics} rather than equivalences or parti…
Metric Reasoning about -Terms: the Affine Case (Long Version)
Raphaëlle Crubillé, Ugo Dal Lago
Terms of Church's -calculus can be considered equivalent along many different definitions, but context equivalence is certainly the most direct and universally accepted one. If…
On Probabilistic Applicative Bisimulation and Call-by-Value -Calculi (Long Version)
Raphaelle Crubille, Ugo Dal Lago
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the techni…