A formal language for cyclic operads
From MaRDI portal
Publication:3121012
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1327759 (Why is no real title available?)
- scientific article; zbMATH DE number 1757930 (Why is no real title available?)
- scientific article; zbMATH DE number 970691 (Why is no real title available?)
- Feynman categories
- Feynman graphs, and nerve theorem for compact symmetric multicategories (extended abstract)
- Gromov-Witten classes, quantum cohomology, and enumerative geometry
- Models for operads
- Modular envelopes, OSFT and nonsymmetric (non-\(\Sigma\)) modular operads
- Monoid-like definitions of cyclic operad
- Operads revisited
- Term Rewriting and All That
- The algebra of directed acyclic graphs
- The duality of computation
- The geometry of iterated loop spaces
- Types and programing languages
- Une théorie combinatoire des séries formelles
Cited in
(7)
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)