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.

@article{paperbot2786,
  title = {Node Replication: Theory And Practice},
  author = {Delia Kesner and Loïc Peyrot and Daniel Ventura},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 20, Issue 1},
  year = {2024},
  doi = {10.46298/lmcs-20(1:5)2024}
}