A formal language for cyclic operads

zbMath1411.18016arXiv1602.07502MaRDI QIDQ3121012

Jovana Obradović, Pierre-Louis Curien

Publication date: 19 March 2019

Full work available at URL: https://arxiv.org/abs/1602.07502

zbMATH Keywords

rewriting systemoperadsyntaxformalisationunrooted treescyclic operad

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

A practical type theory for symmetric monoidal categories ⋮ Proofs and surfaces ⋮ Categorified cyclic operads ⋮ Dwyer–Kan homotopy theory for cyclic operads ⋮ Monoid-like definitions of cyclic operads

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular envelopes, OSFT and nonsymmetric (non-\(\Sigma\)) modular operads
• Une théorie combinatoire des séries formelles
• Gromov-Witten classes, quantum cohomology, and enumerative geometry
• The geometry of iterated loop spaces
• Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
• The duality of computation
• Monoid-like definitions of cyclic operads
• Term Rewriting and All That
• Models for operads
• The Algebra of Directed Acyclic Graphs
• Operads Revisited
• Feynman Categories

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