S. Abramsky and R. Jagadeesan. A strong completeness theorem for multiplicative linear logic: Preliminary announcement. Email communication on types mailing list, 1992. 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) Self-citation (Abramsky Jagadeesan) (Correct)
No context found.
S. Abramsky and R. Jagadeesan. A strong completeness theorem for multiplicative linear logic: Preliminary announcement. Email communication on types mailing list, 1992.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1992) (132 citations) Self-citation (Abramsky Jagadeesan) (Correct)
....Linear Logic only, in Curien s case) such that the co Kleisli category is equivalent to the Berry Curien category. Moreover, these Linear categories have a game theoretic flavour. In fact, we have the correspondence: 2 Curien s email announcement of his results appeared following ours [AJ92b] announcing the results of this paper. Game Concrete Data Structure O Moves Cells P Moves Values Positions Enabling Relation Strategy State We have not seen the full details of Lamarche s work; Curien s construction can be related to our work as follows. The objects in his category are exactly ....
S. Abramsky and R. Jagadeesan. A strong completeness theorem for multiplicative linear logic: Preliminary announcement. Email communication on types mailing list, 1992.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1994) (132 citations) Self-citation (Abramsky Jagadeesan) (Correct)
No context found.
S. Abramsky and R. Jagadeesan. A strong completeness theorem for multiplicative linear logic: Preliminary announcement. Email communication on types mailing list, 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