Media Summary: A streaming probabilistic program receives a stream of observations and produces a stream of distributions that are conditioned ... A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo) (Video, ... MIT 6.041SC Probabilistic Systems Analysis and Applied

Oopsla Probability Type Inference For - Detailed Analysis & Overview

A streaming probabilistic program receives a stream of observations and produces a stream of distributions that are conditioned ... A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo) (Video, ... MIT 6.041SC Probabilistic Systems Analysis and Applied Hi this is Steven Holtzen (), I'm a PhD. candidate at UCLA advised by Guy Van den Broeck () and Todd ... Multi-Language Probabilistic Programming (Video, OOPSLA1 2025) Sam Stites, John M. Li, and Steven Holtzen (Northeastern ... To follow along with the course, visit the course website: Chris Piech ...

When Subtyping Constraints Liberate: A Novel

Photo Gallery

[OOPSLA] Probability Type Inference for Flexible Approximate Programming
[OOPSLA] Semi-symbolic Inference for Efficient Streaming Probabilistic Programming
[OOPSLA24] Type Inference Logics
[OOPSLA'25] A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning(…)
An Inference Example
Scaling Exact Inference for Discrete Probabilistic Programs
[OOPSLA'25] Multi-Language Probabilistic Programming
Stanford CS109 Probability for Computer Scientists I General Inference I 2022 I Lecture 15
OOPSLA 2020 Poster: Scaling Exact Inference for Discrete Probabilistic Programs
Stanford CS109 Probability for Computer Scientists I Inference I 2022 I Lecture 12
[POPL'24] When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-C...
[OOPSLA24] Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions
View Detailed Profile
[OOPSLA] Probability Type Inference for Flexible Approximate Programming

[OOPSLA] Probability Type Inference for Flexible Approximate Programming

Talk Title:

[OOPSLA] Semi-symbolic Inference for Efficient Streaming Probabilistic Programming

[OOPSLA] Semi-symbolic Inference for Efficient Streaming Probabilistic Programming

A streaming probabilistic program receives a stream of observations and produces a stream of distributions that are conditioned ...

[OOPSLA24] Type Inference Logics

[OOPSLA24] Type Inference Logics

Type Inference

[OOPSLA'25] A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning(…)

[OOPSLA'25] A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning(…)

A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo) (Video, ...

An Inference Example

An Inference Example

MIT 6.041SC Probabilistic Systems Analysis and Applied

Scaling Exact Inference for Discrete Probabilistic Programs

Scaling Exact Inference for Discrete Probabilistic Programs

Hi this is Steven Holtzen (@zengola), I'm a PhD. candidate at UCLA advised by Guy Van den Broeck (@guyvdb) and Todd ...

[OOPSLA'25] Multi-Language Probabilistic Programming

[OOPSLA'25] Multi-Language Probabilistic Programming

Multi-Language Probabilistic Programming (Video, OOPSLA1 2025) Sam Stites, John M. Li, and Steven Holtzen (Northeastern ...

Stanford CS109 Probability for Computer Scientists I General Inference I 2022 I Lecture 15

Stanford CS109 Probability for Computer Scientists I General Inference I 2022 I Lecture 15

To follow along with the course, visit the course website: https://web.stanford.edu/class/archive/cs/cs109/cs109.1232/ Chris Piech ...

OOPSLA 2020 Poster: Scaling Exact Inference for Discrete Probabilistic Programs

OOPSLA 2020 Poster: Scaling Exact Inference for Discrete Probabilistic Programs

This is the poster presentation for the

Stanford CS109 Probability for Computer Scientists I Inference I 2022 I Lecture 12

Stanford CS109 Probability for Computer Scientists I Inference I 2022 I Lecture 12

To follow along with the course, visit the course website: https://web.stanford.edu/class/archive/cs/cs109/cs109.1232/ Chris Piech ...

[POPL'24] When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-C...

[POPL'24] When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-C...

When Subtyping Constraints Liberate: A Novel

[OOPSLA24] Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions

[OOPSLA24] Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions

Exact Bayesian

Stanford CS109 Probability for Computer Scientists I Inference II I 2022 I Lecture 13

Stanford CS109 Probability for Computer Scientists I Inference II I 2022 I Lecture 13

To follow along with the course, visit the course website: https://web.stanford.edu/class/archive/cs/cs109/cs109.1232/ Chris Piech ...