Fetching the paper…
Reading the bibliography…
Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory.
B. de Finetti, ‘‘La prévision : ses lois logiques, ses sources subjectives,’’
1937
Earlier work this paper cites.
E. Hewitt and L. J. Savage, ‘‘Symmetric measures on cartesian products,’’
1955
Earlier work this paper cites.
R. J. Aumann, ‘‘Borel structures for function spaces,’’
1961
Earlier work this paper cites.
E. Spanier, ‘‘Quasi-topologies,’’
1963
Earlier work this paper cites.
N. E. Steenrod, ‘‘A convenient category of topological spaces,’’
1967
Earlier work this paper cites.
J. C. Reynolds, ‘‘Definitional interpreters for higher-order programming languages,’’ in
1972
Earlier work this paper cites.
R. Street, ‘‘The formal theory of monads,’’
1972
Earlier work this paper cites.
E. J. Dubuc, ‘‘Concrete quasitopoi,’’ in
1977
Earlier work this paper cites.
L. E. Dubins and D. A. Freedman, ‘‘Exchangeable processes need not be mixtures of independent, identically distributed random variables,’’
1979
Earlier work this paper cites.
P. Johnstone, ‘‘On a topological topos,’’
1979
Earlier work this paper cites.
M. Giry, ‘‘A categorical approach to probability theory,’’ in
1982
Earlier work this paper cites.
C. Jones and G. D. Plotkin, ‘‘A probabilistic powerdomain of evaluations,’’ in
1989
Earlier work this paper cites.
E. Moggi, ‘‘Notions of computation and monads,’’
1991
Earlier work this paper cites.
A. Jung and R. Tix, ‘‘The troublesome probabilistic powerdomain,’’ ser. ENTCS, vol. 13, 1998, pp. 70--91
1998
Cited alongside, same era.
G. Rosolini and T. Streicher, ‘‘Comparing models of higher type computation,’’ ser. ENTCS, vol. 23, 1999
1999
Cited alongside, same era.
O. Kallenberg,
2002
Cited alongside, same era.
I. Battenfeld, M. Schröder, and A. Simpson, ‘‘A convenient category of domains,’’ ser. ENTCS, vol. 172, 2007
2007
Cited alongside, same era.
T. Ehrhard, ‘‘On finiteness spaces and extensional presheaves over the Lawvere theory of polynomials,’’
2007
Cited alongside, same era.
N. Goodman, V. Mansinghka, D. M. Roy, K. Bonawitz, and J. B. Tenenbaum, ‘‘Church: a language for generative models,’’ in
2008
T. Ehrhard, C. Tasson, and M. Pagani, ‘‘Probabilistic coherence spaces are fully abstract for probabilistic PCF,’’ in
2014
Later among the works it cites.
2014
Later among the works it cites.
M. W. Mislove, ‘‘Anatomy of a domain of continuous random variables I,’’
2014
Later among the works it cites.
D. S. Scott, ‘‘Stochastic
2014
Later among the works it cites.
F. Wood, J. W. van de Meent, and V. Mansinghka, ‘‘A new approach to probabilistic programming inference,’’ in
2014
Later among the works it cites.
T. Barker, ‘‘A monad for randomized algorithms,’’ in
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
2008
Cited alongside, same era.
M. H. Escardó, ‘‘Semi-decidability of may, must and probabilistic testing in a higher-type setting,’’ in
2009
Cited alongside, same era.
J. Goubault-Larrecq, ‘‘
2010
Cited alongside, same era.
J. C. Baez and A. E. Hoffnung, ‘‘Convenient categories of smooth spaces,’’
2011
Cited alongside, same era.
C. E. Freer and D. M. Roy, ‘‘Computable de Finetti measures,’’
2012
Cited alongside, same era.
T. Austin, ‘‘Exchangeable random arrays,’’ 2013. [Online]. Available: https://cims.nyu.edu/~tim/ExchnotesforIISc.pdf
2013
Cited alongside, same era.
2016
Later among the works it cites.
J. Borgström, U. Dal Lago, A. D. Gordon, and M. Szymczak, ‘‘A lambda-calculus foundation for universal probabilistic programming,’’ in
2016
Later among the works it cites.
D. Huang and G. Morrisett, ‘‘An application of computable distributions to the semantics of probabilistic programs: part 2.’’ [Online]. Available: http://pps2017.soic.indiana.edu/files/2016/12/comp-dist-sem.pdf
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Simpson, ‘‘Probability sheaves,’’ 2016, CIPPMI. [Online]. Available: https://synapse.math.univ-toulouse.fr/index.php/s/QWrxKeXn31mN3gz
2016
Later among the works it cites.
S. Staton, H. Yang, C. Heunen, O. Kammar, and F. Wood, ‘‘Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints,’’ in
2016
Later among the works it cites.
R. Culpepper and A. Cobb, ‘‘Contextual equivalence for probabilistic programs with continuous random variables and scoring,’’ in
2017
Closest in time.