按值调用方案中的线性依赖类型(长版)
Linear Dependent Types in a Call-by-Value Scenario (Long Version)
摘要:
线性依赖类型允许精确地捕获lambda项的扩展行为和时间复杂度,当后者由Krivine的抽象机器评估时。在这项工作中,我们表明,同样的范例可以应用到呼叫的价值评估。介绍了Plotkin PCF的线性相关类型系统dlPCFV,其类型反映了CEK机中计算项的复杂性。dlPCFV被证明是合理的,但也是相对完整的:每一个真正的陈述的延伸和有意的行为的条款可以得到,提供所有真正的索引项不等式可以用作假设。
英文摘要:
Linear dependent types allow to precisely capture both the extensional behaviour and the time complexity of lambda terms, when the latter are evaluated by Krivine's abstract machine. In this work, we show that the same paradigm can be applied to call-by-value evaluation. A system of linear dependent types for Plotkin's PCF is introduced, called dlPCFV, whose types reflect the complexity of evaluating terms in the so-called CEK machine. dlPCFV is proved to be sound, but also relatively complete: every true statement about the extensional and intentional behaviour of terms can be derived, provided all true index term inequalities can be used as assumptions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。