Gay, S., Interaction Nets, Diploma in Computer Science in Queens', 1991.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Graph Notation For Concurrent Combinators - Yoshida (1995)   (17 citations)  (Correct)

....one of Lafont s Interaction Nets. 5 In this system, the original combinators S and K are decomposed into three or two atoms, respectively. Moreover we need to explicitly represent Copy and Kill of terms. Following this, all 5 This encoding is the exactly same one as Simon Gay gave in [2], though it was independently defined and has been published in [6] nine atomic graphs are defined in Figure 10 (a) and the interaction rules are specified in (b) In this encoding we use a generation of a linkage called a (generalised) forwarder: this is because a direct identification of two ....

Gay, S., Interaction Nets, Diploma in Computer Science in Queens', 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC