arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.4426cs.LOcs.PL
收藏

取消绑定和重新绑定的交叉点类型

Intersection types for unbind and rebind

Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca

摘要:

我们定义了一个类型系统的交集类型的扩展的Unbind和rebind操作符的Adjuda演算。在这个演算中,一个带有自由变量的术语,代表开放代码,可以打包成一个“未绑定”术语,并作为一个值传递。为了在代码内部执行,未绑定项应该在使用它的地方显式地重新绑定。Unbinding和rebinding是分层的,也就是说,术语可以包含任意嵌套的未绑定术语,其内部代码只能在应用了一系列rebinds之后执行。相应地,类型用级别装饰,如果一个项需要k次重新绑定才能还原为一个值,则它的类型用k装饰。通过交集类型,我们模拟了一个事实,即一个术语可以在提供不同数量的解绑的上下文中以不同的方式使用。特别地,顶级术语,即不需要解绑来还原为值的术语,应该具有值类型,即至少一个元素具有级别0的交集类型。与建议的交叉类型的系统,我们得到的按值调用的策略下,这是以前的类型系统没有解决的问题的合理性。

英文摘要:

We define a type system with intersection types for an extension of lambda-calculus with unbind and rebind operators. In this calculus, a term with free variables, representing open code, can be packed into an "unbound" term, and passed around as a value. In order to execute inside code, an unbound term should be explicitly rebound at the point where it is used. Unbinding and rebinding are hierarchical, that is, the term can contain arbitrarily nested unbound terms, whose inside code can only be executed after a sequence of rebinds has been applied. Correspondingly, types are decorated with levels, and a term has type decorated with k if it needs k rebinds in order to reduce to a value. With intersection types we model the fact that a term can be used differently in contexts providing different numbers of unbinds. In particular, top-level terms, that is, terms not requiring unbinds to reduce to values, should have a value type, that is, an intersection type where at least one element has level 0. With the proposed intersection type system we get soundness under the call-by-value strategy, an issue which was not resolved by previous type systems.

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

↑