S. Abramsky and R. Jagadeesan. Games and Full Completeness Theorem for Multiplicative Linear Logic, J. Symbolic Logic, Vol.59, No.2, pp. 543-574. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the pi-Calculus and Linear Logic - Bellin, Scott (1994) (6 citations) (Correct)
....if there is no ambiguity, and refer to it as the D R graph of R. For further information, cf. 12, 6] Occasionally (e.g. in Section 5. 3 below) we will consider the system of sequent calculus for multiplicative linear logic, with the additional structural rule of Mix, also called direct logic DL [7, 11, 31, 4, 10]: mix : Gamma Delta Gamma; Delta Definition. A proof structure R is a proof net for Direct Logic DL if for every switching s of R, the graph G s (R) is acyclic (but not necessarily connected. The following fundamental result (Girard [13] relates sequent calculus and proof nets for ....
....the general structures that are guaranteed to be deadlock free We recall (see Section 4. 1) that a proof structure satisfying the acyclicity condition (but not necessarily connectedness) is a proof net for Direct Logic DL namely, multiplicative linear logic MLL with the structural rule of Mix [6, 4, 16, 10]. Theorem 12 (Deadlock free nets) Let S be a proof net for MLL or direct logic and let ffi be an orientation of S satisfying (xx) Then ffi is computationally consistent. Proof. The reader should check that under the assignment (xx) to an axiom reduction of proof nets (Section 4.1) there ....
S. Abramsky and R. Jagadeesan. Games and Full Completeness Theorem for Multiplicative Linear Logic, J. Symbolic Logic, Vol.59, No.2, pp. 543-574.
On the pi-Calculus and Linear Logic - Bellin, Scott (1994) (6 citations) (Correct)
....if there is no ambiguity, and refer to it as the D R graph of R. For further information, cf. 12, 6] Occasionally (e.g. in Section 5. 3 below) we will consider the system of sequent calculus for multiplicative linear logic, with the additional structural rule of Mix, also called direct logic DL [7, 11, 31, 4, 10]: mix : 0 1 0; 1 Definition. A proof structure R is a proof net for Direct Logic DL if for every switching s of R, the graph G s (R) is acyclic (but not necessarily connected. The following fundamental result (Girard [13] relates sequent calculus and proof nets for MLL. 19 Theorem 4 ....
....are the general structures that are guaranteed to be deadlock free We recall (see Section 4. 1) that a proof structure satisfying the acyclicity condition (but not necessarily connectedness) is a proof net for Direct Logic DL namely, multiplicative linear logic MLL with the structural rule of Mix [6, 4, 16, 10]. Theorem 12 (Deadlock free nets) Let S be a proof net for MLL or direct logic and let ffi be an orientation of S satisfying (xx) Then ffi is computationally consistent. Proof. The reader should check that under the assignment (xx) to an axiom reduction of proof nets (Section 4.1) there ....
S. Abramsky and R. Jagadeesan. Games and Full Completeness Theorem for Multiplicative Linear Logic, J. Symbolic Logic, Vol.59, No.2, pp. 543-574.
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