Data Types with Symmetries and Polynomial Functors over Groupoids

DOI10.1016/j.entcs.2013.01.001zbMath1342.68216arXiv1210.0828OpenAlexW2963167458WikidataQ113318026 ScholiaQ113318026MaRDI QIDQ3178294

Joachim Kock

Publication date: 8 July 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

symmetriestreesgroupoidsspeciespolynomial functorsdata types

Mathematics Subject Classification ID

Perturbative methods of renormalization applied to problems in quantum field theory (81T15) Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (8)

Graphs, hypergraphs, and properads ⋮ Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory ⋮ Categorification of Hopf algebras of rooted trees. ⋮ Polynomial functors and combinatorial Dyson–Schwinger equations ⋮ Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees. ⋮ The incidence comodule bialgebra of the Baez-Dolan construction ⋮ Faà di Bruno for operads and internal algebras ⋮ Local dissymmetry on graphs and related algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Univalence in locally Cartesian closed categories
• Polynomial functors and opetopes
• Une théorie combinatoire des séries formelles
• On the Hopf algebra strucutre of perturbative quantum field theories
• Wellfounded trees in categories
• Universal coalgebra: A theory of systems
• Quasi-categories and Kan complexes
• Categorification of Hopf algebras of rooted trees.
• Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
• Containers: Constructing strictly positive types
• Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
• Inductive Types in Homotopy Type Theory
• The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories
• Polynomial Functors and Trees
• Locally cartesian closed categories and type theory
• Two-dimensional models of type theory
• On multiplicative transfer
• Polynomial functors and polynomial monads
• Local fibred right adjoints are polynomial
• A set constructor for inductive sets in Martin-Löf's type theory
• Higher-Dimensional Algebra VII: Groupoidification
• Polynomials in categories with pullbacks
• Mathematics of Program Construction
• Indexed containers
• The cartesian closed bicategory of generalised species of structures
• Higher Topos Theory (AM-170)
• Foundations of Software Science and Computational Structures
• Types for Proofs and Programs
• Two applications of analytic functors

This page was built for publication: Data Types with Symmetries and Polynomial Functors over Groupoids