Authors: Curien, Pierre-Louis
Obradović, Jovana 
Title: A formal language for cyclic operads
Journal: Higher Structures
Volume: 1
Issue: 1
First page: 22
Last page: 55
Issue Date: 24-May-2017
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: operad | cyclic operad | unrooted trees | syntax | rewriting system | formalisation
Publisher: Department of Mathematics Macquarie University

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.