An internal language for autonomous categories

An internal language for autonomous categories
复制标题

自治类别的内部语言

DOI:
10.1007/978-1-4471-3503-6_18
复制
发表时间:
1993
影响因子:
0.6
通讯作者:
S. Abramsky
S. Abramsky
中科院分区:
数学3区
文献类型:
--
作者:
I. Mackie;L. Román;S. Abramsky

文献摘要

参考文献

被引文献

相似文献

我们给出了对称么半闭(自治)范畴的内部语言,类似于类型化的Lambda演算,作为笛卡尔闭范畴的内部语言。我们提出的语言是直觉主义线性逻辑乘法片段的术语赋值,它恰好具有自治理论的正确结构。我们证明了这种语言是一种内部语言,并作为应用展示了Kelly和Mac Lane的一致性定理,这使得陈述和证明变得简单易懂。最后,我们用自然数对语言进行了扩展,并证明了这对应于自治范畴中的弱自然数对象。
We present an internal language for symmetric monoidal closed (autonomous) categories analogous to the typed lambda calculus as an internal language for cartesian closed categories. The language we propose is the term assignment to the multiplicative fragment of Intuitionistic Linear Logic, which possesses exactly the right structure for an autonomous theory. We prove that this language is an internal language and show as an application the coherence theorem of Kelly and Mac Lane, which becomes straightforward to state and prove. Finally, we extend the language with the natural numbers and show that this corresponds to a weak Natural Numbers Object in an autonomous category.
DOI: 10.1007/978-1-4612-9839-7
发表时间: 1971
期刊: --
影响因子: --
作者:
S. Lane
通讯作者: S. Lane