Node Replication: Theory And Practice
Delia Kesner, Lo\"ic Peyrot, Daniel Ventura
TL;DR
This paper introduces a term calculus for higher-order node replication, enabling the specification of call-by-name and call-by-need evaluation strategies, and proves their observational equivalence using type theory.
Contribution
It presents a novel calculus for higher-order node replication and demonstrates the equivalence of two evaluation strategies through formal type-theoretic methods.
Findings
Call-by-name and call-by-need are observationally equivalent.
A formal calculus for higher-order node replication is developed.
Type-theoretic tools are used to prove strategy equivalence.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Distributed systems and fault tolerance · Scientific Computing and Data Management