On the public citation graph

Denotational validation of higher-order Bayesian inference

https://doi.org/10.1145/3158148
0 signed · 97 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.1007/3-540-52592-0_60openalex-snapshot
On the expressive power of programming languages
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-662-54434-1_32openalex-snapshot
Commutative Semantics for Probabilistic Programming
inferredcites →https://doi.org/10.1007/bf01304852openalex-snapshot
Strong functors and monoidal monads
inferredcites →https://doi.org/10.1016/0167-6423(91)90036-wopenalex-snapshot
On the expressive power of programming languages
inferredcites →https://doi.org/10.1016/j.jlamp.2016.11.006openalex-snapshot
From probability monads to commutative effectuses
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.028openalex-snapshot
A categorical model for the geometry of interaction
inferredcites →https://doi.org/10.1017/s0004972700006353openalex-snapshot
A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
inferredcites →https://doi.org/10.1017/s0956796899003500openalex-snapshot
A tutorial on the universality and expressiveness of fold
inferredcites →https://doi.org/10.1093/oso/9780198522669.003.0061openalex-snapshot
BUGS: a Program to Perform Bayesian Inference using Gibbs Sampling
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.2017.8005137openalex-snapshot
A convenient category for higher-order probability theory
inferredcites →https://doi.org/10.1145/1040305.1040320openalex-snapshot
A probabilistic language based upon sampling functions
inferredcites →https://doi.org/10.1145/1047659.1040320openalex-snapshot
A probabilistic language based upon sampling functions
inferredcites →https://doi.org/10.1145/2535838.2535850openalex-snapshot
Tabular
inferredcites →https://doi.org/10.1145/2804302.2804317openalex-snapshot
Practical probabilistic programming with monads
inferredcites →https://doi.org/10.1145/2887747.2804317openalex-snapshot
Practical probabilistic programming with monads
inferredcites →https://doi.org/10.1145/2951913.2951942openalex-snapshot
A lambda-calculus foundation for universal probabilistic programming
inferredcites →https://doi.org/10.1145/3022670.2951942openalex-snapshot
A lambda-calculus foundation for universal probabilistic programming
inferredcites →https://doi.org/10.1145/503272.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferredcites →https://doi.org/10.1145/565816.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferredcites →https://doi.org/10.1201/b10905-2openalex-snapshot
Introduction to Markov Chain Monte Carlo
inferredcites →https://doi.org/10.1201/b10905-3openalex-snapshot
A Short History of MCMC: Subjective Recollections from Incomplete Data
inferredcites →https://doi.org/10.1215/ijm/1255631584openalex-snapshot
Borel structures for function spaces
inferredcites →https://doi.org/10.14288/1.0044249openalex-snapshot
A new approach to probabilistic programming inference
inferredcites →https://doi.org/10.18637/jss.v076.i01openalex-snapshot
Stan : A Probabilistic Programming Language
inferredcites →https://doi.org/10.4064/cm-23-1-33-38openalex-snapshot
Borel structures for function spaces
inferredcites →https://doi.org/10.4204/eptcs.207.2openalex-snapshot
Eilenberg–Moore Monoids and Backtracking Monad Transformers
inferredcites →https://doi.org/10.4230/lipics.fscd.2017.16openalex-snapshot
List Objects with Algebraic Structure
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2015.475openalex-snapshot
A Provably Correct Sampler for Probabilistic Programs
inferredcites →https://doi.org/10.4230/lipics.icdt.2016.7openalex-snapshot
Declarative Probabilistic Programming with Datalog
inferredcites →https://doi.org/10.48550/arxiv.1206.3255openalex-snapshot
Church: a language for generative models
inferredcites →https://doi.org/10.48550/arxiv.1301.1299openalex-snapshot
Automated Variational Inference in Probabilistic Programming
inferredcites →https://doi.org/10.48550/arxiv.1306.3277openalex-snapshot
Bayesian State-Space Modelling on High-Performance Hardware Using LibBi
inferredcites →https://doi.org/10.48550/arxiv.1506.03431openalex-snapshot
Automatic Variational Inference in Stan
inferredcites →https://doi.org/10.48550/arxiv.1603.01882openalex-snapshot
Composing inference algorithms as program transformations
inferredcites →https://doi.org/10.48550/arxiv.1701.03757openalex-snapshot
Deep Probabilistic Programming
inferredcites →https://doi.org/10.70930/tac/sbn7nctdopenalex-snapshot
Monads as Extension Systems—No Iteration is Necessary
inferredcites →https://doi.org/10.70930/tac/tflc3s2uopenalex-snapshot
Commutative monads as a theory of distributions

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-17184-1_12openalex-snapshot
Probabilistic Programming Inference via Intensional Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-57201-3_6openalex-snapshot
De Finetti’s Construction as a Categorical Limit
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-030-99461-7_4openalex-snapshot
Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL
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-031-30829-1_5openalex-snapshot
A Higher-Order Language for Markov Kernels and Linear Operators
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_12openalex-snapshot
Suspension Analysis and Selective Continuation-Passing Style for Universal Probabilistic Programming Languages
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107239openalex-snapshot
A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
inferred← citeshttps://doi.org/10.1016/j.scico.2023.102993openalex-snapshot
Program logic for higher-order probabilistic programs in Isabelle/HOL
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.002openalex-snapshot
Domains and stochastic processes
inferred← citeshttps://doi.org/10.1017/9781108770750.003openalex-snapshot
Probabilistic Programs as Measures
inferred← citeshttps://doi.org/10.1017/9781108770750.010openalex-snapshot
The Logical Essentials of Bayesian Reasoning
inferred← citeshttps://doi.org/10.1101/161125openalex-snapshot
Artificial Intelligence for Ecological and Evolutionary Synthesis
inferred← citeshttps://doi.org/10.1109/access.2024.3467375openalex-snapshot
Approximate Computing: Concepts, Architectures, Challenges, Applications, and Future Directions
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.1145/3236778openalex-snapshot
Functional programming for modular Bayesian inference
inferred← citeshttps://doi.org/10.1145/3290349openalex-snapshot
A domain theory for statistical probabilistic programming
inferred← citeshttps://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferred← citeshttps://doi.org/10.1145/3371084openalex-snapshot
Towards verified stochastic variational inference for probabilistic programs
inferred← citeshttps://doi.org/10.1145/3371125openalex-snapshot
Semantics of higher-order probabilistic programs with conditioning
inferred← citeshttps://doi.org/10.1145/3385412.3386006openalex-snapshot
λPSI: exact inference for higher-order probabilistic programs
inferred← citeshttps://doi.org/10.1145/3434292openalex-snapshot
Probabilistic programming semantics for name generation
inferred← citeshttps://doi.org/10.1145/3453483.3454077openalex-snapshot
Sound probabilistic inference via guide types
inferred← citeshttps://doi.org/10.1145/3473592openalex-snapshot
On continuation-passing transformations and expected cost analysis
inferred← citeshttps://doi.org/10.1145/3473598openalex-snapshot
Higher-order probabilistic adversarial computations: categorical semantics and program logics
inferred← citeshttps://doi.org/10.1145/3498705openalex-snapshot
Fully abstract models for effectful λ-calculi via category-theoretic logical relations
inferred← citeshttps://doi.org/10.1145/3531130.3533355openalex-snapshot
Probability monads with submonads of deterministic states
inferred← citeshttps://doi.org/10.1145/3531130.3533370openalex-snapshot
Concrete categories and higher-order recursion
inferred← citeshttps://doi.org/10.1145/3571198openalex-snapshot
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3591245openalex-snapshot
Verified Density Compilation for a Probabilistic Programming Language
inferred← citeshttps://doi.org/10.1145/3591290openalex-snapshot
Probabilistic Programming with Stochastic Probabilities
inferred← citeshttps://doi.org/10.1145/3609026openalex-snapshot
Proceedings of the 16th ACM SIGPLAN International Haskell Symposium
inferred← citeshttps://doi.org/10.1145/3609026.3609729openalex-snapshot
Effect Handlers for Programmable Inference
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/3656463openalex-snapshot
Probabilistic Programming with Programmable Variational Inference
inferred← citeshttps://doi.org/10.1145/3703595.3705875openalex-snapshot
Formalization of Differential Privacy in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3776729openalex-snapshot
Probabilistic Programming with Vectorized Programmable Inference
inferred← citeshttps://doi.org/10.1145/3808321openalex-snapshot
GradInf: Gradient Estimation as Probabilistic Inference
inferred← citeshttps://doi.org/10.14288/1.0388330openalex-snapshot
On amortized inference in large-scale simulators
inferred← citeshttps://doi.org/10.17760/d20560797openalex-snapshot
A mortized inference for structured deep generative models
inferred← citeshttps://doi.org/10.17760/d20618640openalex-snapshot
Towards compositional probabilistic programming
inferred← citeshttps://doi.org/10.17863/cam.42233openalex-snapshot
Formally justified and modular Bayesian inference for probabilistic programs
inferred← citeshttps://doi.org/10.3389/fevo.2019.00402openalex-snapshot
Artificial Intelligence for Ecological and Evolutionary Synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.397.16openalex-snapshot
String Diagrams with Factorized Densities
inferred← citeshttps://doi.org/10.4204/eptcs.428.8openalex-snapshot
Parallelizable Feynman-Kac Models for Universal Probabilistic Programming
inferred← citeshttps://doi.org/10.4230/lipics.snapl.2019.1openalex-snapshot
Overparameterization: A Connection Between Software 1.0 and Software 2.0
inferred← citeshttps://doi.org/10.48550/arxiv.1812.07439openalex-snapshot
Automatic Alignment of Sequential Monte Carlo Inference in Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1907.05451openalex-snapshot
Compositional Inference Metaprogramming with Convergence Guarantees
inferred← citeshttps://doi.org/10.48550/arxiv.1907.08827openalex-snapshot
Towards Verified Stochastic Variational Inference for Probabilistic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1908.02062openalex-snapshot
Functional probabilistic programming for scalable Bayesian modelling
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09056openalex-snapshot
Amortized Rejection Sampling in Universal Probabilistic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12198openalex-snapshot
Effectuses in Categorical Quantum Foundations
inferred← citeshttps://doi.org/10.48550/arxiv.1912.06791openalex-snapshot
Approximations in Probabilistic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2103.00668openalex-snapshot
Learning Proposals for Probabilistic Programs with Inference Combinators
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.