On the Values of Reducibility Candidates
On the Values of Reducibility Candidates
复制标题
关于可还原性候选者的价值观
DOI：
10.1007/978-3-642-02273-9_20
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Colin Riba
中科院分区：
文献类型：
--
作者：
Colin Riba
联合类型的直接消除被认为会破坏主题约简，并且对于一些扩展的类演算，也会破坏强规范化。类似地，直接消除隐式存在类型破坏了主语归约。
我们提出了消除规则的联合类型和隐式存在量化使用的形式调用的值发出的吉拉德的约简候选人。我们表明，这些规则弥补了上述困难，强规范化，存在量化，主题减少以及。
此外，对于扩展的直觉逻辑的基础上，我们得到的存在量化是等价的，其通常的预测编码w.r.t.从约简候选和双正交建立的可实现模型的可证明性。
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly, the straightforward elimination of implicit existential types breaks subject reduction.
We propose elimination rules for union types and implicit existential quantification which use a form call-by-value issued from Girard's reducibility candidates. We show that these rules remedy the above mentioned difficulties, for strong normalization and, for the existential quantification, for subject reduction as well.
Moreover, for extensions of the lambda-calculus based on intuitionistic logic, we show that the obtained existential quantification is equivalent to its usual impredicative encoding w.r.t. provability in realizability models built from reducibility candidates and biorthogonals.
DOI：
--
发表时间：
2007
期刊：
Lecture Notes in Computer Science(In : Proceedings of 8th International Conference on Typed Lambda Calculi and Applications (TLCA 2007)) 4583
影响因子：
--
作者：
M. Dezani-Ciancaglini;R. Di Cosmo;E. Giovannetti.;M. Tatsuta;M.Tatsuta
通讯作者：
M.Tatsuta