On the public citation graph

Reasoning about “reasoning about reasoning”: semantics and contextual equivalence for probabilistic programs with nested queries and recursion

https://doi.org/10.1145/3498677
0 signed · 45 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/11693024_6openalex-snapshot
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
inferredcites →https://doi.org/10.1007/978-3-030-55089-9_3openalex-snapshot
Weakest Preexpectation Semantics for Bayesian Inference
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_6openalex-snapshot
Fine-Grained Semantics for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-662-46678-0_18openalex-snapshot
Step-Indexed Logical Relations for Probability
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_14openalex-snapshot
Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
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(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1016/j.cogsys.2013.07.003openalex-snapshot
Reasoning about reasoning by nested conditioning: Modeling theory of mind with probabilistic programs
inferredcites →https://doi.org/10.1016/s0019-9958(85)80001-2openalex-snapshot
Logical relations and the typed λ-calculus
inferredcites →https://doi.org/10.1017/9781108770750.004openalex-snapshot
Application ofComputable Distributions to the Semantics of Probabilistic Programs
inferredcites →https://doi.org/10.1017/s0956796800000125openalex-snapshot
Equivalence in functional languages with effects
inferredcites →https://doi.org/10.1023/a:1007720632734openalex-snapshot
inferredcites →https://doi.org/10.1080/01621459.1998.10473765openalex-snapshot
Sequential Monte Carlo Methods for Dynamic Systems
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.1109/sfcs.1979.38openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1145/1452044.1452048openalex-snapshot
A probabilistic language based on sampling functions
inferredcites →https://doi.org/10.1145/2933575.2935313openalex-snapshot
Semantics for probabilistic programming
inferredcites →https://doi.org/10.1145/2951913.2951942openalex-snapshot
A lambda-calculus foundation for universal probabilistic programming
inferredcites →https://doi.org/10.1145/3156018openalex-snapshot
Conditioning in Probabilistic Programming
inferredcites →https://doi.org/10.1145/3236782openalex-snapshot
Contextual equivalence for a probabilistic language with continuous random variables and recursion
inferredcites →https://doi.org/10.1145/3428208openalex-snapshot
Scaling exact inference for discrete probabilistic programs
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.2307/2282268openalex-snapshot
Dynamic Programming and Markov Processes.
inferredcites →https://doi.org/10.2307/j.ctvd58v18openalex-snapshot
Real Analysis

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-031-98679-6_5openalex-snapshot
POPACheck: A Model Checker for Probabilistic Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-981-95-3585-9_3openalex-snapshot
A Formal Foundation for Equational Reasoning on Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-981-99-8311-7_9openalex-snapshot
Experimenting with an Intrinsically-Typed Probabilistic Programming Language in Coq
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/3573105.3575691openalex-snapshot
Semantics of Probabilistic Programs using s-Finite Kernels in Coq
inferred← citeshttps://doi.org/10.1145/3591226openalex-snapshot
Lilac: A Modal Separation Logic for Conditional Probability
inferred← citeshttps://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3656448openalex-snapshot
Compiling Probabilistic Programs for Variable Elimination with Information Flow
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3704884openalex-snapshot
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
inferred← citeshttps://doi.org/10.1145/3720482openalex-snapshot
Multi-Language Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3720500openalex-snapshot
Scaling Optimization over Uncertainty via Compilation
inferred← citeshttps://doi.org/10.1145/3729166openalex-snapshot
Proof Scores: A Survey
inferred← citeshttps://doi.org/10.1145/3732291openalex-snapshot
Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory
inferred← citeshttps://doi.org/10.1145/3737889openalex-snapshot
Schedule Agnostic Semantics for Reactive Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3763078openalex-snapshot
A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo)
inferred← citeshttps://doi.org/10.1145/3822593openalex-snapshot
Model Checking Probabilistic Operator Precedence Automata
inferred← citeshttps://doi.org/10.17726/philit.2024.1.4openalex-snapshot
The Concept of Recursion in Cognitive Studies. Part I: From Mathematics to Cognition
inferred← citeshttps://doi.org/10.46298/entics.12281openalex-snapshot
Pearl's and Jeffrey's Update as Modes of Learning in Probabilistic Programming
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.