arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.09660cs.LO
收藏

The Delta-calculus:语法和类型

The Delta-calculus: syntax and types

Luigi Liquori, Claude Stolze

摘要:

我们提出了Delta演算,一个显式类型的Delta-calculus强对,投影和显式类型的Delta-calculus。演算可以用不同的交集类型论T参数化,例如Coppo-Dezani、Coppo-Dezani-Salle '、Coppo-Dezani-Venneri和Barendregt-Coppo-Dezani理论,产生具有相关交集类型系统的Delta-演算族。我们证明了它的主要性质,如Church-Rosser,类型唯一性,主题约简,强规范化,类型检查和类型重构的可判定性。本文通过一个将显式Delta项转换为纯Delta项的本质函数,说明了Curry型交集型赋值系统与Church型交集型赋值系统之间的关系.最后,我们将一个带类型子的Delta项翻译成一个不带类型子的Delta项,证明了这种翻译是连贯的,因为它的本质是恒等式。一般的Delta演算可以被参数化,以考虑其他的交集类型论,如Barendregt等人的书中的理论。

英文摘要:

We present the Delta-calculus, an explicitly typed lambda-calculus with strong pairs, projections and explicit type coercions. The calculus can be parametrized with different intersection type theories T, e.g. the Coppo-Dezani, the Coppo-Dezani-Salle', the Coppo-Dezani-Venneri and the Barendregt-Coppo-Dezani ones, producing a family of Delta-calculi with related intersection type systems. We prove the main properties like Church-Rosser, unicity of type, subject reduction, strong normalization, decidability of type checking and type reconstruction. We state the relationship between the intersection type assignment systems a` la Curry and the corresponding intersection type systems a` la Church by means of an essence function translating an explicitly typed Delta-term into a pure lambda-term one. We finally translate a Delta-term with type coercions into an equivalent one without them; the translation is proved to be coherent because its essence is the identity. The generic Delta-calculus can be parametrized to take into account other intersection type theories as the ones in the Barendregt et al. book.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑