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.

翻译：我们定义并研究了一种实现高阶节点复制的项演算。该演算用于描述两种不同的（弱）求值策略：按名调用和完全惰性按需调用，并通过类型理论技术工具证明它们在观察上等价。