Title: Weighted languages, monads, and distributive laws

I will discuss a perspective on weighted languages that is based on monads and distributive laws. Using this perspective, one can automatically get definitions of weighted languages, and polynomial time algorithms for their equivalence, in a wide variety of settings, such as words, trees, or graphs of bounded treewidth.