A formal language for cyclic operads

Abstract

We propose a $\lambda$-calculus-style formal language, called the $\mu$-syntax, as a lightweight representation of the structure of cyclic operads. We illustrate the rewriting methods behind the formalism by giving a complete step-by-step proof of the equivalence between the unbiased and biased definitions of cyclic operads.

Cited by in corpus (2)

• A practical type theory for symmetric monoidal categories
• Monoid-like definitions of cyclic operads