A formal language for cyclic operads

Pierre-Louis Curien, Jovana Obradović


We give a complete proof of the equivalence between the unbiased and biased definitions of cyclic operads, through a λ-calculus-style formal language, called the μ-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).


Copyright © 2017 Department of Mathematics Macquarie University