A formal language for cyclic operads
Algebraic Topology
2017-04-26 v2
Abstract
We propose a -calculus-style formal language, called the -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.
Keywords
Cite
@article{arxiv.1602.07502,
title = {A formal language for cyclic operads},
author = {Pierre-Louis Curien and Jovana Obradović},
journal= {arXiv preprint arXiv:1602.07502},
year = {2017}
}