Rapid P2P Overlay Network Programming on a Distributed Reduction Machine

To build dependable and sustainable systems requires many iterative trials and stepwise improvements. Rapid programming methods and languages have been studied in the field of peer-to-peer overlay network for this reason. This paper proposes a method for quick programming using Overlay GHC[1] language, an extension of Guarded Horn Clauses[2] for overlay network programming. The method involves a technique called RGP (Remote Goal Placement) instead of RPC over an environment that is viewed as a distributed reduction machine.