arXiv · 1602.07502
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.
Explore related subjects
Keep this discovery
Pierre-Louis Curien, Jovana Obradović. 2016-02-24. A formal language for cyclic operads. https://arxiv.org/abs/1602.07502
Cite the original work for its findings. Save a collection to share your selection of sources.