Lafont, Y., Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages, pp. 95--108, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Contexts and Embeddings for Closed Shallow Action Graphs - Cattani, Leifer, Milner (2000) (4 citations) (Correct)
.... determine a labelled transition, using an action calculus for elementary arithmetic having controls 0, S and with arities (0,1) 1,1) and (2,1) The reaction system is shown in Figure 4; it is an example of the sharing graphs of Hasegawa [10] which add sharing to the interaction nets of Lafont [15]. Nodes represent subexpressions, and the forking of arcs allows these to be shared. The reaction rules are in the top diagram; the garbage collection rules allow unattached expressions to be incrementally destroyed. The middle diagram shows an action (graph) a occurring in a larger one b 0 , ....
Lafont, Y., Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages, pp. 95--108, 1990.
Action Structures for the pi-Calculus - Milner (1993) (Correct)
....head label. 6.4 Reflexive nets Having seen that the action structure of nets is isomorphic to PIC, one naturally asks what is gained by this new presentation. One answer is that it gives a less formal, more geometric, view of reaction. We may compare it with the geometry of interaction of Lafont [6], following Girard [5] it differs notably in that reaction in PIC is not a confluent reduction relation. Another answer is that the geometric view may suggest generalizations or variations of PIC. We now examine one generalization. Three related constraints have been placed upon nets: C1 A net ....
Lafont, Y., Interaction nets, Proc. 17th ACM Symposium on Principles of Programming Languages, 1990.
An Action Structure for Synchronous pi-Calculus - Milner (1993) (2 citations) (Correct)
....but some essential aspects are still hidden. Here we indicate briefly that both the statics and the dynamics of RPIC correspond to simple graphical ideas. Fuller details are given in [10] This graphical form may be called a geometry of interaction; it is similar in spirit to the work of Lafont [5], and of Girard [4] on proof nets in linear logic. 6.1 Bare nets We begin with a simple kind of graph called a bare net. It has nodes and directed arcs. Each node is drawn as a pointed oval with a head, a waist and a tail as shown. waist tail head Each directed arc is either a source arc or ....
Lafont, Y., Interaction nets, Proc. 17th ACM Symposium on Principles of Programming Languages, 1990.
Action Structures and the Pi Calculus - Milner (Correct)
....13.4 Reflexive nets Having seen that the action structure of nets is isomorphic to PIC, one naturally asks what is gained by this new presentation. One answer is that it gives a less formal, more geometric, view of reaction. We may compare it with the geometry of interaction of Lafont [15], following Girard [11] it differs notably in that reaction in PIC is not a confluent reduction relation. Another answer is that the geometric view may suggest generalisations or variations of PIC. We now examine one generalisation. Two related constraints have been placed upon nets: C1 A ....
Lafont, Y., Interaction nets, Proc. 17th ACM Symposium on Principles of Programming Languages, 1990.
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