A formal language for cyclic operads
Abstract
We give a complete proof of the equivalence between the unbiased and biased definitions of cyclic operads, through a lambda-calculus-style formal language, called the mu-syntax, and a new formalism of trees that provides a crisp description of the monad of unrooted trees (whose nodes are decorated with operadic operations).
| Origin | Files produced by the author(s) |
|---|
Loading...