64 citations · 159 across the 14 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.PL2023★ 3 cited
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar +5
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-beh…
cs.LO2023
Denotational semantics for languages for inference: semirings, monads, and tensors
Cristina Matache, Sean Moss, Sam Staton +1
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebrai…