首页> 外文期刊>Electronic Notes in Theoretical Computer Science >Data Types with Symmetries and Polynomial Functors over Groupoids
【24h】

Data Types with Symmetries and Polynomial Functors over Groupoids

机译:Groupoids上具有对称性和多项式函子的数据类型

获取原文
           

摘要

Polynomial functors (overSetor other locally cartesian closed categories) are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect is often prominent and justifies the terminology. For example, Tambara?s theorem states that the category of finite polynomial functors is the Lawvere theory for commutative semirings [D. Tambara, On multiplicative transfer,Comm. Alg.21(1993), pp. 1393–1420], [N. Gambino and J. Kock,Polynomial functors and polynomial monads, to appear in Math. Proc. Cambridge Philos. Soc.,arXiv:0906.4931].In this talk I will explain how an upgrade of the theory from sets to groupoids (or other locally cartesian closed 2-categories) is useful to deal with data types with symmetries, and provides a common generalisation of and a clean unifying framework for quotient containers (in the sense of Abbott et al.), species and analytic functors (Joyal 1985), as well as the stuff types of Baez and Dolan. The multi-variate setting also includes relations and spans, multispans, and stuff operators. An attractive feature of this theory is that with the correct homotopical approach — homotopy slices, homotopy pullbacks, homotopy colimits, etc. — the groupoid case looks exactly like the set case.After some standard examples, I will illustrate the notion of data-types-with-symmetries with examples from perturbative quantum field theory, where the symmetries of complicated tree structures of graphs play a crucial role, and can be handled elegantly using polynomial functors over groupoids. (These examples, although beyond species, are purely combinatorial and can be appreciated without background in quantum field theory.)Locally cartesian closed 2-categories provide semantics for a 2-truncated version of Martin-L?f intensional type theory. For a fullfledged type theory, locally cartesian closed ∞-categories seem to be needed. The theory of these is being developed by David Gepner and the author as a setting for homotopical species, and several of the results exposed in this talk are just truncations of ∞-results obtained in joint work with Gepner. Details will appear elsewhere.
机译:多项式函子(overSet或其他局部笛卡尔封闭类别)在数据类型的理论中很有用,它们通常被称为容器。它们在代数,组合学,拓扑学和高级类别理论中也很有用,并且从更广阔的角度来看,多项式方面通常很突出并证明了该术语的合理性。例如,坦巴拉定理指出,有限多项式函子的类别是可交换半环的Lawvere理论[D。坦巴拉,关于乘法转移,通讯。 Alg.21(1993),第1393-1420页,[N。 Gambino和J. Kock,多项式函子和多项式单子,出现在Math中。进程剑桥Philos。 Soc。,arXiv:0906.4931]。在本演讲中,我将说明将理论从集合升级为类群(或其他局部笛卡尔闭合的2类)如何用于处理具有对称性的数据类型,并提供一个通用的以及一个用于商容器(在Abbott等人的意义上),物种和分析函子(Joyal 1985)以及Baez和Dolan的填充类型的干净统一框架。多元设置还包括关系和跨度,多跨度和填充运算符。该理论的一个吸引人的特点是,通过正确的同构方法(同构切片,同构回调,同构限制数等),类群情况看起来与集合情况完全相同。在一些标准示例之后,我将说明数据类型的概念。 -带有对称性的例子,来自摄动量子场理论,其中图的复杂树形结构的对称性起着至关重要的作用,并且可以通过使用群上的多项式函子来优雅地处理。 (这些示例尽管超出了物种,但纯粹是组合的,在没有量子场论背景的情况下可以理解。)局部笛卡尔封闭的2类为Martin-L?f内涵类型论的2个截断版本提供了语义。对于完整的类型理论,似乎需要局部笛卡尔封闭的∞-类别。这些理论由戴维·盖普纳(David Gepner)和作者开发,作为同位物种的设置,本次演讲中暴露的一些结果只是与盖普纳(Gepner)共同工作中获得的∞结果的截断。详细信息将显示在其他位置。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利