Fetching the paper…
Reading the bibliography…
Imprecise probability is concerned with uncertainty about which probability distributions to use.
Risk, uncertainty and profit
F. H. Knight. 1921 · 1921
Earlier work this paper cites.
On closed categories of functors. In Proc. Midwest Category Seminar IV (Lect. Notes Math., Vol. 137) . Springer
B. Day. 1969 · 1969
Earlier work this paper cites.
Monads on symmetric monoidal closed categories
A. Kock. 1970 · 1970
Earlier work this paper cites.
Bilinearity and cartesian closed monads
A. Kock. 1971 · 1971
Earlier work this paper cites.
Strong Functors and Monoidal Monads
A. Kock. 1972 · 1972
Earlier work this paper cites.
Indical methods for relative categories
R. Wood. 1976 · 1976
Earlier work this paper cites.
Robust statistics
P. J. Huber. 1981 · 1981
Earlier work this paper cites.
Basic Concepts of Enriched Category Theory
G. M. Kelly. 1982 · 1982
Earlier work this paper cites.
A probabilistic powerdomain of evaluations. In Fourth Annual Symposium on Logic in Computer Science . 186–195
C. Jones and G. D. Plotkin. 1989 · 1989
Earlier work this paper cites.
Computational Lambda-Calculus and Monads. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science (Pacific Grove, California, USA). IEEE Press, 14–23
E. Moggi. 1989 · 1989
Earlier work this paper cites.
Notions of computation and monads
E. Moggi. 1991 · 1991
Earlier work this paper cites.
Statistical Reasoning with Imprecise Probabilities
P. Walley. 1991 · 1991
Earlier work this paper cites.
Introduction to extensive and distributive categories
A. Carboni, S. Lack, and R. F. C. Walters. 1993 · 1993
Earlier work this paper cites.
Introduction to distributive categories
J. R. B. Cockett. 1993 · 1993
Earlier work this paper cites.
Flow models of distributed computations: three equivalent semantics for CCS
G. Boudol and I. Castellani. 1994 · 1994
Earlier work this paper cites.
Semantics of weakening and contraction
B. Jacobs. 1994 · 1994
Earlier work this paper cites.
Monad transformers and modular interpreters. In Proc. POPL 1995
S. Liang, P. Hudak, and M. Jones. 1995 · 1995
Earlier work this paper cites.
A Theory of Recursive Domains with Applications to Concurrency. In Proc. LICS 1998
G. L. Cattani, M. P. Fiore, and G. Winskel. 1998 · 1998
Earlier work this paper cites.
Categories for the Working Mathematician
S. Mac Lane. 1998 · 1998
Earlier work this paper cites.
Partial correctness for probabilistic demonic programs
A. K. McIver and C. Morgan. 2001 · 2001
Earlier work this paper cites.
Notions of Computation Determine Monads. In Proc. FOSSACS 2002
G. D. Plotkin and J. Power. 2002 · 2002
Earlier work this paper cites.
Constructing Probability Boxes and Dempster-Shafer Structures
S. Ferson, V. Kreinovick, L. Ginzburg, D. S. Myers, and K. Sentz. 2003 · 2003
Earlier work this paper cites.
Modelling environments in call-by-value programming languages
P. B. Levy, J. Power, and H. Thielecke. 2003 · 2003
Earlier work this paper cites.
Axioms for Probability and Nondeterminism. In Proc. EXPRESS 2003
M. W. Mislove, J. Ouaknine, and J. Worrell. 2003 · 2003
Earlier work this paper cites.
Algebraic operations and generic effects
G. Plotkin and J. Power. 2003 · 2003
Earlier work this paper cites.
Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism. In MFPS 2005
K. Keimel. 2005 · 2005
Earlier work this paper cites.
Abstraction, Refinement and Proof for Probabilistic Systems
A. McIver and C. Morgan. 2005 · 2005
Earlier work this paper cites.
Generic models for computational effects
J. Power. 2006 · 2006
Earlier work this paper cites.
Distributing probability over non-determinism
D. Varacca and G. Winskel. 2006 · 2006
Earlier work this paper cites.
When an Event Makes a Difference
M. Amarante and F. Maccheroni. 2007 · 2007
Earlier work this paper cites.
Continuous previsions. In Proc. CSL 2007
J. Goubault-Larrecq. 2007 · 2007
Earlier work this paper cites.
Amb Breaks Well-Pointedness, Ground Amb Doesn’t. In Proc. MFPS 2007
P. B. Levy. 2007 · 2007
Earlier work this paper cites.
Financial Risk Measurement with Imprecise Probabilities
P. Vicig. 2008 · 2007
Earlier work this paper cites.
Prevision Domains and Convex Powercones. In Proc. FOSSACS 2008
J. Goubault-Larrecq. 2008 · 2008
Earlier work this paper cites.
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems. In Proc. CMCS 2008
B. Jacobs. 2008 · 2008
Earlier work this paper cites.
Arrows are Strong Monads. In Proc. MSFP 2010
K. Asada. 2010 · 2010
Earlier work this paper cites.
Strong relative monads. In Proc. CMCS 2010
T. Uustalu. 2010 · 2010
Earlier work this paper cites.
Nonlinear dynamics in economics and finance and unit root testing
E. Pavlidis, I. Paya, D. Peel, and C. Siriopoulos. 2011 · 2011
Earlier work this paper cites.
Monoidal indeterminates and categories of possible worlds
C. Hermida and R. Tennent. 2012 · 2012
Earlier work this paper cites.
Algebraic foundations for effect-dependent optimisations. In Proc. POPL 2012 . 349–360
O. Kammar and G. D. Plotkin. 2012 · 2012
Cited alongside, same era.
Commutative monads as a theory of distributions
A. Kock. 2012 · 2012
Cited alongside, same era.
Static Analysis of Programs with Imprecise Probabilistic Inputs. In Proc. VSTTE 2013 . 22–47
A. Adjé, O. Bouissou, J. Goubault-Larrecq, E. Goubault, and S. Putot. 2013 · 2013
Cited alongside, same era.
Weighted Relational Models of Typed Lambda-Calculi. In Proc. LICS 2013
J. Laird, G. Manzonetto, G. McCusker, and M. Pagani. 2013 · 2013
Cited alongside, same era.
Nominal Sets: names and symmetry in computer science
A. M. Pitts. 2013 · 2013
Cited alongside, same era.
Revisiting the categorical interpretation of dependent type theory
P.-L. Curien, R. Garner, and M. Hofmann. 2014 · 2014
Inframeasures and domain theory
A. Appel and V. Kosoy. 2021 · 2021
Later among the works it cites.
Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases. In Proc. CALCO 2021
F. Bonchi, A. Sokolova, and V. Vignudelli. 2021 · 2021
Later among the works it cites.
Monads for Measurable Queries in Probabilistic Databases. In Proc. MFPS 2021
S. Dash and S. Staton. 2021 · 2021
Later among the works it cites.
Backprop as Functor: A Compositional Perspective on Supervised Learning. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (Vancouver, Canada) (LICS ’19) . IEEE Press, Article 11, 13 pages
B. Fong, D. Spivak, and R. Tuyéras. 2021 · 2021
Later among the works it cites.
Graded Hoare logic and its categorical semantics. In Proc. ESOP 2021
M. Gaboardi, S. Katsumata, D. Orchard, and T. Sato. 2021 · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Parametric effect monads and semantics of effect systems. In Proc. POPL 2014
S. Katsumata. 2014 · 2014
Cited alongside, same era.
Upper-Expectation Bisimilarity and Łukasiewicz mu-Calculus. In Proc. FoSSaCS 2014
M. Mio. 2014 · 2014
Cited alongside, same era.
Monads need not be endofunctors
T. Altenkirch, J. Chapman, and T. Uustalu. 2015 · 2015
Cited alongside, same era.
Self-Confirming Equilibrium and Model Uncertainty
P. Battigalli, S. Cerreia-Vioglio, F. Maccheroni, and M. Marinacci. 2015 · 2015
Cited alongside, same era.
Diagrammatic Reasoning about Probability and Nondeterminism. In Proc. PPS 2016
F. Abou-Saleh, K.-H. Cheung, and J. Gibbons. 2016 · 2016
Cited alongside, same era.
A Monad for Randomized Algorithms. In Proc. MFPS 2016
T. Barker. 2016 · 2016
Cited alongside, same era.
From multisets over distributions to distributions over multisets. In Proc. LICS 2021
B. Jacobs. 2021 · 2021
Later among the works it cites.
Commutative Monads for Probabilistic Programming Languages. In Proc. LICS 2021 . 1–14
X. Jia, B. Lindenhovius, M. W. Mislove, and V. Zamdzhiev. 2021 · 2021
Later among the works it cites.
Infra-Bayesian physicalism: A formal theory of naturalized induction
V. Kosoy and A. Appel. 2021 · 2021
Later among the works it cites.
Introduction to Imprecise Probabilities
D. Krpelík and T. Basu. 2021 · 2021
Later among the works it cites.
Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. In Proc. LICS 2021
M. Mio, R. Sarkis, and V. Vignudelli. 2021 · 2021
Later among the works it cites.
Semialgebras and Weak Distributive Laws. In Proc. MFPS 2021
D. Petrisan and R. Sarkis. 2021 · 2021
Later among the works it cites.
Categorical Stochastic Processes and Likelihood
D. Shiebler. 2021 · 2021
Later among the works it cites.
Compositional Semantics for Probabilistic Programs with Exact Conditioning. In Proc. LICS 2021
D. Stein and S. Staton. 2021 · 2021
Later among the works it cites.
A language for counterfactual generative models. In Proc. ICML 2021 . 10173–10182
Z. Tavares, J. Koppel, X. Zhang, R. Das, and A. Solar-Lezama. 2021 · 2021
Later among the works it cites.
Optimization Under Uncertainty with Applications to Aerospace Engineering
M. Vasile. 2021 · 2021
Later among the works it cites.
Uncertainty in Engineering Introduction to Methods and Applications: Introduction to Methods and Applications
L. Aslett, F. Coolen, and J. Bock. 2022 · 2022
Later among the works it cites.
Flexibly Graded Monads and Graded Algebras. In Proc. MPC 2022
D. McDermott and T. Uustalu. 2022 · 2022
Later among the works it cites.
The Compositional Structure of Bayesian Inference. In Proc. MFCS 2023
D. Braithwaite, J. Hedges, and T. St Clere Smithe. 2023 · 2023
Later among the works it cites.
Dynamic Opinion Aggregation: Long-run Stability and Disagreement
S. Cerreia-Vioglio, R. Corrao, and G. Lanzani. 2023 · 2023
Later among the works it cites.
Affine monads and lazy structures for Bayesian programming. In Proc. POPL 2023
S. Dash, Y. Kaddar, H. Paquet, and S. Staton. 2023 · 2023
Later among the works it cites.
Evidential Decision Theory via Partial Markov Categories. In Proc. LICS 2023
E. Di Lavore and M. Román. 2023 · 2023
Later among the works it cites.
Structured Probabilistic Reasoning
B. Jacobs. 2023 · 2023
Later among the works it cites.
D. Kozen and A. Silva. 2023 · 2023
Later among the works it cites.
Markov Categories and Entropy
P. Perrone. 2023 · 2023
Later among the works it cites.
Conformal prediction under ambiguous ground truth
D. Stutz, A. G. Roy, T. Matejovicova, P. Strachan, A. T. Cemgil, and A. Doucet. 2023 · 2023
Later among the works it cites.
Diverse Projection Ensembles for Distributional Reinforcement Learning
M. A. Zanger, W. Böhmer, and M. T. J. Spaan. 2023 · 2023
Later among the works it cites.
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets.. In Proc. POPL 2024
N. Ackerman, C. Freer, Y. Kaddar, J. Karwowski, S. Moss, D. Roy, S. Staton, and H. Yang. 2024 · 2024
Closest in time.
M. Caprio, S. Dutta, K. J. Jang, V. Lin, R. Ivanov, O. Sokolsky, and I. Lee. 2024 · 2024
Closest in time.
A Monadic Theory of Point Processes
S. Dash. 2024 · 2024
Closest in time.
Safeguarded AI: constructing safety by design
D. ‘davidad’ Dalrymple. 2024 · 2024
Closest in time.
Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems
D. ‘davidad’ Dalrymple, J. Skalse, Y. Bengio, S. Russell, M. Tegmark, S. Seshia, S. Omohundro, C. Szegedy, B. Goldhaber, N. Ammann, A. Abate, J. Halpern, C. Barrett, D. Zhao, T. Zhi-Xuan, J. Wing, and J. Tenenbaum. 2024 · 2024
Closest in time.
A Cartesian Closed Category for Random Variables. In Proc. LICS 2024
P. Di Gianantonio and A. Edalat. 2024 · 2024
Closest in time.
Fundamental Components of Deep Learning: A category-theoretic approach
B. Gavranovic. 2024 · 2024
Closest in time.
Conformalized Credal Set Predictors
A. Javanmardi, D. Stutz, and E. Hüllermeier. 2024 · 2024
Closest in time.
A Nominal Approach to Probabilistic Separation Logic. In Proc. LICS 2024
J. Li, J. Aytac, P. Johnson-Freyd, A. Ahmed, and S. Holtzen. 2024 · 2024
Closest in time.
Epistemic Monte Carlo Tree Search
Y. Oren, V. Vadocz, M. T. J. Spaan, and W. Böhmer. 2024 · 2024
Closest in time.
Equivalence and Conditional Independence in Atomic Sheaf Logic. In Proc. LICS 2024
A. Simpson. 2024 · 2024
Closest in time.
A Categorical Treatment of Open Linear Systems
D. Stein and R. Samuelson. 2024 · 2024
Closest in time.
Eckmann-Hilton argument
Various authors. 2024 · 2024
Closest in time.