@inproceedings{dal_lago_geometry_2019,
title = {The {Geometry} of {Bayesian} {Programming}},
doi = {10/ggdk85},
author = {Dal Lago, Ugo and Hoshino, Naohiko},
month = jun,
year = {2019},
note = {ZSCC: 0000000},
keywords = {Bayesian inference, Denotational semantics, Linear logic, Probabilistic programming, Programming language theory, Rewriting theory, Transition systems},
pages = {1--13}
}
@inproceedings{kerjean_higher-order_2019,
address = {Cham},
series = {Lecture {Notes} in {Computer} {Science}},
title = {Higher-{Order} {Distributions} for {Differential} {Linear} {Logic}},
isbn = {978-3-030-17127-8},
doi = {10/ggdmrj},
abstract = {Linear Logic was introduced as the computational counterpart of the algebraic notion of linearity. Differential Linear Logic refines Linear Logic with a proof-theoretical interpretation of the geometrical process of differentiation. In this article, we construct a polarized model of Differential Linear Logic satisfying computational constraints such as an interpretation for higher-order functions, as well as constraints inherited from physics such as a continuous interpretation for spaces. This extends what was done previously by Kerjean for first order Differential Linear Logic without promotion. Concretely, we follow the previous idea of interpreting the exponential of Differential Linear Logic as a space of higher-order distributions with compact-support, which is constructed as an inductive limit of spaces of distributions on Euclidean spaces. We prove that this exponential is endowed with a co-monadic like structure, with the notable exception that it is functorial only on isomorphisms. Interestingly, as previously argued by Ehrhard, this still allows the interpretation of differential linear logic without promotion.},
language = {en},
booktitle = {Foundations of {Software} {Science} and {Computation} {Structures}},
publisher = {Springer International Publishing},
author = {Kerjean, Marie and Pacaud Lemay, Jean-Simon},
editor = {Bojańczyk, Mikołaj and Simpson, Alex},
year = {2019},
note = {ZSCC: NoCitationData[s1]},
keywords = {Denotational semantics, Differential Linear Logic, Differentiation, Linear logic},
pages = {330--347}
}
@inproceedings{castellan_concurrent_2018,
address = {Oxford, United Kingdom},
title = {The concurrent game semantics of {Probabilistic} {PCF}},
isbn = {978-1-4503-5583-4},
url = {http://dl.acm.org/citation.cfm?doid=3209108.3209187},
doi = {10/ggdjfz},
abstract = {We define a new games model of Probabilistic PCF (PPCF) by enriching thin concurrent games with symmetry, recently introduced by Castellan et al, with probability. This model supports two interpretations of PPCF, one sequential and one parallel. We make the case for this model by exploiting the causal structure of probabilistic concurrent strategies. First, we show that the strategies obtained from PPCF programs have a deadlock-free interaction, and therefore deduce that there is an interpretation-preserving functor from our games to the probabilistic relational model recently proved fully abstract by Ehrhard et al. It follows that our model is intensionally fully abstract. Finally, we propose a definition of probabilistic innocence and prove a finite definability result, leading to a second (independent) proof of full abstraction.},
language = {en},
urldate = {2019-11-26},
booktitle = {Proceedings of the 33rd {Annual} {ACM}/{IEEE} {Symposium} on {Logic} in {Computer} {Science} - {LICS} '18},
publisher = {ACM Press},
author = {Castellan, Simon and Clairambault, Pierre and Paquet, Hugo and Winskel, Glynn},
year = {2018},
note = {ZSCC: 0000018},
keywords = {Denotational semantics, Game semantics, Interactive semantics, Probabilistic programming, Programming language theory},
pages = {215--224}
}
@inproceedings{ehrhard_probabilistic_2014,
address = {San Diego, California, USA},
title = {Probabilistic coherence spaces are fully abstract for probabilistic {PCF}},
isbn = {978-1-4503-2544-8},
url = {http://dl.acm.org/citation.cfm?doid=2535838.2535865},
doi = {10/ggdf9x},
abstract = {Probabilistic coherence spaces (PCoh) yield a semantics of higherorder probabilistic computation, interpreting types as convex sets and programs as power series. We prove that the equality of interpretations in PCoh characterizes the operational indistinguishability of programs in PCF with a random primitive.},
language = {en},
urldate = {2019-11-22},
booktitle = {Proceedings of the 41st {ACM} {SIGPLAN}-{SIGACT} {Symposium} on {Principles} of {Programming} {Languages} - {POPL} '14},
publisher = {ACM Press},
author = {Ehrhard, Thomas and Tasson, Christine and Pagani, Michele},
year = {2014},
note = {ZSCC: 0000060},
keywords = {Coherence spaces, Probabilistic programming, Programming language theory, Semantics},
pages = {309--320}
}
@inproceedings{ehrhard_computational_2011,
address = {Toronto, ON, Canada},
title = {The {Computational} {Meaning} of {Probabilistic} {Coherence} {Spaces}},
isbn = {978-1-4577-0451-2},
url = {http://ieeexplore.ieee.org/document/5970206/},
doi = {10/cpv52n},
abstract = {We study the probabilistic coherent spaces — a denotational semantics interpreting programs by power series with non negative real coefﬁcients. We prove that this semantics is adequate for a probabilistic extension of the untyped λ-calculus: the probability that a term reduces to a head normal form is equal to its denotation computed on a suitable set of values. The result gives, in a probabilistic setting, a quantitative reﬁnement to the adequacy of Scott’s model for untyped λ-calculus.},
language = {en},
urldate = {2019-11-26},
booktitle = {2011 {IEEE} 26th {Annual} {Symposium} on {Logic} in {Computer} {Science}},
publisher = {IEEE},
author = {Ehrhard, Thomas and Pagani, Michele and Tasson, Christine},
month = jun,
year = {2011},
note = {ZSCC: 0000036},
keywords = {Coherence spaces, Denotational semantics, Probabilistic programming, Programming language theory},
pages = {87--96}
}
@inproceedings{danos_probabilistic_2000,
title = {Probabilistic game semantics},
volume = {3},
isbn = {978-0-7695-0725-5},
doi = {10/b6k43s},
abstract = {A category of HO/N-style games and probabilistic strategies is developed where the possible choices of a strategy are quantified so as to give a measure of the likelihood of seeing a given play. A 2-sided die is shown to be universal in this category, in the sense that any strategy breaks down into a composition between some deterministic strategy and that die. The interpretative power of the category is then demonstrated by delineating a Cartesian closed subcategory which provides a fully abstract model of a probabilistic extension of Idealized Algol},
author = {Danos, Vincent and Harmer, Russell},
month = feb,
year = {2000},
note = {ZSCC: NoCitationData[s1]},
keywords = {Denotational semantics, Game semantics, Interactive semantics, Probabilistic programming, Programming language theory},
pages = {204--213}
}
@inproceedings{de_vink_bisimulation_1997,
address = {Berlin, Heidelberg},
series = {Lecture {Notes} in {Computer} {Science}},
title = {Bisimulation for probabilistic transition systems: {A} coalgebraic approach},
isbn = {978-3-540-69194-5},
shorttitle = {Bisimulation for probabilistic transition systems},
doi = {10/fcqzmk},
abstract = {The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendier in terms of a set functor. This coalgebraic formulation makes it possible to generalize the concepts to a continuous setting involving Borel probability measures. Under reasonable conditions, generalized probabilistic bisimilarity can be characterized categorically. Application of the final coalgebra paradigm then yields an internally fully abstract semantical domain with respect to probabilistic bisimulation.},
language = {en},
booktitle = {Automata, {Languages} and {Programming}},
publisher = {Springer},
author = {de Vink, E. P. and Rutten, J. J. M. M.},
editor = {Degano, Pierpaolo and Gorrieri, Roberto and Marchetti-Spaccamela, Alberto},
year = {1997},
note = {ZSCC: NoCitationData[s1]},
keywords = {Categorical probability theory, Coalgebras, Denotational semantics, Probabilistic transition systems, Transition systems},
pages = {460--470}
}
@inproceedings{jones_probabilistic_1989,
address = {Piscataway, NJ, USA},
title = {A {Probabilistic} {Powerdomain} of {Evaluations}},
isbn = {978-0-8186-1954-0},
url = {http://dl.acm.org/citation.cfm?id=77350.77370},
urldate = {2019-11-26},
booktitle = {Proceedings of the {Fourth} {Annual} {Symposium} on {Logic} in {Computer} {Science}},
publisher = {IEEE Press},
author = {Jones, C. and Plotkin, G.},
year = {1989},
note = {ZSCC: 0000389
event-place: Pacific Grove, California, USA},
keywords = {Denotational semantics, Powerdomains, Probabilistic programming, Programming language theory},
pages = {186--195}
}