Programs, Proofs, Processes
Programs, Proofs, Processes
复制标题
程序、证明、过程
DOI：
10.1007/978-3-642-13962-8_2
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Altenkirch T
中科院分区：
文献类型：
--
作者：
Altenkirch T
容器是描述严格正类型的一种语义方式。在以前的工作中，它表明，容器是封闭的各种结构，包括产品，余产品，初始代数和终端余代数。在本文中，我们发现，令人惊讶的是，范畴的容器是carless-closed，从而产生一个完整的carless-closed子范畴的endofunctors。结果在泛型编程和高阶抽象语法的表示中有有趣的应用。我们还证明了容器范畴有有限极限，但它不是局部carbohydrate封闭的。
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The result has interesting applications in generic programming and representation of higher order abstract syntax. We also show that the category of containers has finite limits, but it is not locally cartesian closed.