Constructs powerdomains in synthetic domain theory that give computationally adequate models of nondeterminism and embed into dependent type theory.
Moss, and Sam Staton
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Develops compositional incrementalization of density functions for probabilistic programs to accelerate Monte Carlo inference algorithms.
citing papers explorer
-
Powerdomains and nondeterminism in synthetic domain theory
Constructs powerdomains in synthetic domain theory that give computationally adequate models of nondeterminism and embed into dependent type theory.
-
Incremental Computation for Efficient Programmable Inference in Probabilistic Programs
Develops compositional incrementalization of density functions for probabilistic programs to accelerate Monte Carlo inference algorithms.