Cover Image

Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ackerman, Nathanael L., Freer, Cameron E., Kaddar, Younesse, Karwowski, Jacek, Moss, Sean K., Roy, Daniel M., Staton, Sam, Yang, Hongseok
Format:	Preprint
Published:	2023
Subjects:	Programming Languages Logic in Computer Science Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories
by: Kaddar, Younesse, et al.
Published: (2023)

Likelihood hacking in probabilistic program synthesis
by: Karwowski, Jacek, et al.
Published: (2026)

On the computability of cofinal Fraïssé limits
by: Ackerman, Nathanael, et al.
Published: (2026)

Generic sampling and invariant measures on the space of $k$-uniform hypergraphs
by: Ackerman, Nathanael, et al.
Published: (2025)

A causal Markov category with Kolmogorov products
by: Moss, Sean, et al.
Published: (2025)

Scoped Effects as Parameterized Algebraic Theories
by: Matache, Cristina, et al.
Published: (2024)

Higher Order Automatic Differentiation of Higher Order Functions
by: Huot, Mathieu, et al.
Published: (2021)

Cohen Generic Structures with Functions
by: Ackerman, Nathanael, et al.
Published: (2023)

Compositional imprecise probability
by: Liell-Cock, Jack, et al.
Published: (2024)

Uncertainty-Aware Step-wise Verification with Generative Reward Models
by: Ye, Zihuiwen, et al.
Published: (2025)

Weak randomness in graphons and theons
by: Coregliano, Leonardo N., et al.
Published: (2022)

Program Logics via Distributive Monoidal Categories
by: Bonchi, Filippo, et al.
Published: (2025)

Structured Sunflowers
by: Ackerman, Nathanael, et al.
Published: (2025)

Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
by: Spork, Timm, et al.
Published: (2025)

Borel fractional perfect matchings in quasi-transitive amenable graphs
by: Murray, Sam
Published: (2025)

Adhesive category theory for graph rewriting in Rocq
by: Arsac, Samuel, et al.
Published: (2025)

Big in Reverse Mathematics: measure and category
by: Sanders, Sam
Published: (2023)

Between Markov and restriction: Two more monads on categories for relations
by: Cioffo, Cipriano Junior, et al.
Published: (2025)

Incompleteness theorems via Turing category
by: Savelyev, Yasha
Published: (2024)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

GPU accelerated program synthesis: Enumerate semantics, not syntax!
by: Berger, Martin, et al.
Published: (2025)

A Translation of Probabilistic Event Calculus into Markov Decision Processes
by: Xu, Lyris, et al.
Published: (2025)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)

Extended multi-adjoint logic programming
by: Cornejo, M. Eugenia, et al.
Published: (2024)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

A Dual-Threshold Probabilistic Knowing Value Logic
by: Wang, Shanxia
Published: (2026)

Groupoidal Realizability for Intensional Type Theory
by: Speight, Sam
Published: (2024)

Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)

Syntax and semantics of multi-adjoint normal logic programming
by: Cornejo, M. Eugenia, et al.
Published: (2024)

Categorial grammars with unique category assignment
by: Vishnikin, Maxim, et al.
Published: (2025)

The further study on the category of T-convergence groups
by: Li, Lingqiang, et al.
Published: (2024)

An Introduction to Razborov's Flag Algebra as a Proof System for Extremal Graph Theory
by: Jeong, Gyeongwon, et al.
Published: (2026)

A new categorial equivalence for Stone Algebras
by: Calomino, Ismael, et al.
Published: (2025)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Intuitionistic modal logics: a minimal setting
by: Balbiani, Philippe, et al.
Published: (2025)

Probabilistic Verification for Modular Network-on-Chip Systems (extended version)
by: Waddoups, Nick, et al.
Published: (2025)

Universal categories
by: Schoutens, Hans
Published: (2025)

Axiomatization of Boolean Connexive Logics with syncategorematic negation and modalities
by: Jarmuzek, Tomasz, et al.
Published: (2024)

Zeta Functions and the (Linear) Logic of Markov Processes
by: Seiller, Thomas
Published: (2020)