I'd love to hear some things that are unique to this PPL compared to the somewhat crowded space of Pyro/Stan/Edward/PyMC3/Turing.jl/Tensorflow probability.
I like the Bean Machine's declarative syntax because it makes it easy to implement interesting inference algorithms that treat different parts of a model independently. The syntax makes it easy to work around Python's lack of copyable coroutines, which e.g. has made it difficult to implement block Gibbs algorithms in Pyro. OTOH from a modeling perspective I find it easier to read monolithic straight-line models (as in STAN or Pyro) than to read declarative collections of functions (as in Bean Machine).