P. L. Curien. Concrete data structures, sequential algorithms and linear logic. 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 (Logic) (Correct)
....the sub game A . What saves the Player in Blass semantics is again the special case, which would force Opponent to move in both B and D simultaneously, thus allowing Player to respond in D . 30 6. 4 Sequential Algorithms Lamarche [Lam92] and more recently, but independently, Curien [Cur92] have found linear decompositions of the Berry Curien category of sequential algorithms on (filiform) concrete data structures [BC85] That is, they have described models of Linear Logic (Intuitionistic Linear Logic only, in Curien s case) such that the co Kleisli category is equivalent to the ....
P. L. Curien. Concrete data structures, sequential algorithms and linear logic. Email communication on types mailing list, 1992.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1992) (132 citations) Self-citation (Logic) (Correct)
....sub game A B . What saves the Player in Blass semantics is again the special case, which would force Opponent to move in both B and D simultaneously, thus allowing Player to respond in D . 6. 4 Sequential Algorithms Lamarche [Lam92] and more recently, but independently, Curien 2 [Cur92] have found linear decompositions of the Berry Curien category of sequential algorithms on (filiform) concrete data structures [BC85] That is, they have described models of Linear Logic (Intuitionistic Linear Logic only, in Curien s case) such that the co Kleisli category is equivalent to the ....
P. L. Curien. Concrete data structures, sequential algorithms and linear logic. Email communication on types mailing list, 1992.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1994) (132 citations) Self-citation (Logic) (Correct)
....sub game A B . What saves the Player in Blass semantics is again the special case, which would force Opponent to move in both B and D simultaneously, thus allowing Player to respond in D . 6. 4 Sequential Algorithms Lamarche [Lam92] and more recently, but independently, Curien 2 [Cur92] have found linear decompositions of the Berry Curien category of sequential algorithms on (filiform) concrete data structures [BC85] That is, they have described models of Linear Logic (Intuitionistic Linear Logic only, in Curien s case) such that the co Kleisli category is equivalent to the ....
P. L. Curien. Concrete data structures, sequential algorithms and linear logic. 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