Develops compositional incrementalization of density functions for probabilistic programs to accelerate Monte Carlo inference algorithms.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Graded coalgebras for graded monads are proposed to capture continuous-time transition systems, with developed theory for terminal coalgebras, branching and trace semantics, and coalgebraic modal logics.
citing papers explorer
-
Incremental Computation for Efficient Programmable Inference in Probabilistic Programs
Develops compositional incrementalization of density functions for probabilistic programs to accelerate Monte Carlo inference algorithms.
-
Graded Monad Coalgebras for Continuous-Time Transition Systems
Graded coalgebras for graded monads are proposed to capture continuous-time transition systems, with developed theory for terminal coalgebras, branching and trace semantics, and coalgebraic modal logics.