Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Geoffroy, Guillaume"'
Autor:
Ehrhard, Thomas, Geoffroy, Guillaume
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 data types" such as the real line. So far however, they lacked a majo
Externí odkaz:
http://arxiv.org/abs/2212.02371
Autor:
Geoffroy, Guillaume
Publikováno v:
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. pp.1-8
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 model whose characteristic Boolean algebra is elementarily equivalent
Externí odkaz:
http://arxiv.org/abs/2209.08838
Autor:
Geoffroy, Guillaume
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 compatible with integration in a way the models that have been propos
Externí odkaz:
http://arxiv.org/abs/2104.06016
Autor:
Geoffroy, Guillaume
La réalisabilité classique de Jean-Louis Krivine associe à chaque modèle de calcul et chaque modèle de la théorie des ensembles un nouveau modèle de la théorie des ensembles, appelé modèle de réalisabilité, d'une façon similaire au forci
Externí odkaz:
http://www.theses.fr/2019AIXM0099/document
Autor:
Geoffroy, Guillaume
Publikováno v:
ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom
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 specifically, we introduce an abstract notion of multi-evaluation relat
Externí odkaz:
http://arxiv.org/abs/1805.11392
Autor:
Geoffroy, Guillaume, Pistone, Paolo
Publikováno v:
Proceedings of CSL 2021, 29th EACSL Annual Conference on Computer Science Logic
CSL 2021-Computer Science Logic
CSL 2021-Computer Science Logic, Jan 2021, Lubjana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.23⟩
Computer Science Logic, CSL 2021
Computer Science Logic, CSL 2021, Jan 2021, Lubjana, Slovenia
CSL 2021-Computer Science Logic
CSL 2021-Computer Science Logic, Jan 2021, Lubjana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.23⟩
Computer Science Logic, CSL 2021
Computer Science Logic, CSL 2021, Jan 2021, Lubjana, Slovenia
Program semantics is traditionally concerned with program equivalence. However, in fields like approximate, incremental and probabilistic computation, it is often useful to describe to which extent two programs behave in a similar, although non equiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf70662edb9fe07250d9691ffa6bea63
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Geoffroy, Guillaume
Publikováno v:
Modern Power Systems. May2014, Vol. 34 Issue 6, p15-15. 1p.
Publikováno v:
Offshore. Feb2014, Vol. 74 Issue 2, p42-45. 3p.