Closed Freyd- and kappa-categories

Closed Freyd- and kappa-categories
复制标题

封闭的 Freyd 和 kappa 类别

DOI:
--
复制
发表时间:
1999
期刊:
International Colloquium on Automata, Languages and Programming
影响因子:
--
通讯作者:
Hayo Thielecke
Hayo Thielecke
中科院分区:
--
文献类型:
--
作者:
J. Power;Hayo Thielecke

文献摘要

被引文献

相似文献

本文给出了计算λ-演算或λ c-演算的两类可靠和完备的模型。首先,我们将Carnival闭范畴的概念推广到闭Frenival-范畴的概念。第二,我们推广简单的索引类别。前者给出了计算λ-演算的直接语义。后者对应于在某些编译方法中使用的基于堆栈的中间语言的理想化。
We give two classes of sound and complete models for the computational λ-calculus, or λc-calculus. For the first, we generalise the notion of cartesian closed category to that of closed Freyd-category. For the second, we generalise simple indexed categories. The former gives a direct semantics for the computational λ-calculus. The latter corresponds to an idealisation of stack-based intermediate languages used in some approaches to compiling.