# Community call notes 09/20

**URL:** https://discourse.julialang.org/t/community-call-notes-09-20/47208
**Category:** Probabilistic Programming
**Created:** [September 24, 2020, 1:54pm UTC](https://discourse.julialang.org/t/community-call-notes-09-20/47208 "2020-09-24T13:54:43Z")
**Posts on this page:** 2
**Page:** 1

<div class="post-metadata">

### Author: ![McCoy](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/mccoy/32/13833_2.png) [@McCoy](https://discourse.julialang.org/u/McCoy)
#### Post date: [September 24, 2020, 1:54pm UTC](https://discourse.julialang.org/t/community-call-notes-09-20/47208/1 "2020-09-24T13:54:43Z")

</div>

Just so we get broad coverage - if you took notes, you might share them here as well (@mohamed82008, @cscherrer, @phg)

Also, here are the collected links from the chat:

From Alex:

> **[disintegrator.pdf](https://homes.luddy.indiana.edu/ccshan/rational/disintegrator.pdf)**
>
> 364.83 KB

> **[disint2arg.pdf](https://homes.luddy.indiana.edu/ccshan/rational/disint2arg.pdf)**
>
> 2.85 MB

From Chad:

> **[Nesting Probabilistic Programs](https://arxiv.org/abs/1803.06328v1)**
>
> We formalize the notion of nesting probabilistic programming queries and investigate the resulting statistical implications. We demonstrate that query nesting allows the definition of models which could not otherwise be expressed, such as those...

[https://julialang.zulipchat.com/#narrow/stream/240884-soss.2Ejl/topic/Turing.20interface.20for.20sampling/near/199905425](https://julialang.zulipchat.com/#narrow/stream/240884-soss.2Ejl/topic/Turing.20interface.20for.20sampling/near/199905425)

From McCoy:

> <https://github.com/Keno/Compiler3.jl/issues/4>
>
> @DhairyaLGandhi @Keno 
> 
> Hi all. I'm trying to determine the applicability of s…ome of this work to some of my interests in PP.
> 
> I recently started exploring a technique which utilizes Mjolnir and a simple type system to perform an optimization at \`@generated\` expansion time. The optimization is dependent on the "semantics" of the inference operation which you are performing (which is currently expressed through a combination of type inference and a reaching analysis). \[I've written a small abstract here.\](https://femtomc.github.io/mrb\_dynamic\_specialization.pdf)
> 
> My usage of Mjolnir is sort of funky - and I'm guessing the original use case is not quite like this. It almost seems like the new compiler work applies - but I really don't understand it yet, so I can't say with certainty.
> 
> Nonetheless, I wanted to start this issue as a reference so that this topic might be explored (I know AD is being explored as we speak).

From Mohammed:

> **[GitHub - TuringLang/NestedSamplers.jl: Implementations of single and...](https://github.com/TuringLang/NestedSamplers.jl)**
>
> Implementations of single and multi-ellipsoid nested sampling - GitHub - TuringLang/NestedSamplers.jl: Implementations of single and multi-ellipsoid nested sampling

At one point, Alex also mentioned Hakaru - which is here: [http://hakaru-dev.github.io/](http://hakaru-dev.github.io/)

---

<div class="post-metadata">

### Author: ![mohamed82008](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/mohamed82008/32/18171_2.png) [@mohamed82008](https://discourse.julialang.org/u/mohamed82008)
#### Post date: [September 24, 2020, 1:58pm UTC](https://discourse.julialang.org/t/community-call-notes-09-20/47208/2 "2020-09-24T13:58:59Z")

</div>

My notes can be found here [https://github.com/TuringLang/Turing.jl/issues/1410](https://github.com/TuringLang/Turing.jl/issues/1410).
