On the public citation graph

A domain theory for statistical probabilistic programming

https://doi.org/10.1145/3290349
0 signed · 65 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1996.0052openalex-snapshot
Relational Properties of Domains
inferredcites →https://doi.org/10.1007/978-3-319-29604-3_5openalex-snapshot
Probabilistic Inference by Program Transformation in Hakaru (System Description)
inferredcites →https://doi.org/10.1007/978-3-642-03034-5_17openalex-snapshot
Embedded Probabilistic Programming
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_32openalex-snapshot
Commutative Semantics for Probabilistic Programming
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(80)90003-1openalex-snapshot
Cpo's of measures for nondeterminism
inferredcites →https://doi.org/10.1016/0304-3975(93)90095-bopenalex-snapshot
A type-theoretical alternative to ISWIM, CUCH, OWHY
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.004openalex-snapshot
A Convenient Category of Domains
inferredcites →https://doi.org/10.1016/j.entcs.2016.09.031openalex-snapshot
A Monad for Randomized Algorithms
inferredcites →https://doi.org/10.1016/s1571-0661(05)80216-6openalex-snapshot
The Troublesome Probabilistic Powerdomain
inferredcites →https://doi.org/10.1017/cbo9780511600579openalex-snapshot
Locally Presentable and Accessible Categories
inferredcites →https://doi.org/10.1017/s0960129509007555openalex-snapshot
Predicate transformers for extended probability and non-determinism
inferredcites →https://doi.org/10.1109/lics.1994.316083openalex-snapshot
An axiomatisation of computationally adequate domain theoretic models of FPC
inferredcites →https://doi.org/10.1109/lics.2011.23openalex-snapshot
Continuous Random Variables
inferredcites →https://doi.org/10.1109/lics.2011.49openalex-snapshot
Noncomputable Conditional Distributions
inferredcites →https://doi.org/10.1109/lics.2017.8005137openalex-snapshot
A convenient category for higher-order probability theory
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/2103656.2103698openalex-snapshot
Algebraic foundations for effect-dependent optimisations
inferredcites →https://doi.org/10.1145/2933575.2935313openalex-snapshot
Semantics for probabilistic programming
inferredcites →https://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.1145/2951913.2951942openalex-snapshot
A lambda-calculus foundation for universal probabilistic programming
inferredcites →https://doi.org/10.1145/3009837.3009852openalex-snapshot
Exact Bayesian inference by symbolic disintegration
inferredcites →https://doi.org/10.1145/3158147openalex-snapshot
Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming
inferredcites →https://doi.org/10.1145/3158148openalex-snapshot
Denotational validation of higher-order Bayesian inference
inferredcites →https://doi.org/10.1145/3209108.3209175openalex-snapshot
Boolean-Valued Semantics for the Stochastic λ-Calculus

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_18openalex-snapshot
Fooling the Parallel or Tester with Probability 8/27
inferred← citeshttps://doi.org/10.1007/978-3-030-55089-9_3openalex-snapshot
Weakest Preexpectation Semantics for Bayesian Inference
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_15openalex-snapshot
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_16openalex-snapshot
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_19openalex-snapshot
Bayesian strategies: probabilistic programs as generalised graphical models
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_28openalex-snapshot
(Towards a) Statistical Probabilistic Lazy Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_18openalex-snapshot
Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_20openalex-snapshot
Automatic Alignment in Higher-Order Probabilistic Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_15openalex-snapshot
A Category-Theoretic Framework for Dependent Effect Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.007openalex-snapshot
On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.016openalex-snapshot
A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.029openalex-snapshot
Whither semantics?
inferred← citeshttps://doi.org/10.1017/s0960129521000396openalex-snapshot
The geometry of Bayesian programming
inferred← citeshttps://doi.org/10.1017/s0960129524000215openalex-snapshot
Automatic differentiation for ML-family languages: Correctness via logical relations
inferred← citeshttps://doi.org/10.1109/lics.2019.8785663openalex-snapshot
The Geometry of Bayesian Programming
inferred← citeshttps://doi.org/10.1109/lics.2019.8785715openalex-snapshot
Probabilistic Relational Reasoning via Metrics
inferred← citeshttps://doi.org/10.1109/lics.2019.8785809openalex-snapshot
A Probabilistic and Non-Deterministic Call-by-Push-Value Language
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470611openalex-snapshot
Commutative Monads for Probabilistic Programming Languages
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470747openalex-snapshot
Universal Semantics for the Stochastic λ-Calculus
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175739openalex-snapshot
ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175773openalex-snapshot
Deterministic stream-sampling for probabilistic programming: semantics and verification
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175776openalex-snapshot
Evidential Decision Theory via Partial Markov Categories
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175781openalex-snapshot
A Higher-Order Indistinguishability Logic for Cryptographic Reasoning
inferred← citeshttps://doi.org/10.1145/3473598openalex-snapshot
Higher-order probabilistic adversarial computations: categorical semantics and program logics
inferred← citeshttps://doi.org/10.1145/3547651openalex-snapshot
On Feller continuity and full abstraction
inferred← citeshttps://doi.org/10.1145/3571195openalex-snapshot
Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice
inferred← citeshttps://doi.org/10.1145/3571198openalex-snapshot
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3611660openalex-snapshot
A Domain-theoretic Approach to Statistical Programming Languages
inferred← citeshttps://doi.org/10.1145/3632903openalex-snapshot
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets
inferred← citeshttps://doi.org/10.1145/3632926openalex-snapshot
Higher Order Bayesian Networks, Exactly
inferred← citeshttps://doi.org/10.1145/3656448openalex-snapshot
Compiling Probabilistic Programs for Variable Elimination with Information Flow
inferred← citeshttps://doi.org/10.1145/3661814.3662126openalex-snapshot
A Cartesian Closed Category for Random Variables
inferred← citeshttps://doi.org/10.1145/3674662openalex-snapshot
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
inferred← citeshttps://doi.org/10.1145/3704884openalex-snapshot
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
inferred← citeshttps://doi.org/10.1145/3704890openalex-snapshot
Compositional Imprecise Probability: A Solution from Graded Monads and Markov Categories
inferred← citeshttps://doi.org/10.1145/3720424openalex-snapshot
Denotational Foundations for Expected Cost Analysis
inferred← citeshttps://doi.org/10.1145/3776696openalex-snapshot
Bayesian Separation Logic: A Logical Foundation and Axiomatic Semantics for Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.1145/3828674openalex-snapshot
Adequacy for Predicate Transformer Semantics
inferred← citeshttps://doi.org/10.1145/3828695openalex-snapshot
Compositional Generator Equivalence
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.