Trace types and denotational semantics for sound programmable inference in probabilistic languages
Modern probabilistic programming languages aim to formalize and automate key aspects of probabilistic modeling and inference. Many languages provide constructs for programmable inference that enable developers to improve inference speed and accuracy by tailoring an algorithm for use with a particula...
Main Authors: | Lew, Alexander (Author), Cusumano-Towner, Marco F. (Author), Sherman, Benjamin (Author), Carbin, Michael James (Author), Mansinghka, Vikash K (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2021-03-03T12:03:23Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Probabilistic programming with programmable inference
by: Mansinghka, Vikash K., et al.
Published: (2021) -
On the algebraic denotational specifications of programming language semantics
by: Sun, Juemin.
Published: (2015) -
Denotational semantics in the definition of natural language uses
by: Cunha, Joao Bernardo de Sena Esteves Falcao e
Published: (1990) -
Natively probabilistic computation
by: Mansinghka, Vikash Kumar
Published: (2009) -
SPPL: probabilistic programming with fast exact symbolic inference
by: Saad, Feras A, et al.
Published: (2022)