
Scaling Exact Inference for Discrete Probabilistic Programs
The cost of inference is the primary barrier for wider application of probabilistic programming languages. How can we scale inference to truly huge programs?
The cost of inference is the primary barrier for wider application of probabilistic programming languages. How can we scale inference to truly huge programs?
How can we effectively test a complex quantum program state when the test operation is potentially destructive?
Have something to say about PL? Send us your idea!
Sometimes functions are not enough.