A formal language for cyclic operads

From MaRDI portal
Publication:3121012




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.









This page was built for publication: A formal language for cyclic operads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121012)