We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type theoretical technical tools.
翻译:我们定义和研究了一个术语演算,实现高阶节点复制。它用于指定两种不同的(弱)评估策略:名字调用和完全懒惰的名字需要,通过使用类型理论的技术工具,它们被证明是可观察等效的。