On the public citation graph

Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming

https://doi.org/10.1145/3158147
0 signed · 60 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-08860-1_7openalex-snapshot
Stable models of typed λ-calculi
inferredcites →https://doi.org/10.1007/978-3-319-06880-0_25openalex-snapshot
Probabilistic and Quantum Event Structures
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_32openalex-snapshot
Commutative Semantics for Probabilistic Programming
inferredcites →https://doi.org/10.1007/bfb0092872openalex-snapshot
A categorical approach to probability theory
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
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(95)00250-2openalex-snapshot
PCF extended with real numbers
inferredcites →https://doi.org/10.1016/j.entcs.2009.01.002openalex-snapshot
Semantic Domains for Combining Probability and Non-Determinism
inferredcites →https://doi.org/10.1016/j.ic.2011.02.001openalex-snapshot
Probabilistic coherence spaces as a model of higher-order probabilistic computation
inferredcites →https://doi.org/10.1016/s1571-0661(05)80216-6openalex-snapshot
The Troublesome Probabilistic Powerdomain
inferredcites →https://doi.org/10.1016/s1571-0661(05)80602-4openalex-snapshot
The Category of Markov Kernels
inferredcites →https://doi.org/10.1017/s0960129504004360openalex-snapshot
On the non-sequential nature of the interval-domain model of real-number computation
inferredcites →https://doi.org/10.1109/lics.1989.39173openalex-snapshot
A probabilistic powerdomain of evaluations
inferredcites →https://doi.org/10.1109/lics.2011.23openalex-snapshot
Continuous Random Variables
inferredcites →https://doi.org/10.1109/lics.2011.29openalex-snapshot
The Computational Meaning of Probabilistic Coherence Spaces
inferredcites →https://doi.org/10.1109/lics.2013.36openalex-snapshot
Weighted Relational Models of Typed Lambda-Calculi
inferredcites →https://doi.org/10.1109/lics.2017.8005137openalex-snapshot
A convenient category for higher-order probability theory
inferredcites →https://doi.org/10.1145/1452044.1452048openalex-snapshot
A probabilistic language based on sampling functions
inferredcites →https://doi.org/10.1145/2535838.2535865openalex-snapshot
Probabilistic coherence spaces are fully abstract for probabilistic PCF
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/507382.507385openalex-snapshot
Probabilistic game semantics
inferredcites →https://doi.org/10.1145/62678.62681openalex-snapshot
Exact real computer arithmetic with continued fractions
inferredcites →https://doi.org/10.1215/ijm/1255631584openalex-snapshot
Borel structures for function spaces
inferredcites →https://doi.org/10.2140/pjm.1962.12.1163openalex-snapshot
On fundamental properties of a Banach space with a cone
inferredcites →https://doi.org/10.2307/1969847openalex-snapshot
Absolutely Monotone Functions
inferredcites →https://doi.org/10.23638/lmcs-13(1:2)2017openalex-snapshot
Mixed powerdomains for probability and nondeterminism

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-72019-3_16openalex-snapshot
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
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.1016/j.entcs.2018.11.016openalex-snapshot
Continuous Probability Distributions in Concurrent Games
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.1017/s0960129521000177openalex-snapshot
Linear logic in normed cones: probabilistic coherence spaces and beyond
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470550openalex-snapshot
Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470712openalex-snapshot
A Bunched Logic for Conditional Independence
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.10175753openalex-snapshot
Taylor Expansion as a Monad in Models of DiLL
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.1145/3164540openalex-snapshot
Full Abstraction for Probabilistic PCF
inferred← citeshttps://doi.org/10.1145/3209108.3209187openalex-snapshot
The concurrent game semantics of Probabilistic PCF
inferred← citeshttps://doi.org/10.1145/3209108.3209192openalex-snapshot
A Logical Account for Linear Partial Differential Equations
inferred← citeshttps://doi.org/10.1145/3209108.3209198openalex-snapshot
Probabilistic Stable Functions on Discrete Cones are Power Series
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/3373718.3394758openalex-snapshot
Cones as a model of intuitionistic linear logic
inferred← citeshttps://doi.org/10.1145/3531130.3533370openalex-snapshot
Concrete categories and higher-order recursion
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/3586036openalex-snapshot
A Gradual Probabilistic Lambda Calculus
inferred← citeshttps://doi.org/10.1145/3591245openalex-snapshot
Verified Density Compilation for a Probabilistic Programming Language
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/3661814.3662126openalex-snapshot
A Cartesian Closed Category for Random Variables
inferred← citeshttps://doi.org/10.1145/3737889openalex-snapshot
Schedule Agnostic Semantics for Reactive Probabilistic Programming
inferred← citeshttps://doi.org/10.4204/eptcs.333.2openalex-snapshot
A Monad for Probabilistic Point Processes
inferred← citeshttps://doi.org/10.70675/0bb75525z0078z4033z88b5z919b98f2b635openalex-snapshot
Bicategorical orthogonality constructions for linear logic
inferred← citeshttps://doi.org/10.70675/bae6e60bz6d6ez4e30z81e4z3dfa94433bfcopenalex-snapshot
On the compositionality of monads via weak distributive laws
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.