J.-Y. Girard. On the unity of logic. Submitted to Annals of Pure and Applied Logic, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (132 citations) (Correct)
....Opponent starts. Definition 4 A game A is positive (has polarity 1) if every valid initial move in A is by Player; negative (has polarity Gamma1) if every valid initial move in A is by Opponent; and neutral (polarity 0) otherwise. Although we use the same notation for polarities as Girard [Gir91b], they have a somewhat different interpretation. Our polarities have a very direct computational reading. If we interpret 24 moves by Opponent as demands for data and moves by Player as generating data, then positive games model purely data driven computation; negative games model purely ....
J.-Y. Girard. On the unity of logic. Submitted to Annals of Pure and Applied Logic, 1991.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1992) (132 citations) (Correct)
....Opponent starts. Definition 4 A game A is positive (has polarity 1) if every valid initial move in A is by Player; negative (has polarity Gamma1) if every valid initial move in A is by Opponent; and neutral (polarity 0) otherwise. Although we use the same notation for polarities as Girard [Gir91b], they have a somewhat different interpretation. Our polarities have a very direct computational reading. If we interpret moves by Opponent as demands for data and moves by Player as generating data, then positive games model purely data driven computation; negative games model purely ....
J.-Y. Girard. On the unity of logic. Submitted to Annals of Pure and Applied Logic, 1991.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1994) (132 citations) (Correct)
....Opponent starts. Definition 4 A game A is positive (has polarity 1) if every valid initial move in A is by Player; negative (has polarity Gamma1) if every valid initial move in A is by Opponent; and neutral (polarity 0) otherwise. Although we use the same notation for polarities as Girard [Gir91b], they have a somewhat different interpretation. Our polarities have a very direct computational reading. If we interpret moves by Opponent as demands for data and moves by Player as generating data, then positive games model purely data driven computation; negative games model purely ....
J.-Y. Girard. On the unity of logic. Submitted to Annals of Pure and Applied Logic, 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