Node Replication: Theory And Practice

Abstract

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.

Keywords

• computer science - logic in computer science
• 03b70
• f.3.2
• f.4.1
• d.3.1