R. Blute. Linear logic, coherence and dinaturality. In Theoretical Computer Science, 115:3-41, 1993.  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)
....criterion [DR89] simply omitting the connectedness part. Thus, a proof structure will be a valid proof net for MLL MIX just if, for every switching, the corresponding graph is acyclic. This criterion was studied by Fleury and Retor e [FR90] used by Blute in his work on coherence theorems [Blu92], and adapted by Lafont for his work on interaction nets [Laf90] Now we can state our result in more precise terms. Theorem 1 Every proof net in MLL MIX denotes a uniform, history independent winning strategy for Player in our game interpretation. Conversely, every such strategy is the ....
R. Blute. Linear logic, coherence and dinaturality. Technical report, McGill University, 1992.
On Double Categories and Multiplicative Linear Logic - Melliès (1999) (Correct)
....theorem which says that every morphism which is a string of primitive morphisms is equivalent to a morphism in simpler form. Hence one can apply inductive techniques and establish coherence (in the unit free case. To each morphism is assigned an involution on the set of literals, what (Blute 1993) calls its Kelly Mac Lane graph. The authors show that two morphisms are equal i they have the same Kelly Mac Lane graph. Today, we understand that Kelly Mac Lane graphs are really the axiom links of proof nets in (unitfree) intuitionistic multiplicative linear logic. In particular, Kelly and ....
....the interest for autonomous categories and especially the construction in the appendix of Barr s book, which we call now the Chu construction. The categorical axioms for linear logic appear for the rst time in (Seely 1987) then (Bierman 1995) who re nes them to consider cut elimination. In (Blute 1993), Blute sets out to prove coherence for autonomous categories, using Lambek s ideas. Lambek s result are rather unwieldy in that he is working in sequent calculus, which requires to give equations between sequent derivations and take into account commutative conversions. Blute recasts Lambek s ....
[Article contains additional citation context not shown here]
R. Blute, Linear logic, coherence and dinaturality. In Theoretical Computer Science, 115:3-41, 1993.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1992) (132 citations) (Correct)
....criterion [DR89] simply omitting the connectedness part. Thus, a proof structure will be a valid proof net for MLL MIX just if, for every switching, the corresponding graph is acyclic. This criterion was studied by Fleury and Retor e [FR90] used by Blute in his work on coherence theorems [Blu92], and adapted by Lafont for his work on interaction nets [Laf90] Now we can state our result in more precise terms. Theorem 1 Every proof net in MLL MIX denotes a uniform, history independent winning strategy for Player in our game interpretation. Conversely, every such strategy is the ....
R. Blute. Linear logic, coherence and dinaturality. Technical report, McGill University, 1992.
Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1994) (132 citations) (Correct)
....criterion [DR89] simply omitting the connectedness part. Thus, a proof structure will be a valid proof net for MLL MIX just if, for every switching, the corresponding graph is acyclic. This criterion was studied by Fleury and Retor e [FR90] used by Blute in his work on coherence theorems [Blu92], and adapted by Lafont for his work on interaction nets [Laf90] Now we can state our result in more precise terms. Theorem 1 Every proof net in MLL MIX denotes a uniform, history independent winning strategy for Player in our game interpretation. Conversely, every such strategy is the ....
R. Blute. Linear logic, coherence and dinaturality. Technical report, McGill University, 1992.
Double Categories: a modular model of multiplicative linear logic - Mellies (Correct)
No context found.
R. Blute. Linear logic, coherence and dinaturality. In Theoretical Computer Science, 115:3-41, 1993.
A Formal Calculus for Categories - Caccamo (2003) (Correct)
No context found.
Richard Blute. Linear Logic, Coherence and Dinaturality. PhD thesis, University of Pennsylvania, 1991.
A Formal Calculus for Categories - Caccamo (2003) (Correct)
No context found.
Richard Blute. Linear Logic, Coherence and Dinaturality. PhD thesis, University of Pennsylvania, 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