L. Regnier. Lambda-calcul et r'eseaux. Th`ese de doctorat, U. Paris VII, Math'ematiques, 1992. 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)
....a symmetric reduction applied to the cut C, then (D) 1 (D 0 ) There is no straightforward version of Soundness for the case of commutative reductions in CLL. 4 Translating MLL Proof Structures We give a brief introduction to proof structures and nets, referring the reader to the literature [1, 13, 6, 12, 30, 16, 32] for more details. The Gentzen rules for one sided sequents for CLL are given in Section 3 above (in proof term assignment form) In this section we consider multiplicative linear logic MLL [12, 14] whose formulas are built fromf Omega ; ....
....of information flow for pure nets, thus obviating the need for bidirectional buffers 3 . Terms of the calculus have a natural direction, namely from the inputs to the output. This is obvious from the intended functional interpretation, as well as the dynamics of evaluation. V. Danos, L. Regnier [11, 30, 22], J. van de Wiele and others have studied pure nets, a formalism of proof nets for untyped calculus: pure nets are nets built from formulas I and O (representing input and output, resp. using links of the forms I O O I cut I O O . ....
[Article contains additional citation context not shown here]
L. Regnier. Lambda-calcul et r'eseaux. Th`ese de doctorat, U. Paris VII, Math'ematiques, 1992.
On the pi-Calculus and Linear Logic - Bellin, Scott (1994) (6 citations) (Correct)
....a symmetric reduction applied to the cut C, then (D) 1 (D 0 ) There is no straightforward version of Soundness for the case of commutative reductions in CLL. 4 Translating MLL Proof Structures We give a brief introduction to proof structures and nets, referring the reader to the literature [1, 13, 6, 12, 30, 16, 32] for more details. The Gentzen rules for one sided sequents for CLL are given in Section 3 above (in proof term assignment form) In this section we consider multiplicative linear logic MLL [12, 14] whose formulas are built fromf Omega ; ....
....information flow for pure nets, thus obviating the need for bidirectional buffers 3 . Terms of the calculus have a natural direction, namely from the inputs to the output. This is obvious from the intended functional interpretation, as well as the dynamics of evaluation. V. Danos, L. Regnier [11, 30, 22], J. van de Wiele and others have studied pure nets, a formalism of proof nets for untyped calculus: pure nets are nets built from formulas I and O (representing input and output, resp. using links of the forms I O O I cut I O O . ....
[Article contains additional citation context not shown here]
L. Regnier. Lambda-calcul et r'eseaux. Th`ese de doctorat, U. Paris VII, Math'ematiques, 1992.
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