M. Hyland and C.-H. L. Ong. Fair Games and Full Completeness for Multiplicative Linear Logic without the MIX rule. Unpublished Manuscript, 1992. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Proof Nets for Unit-free Multiplicative-Additive Linear Logic - Extended Dominic (2003) (12 citations) (Correct)
Towards Full Completeness for the Linear Logic of Chu Spaces - Vaughan Pratt Dept (1997) (1 citation) (Correct)
Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
On Strong Stability and Higher-Order Sequentiality - Loic Colson Thomas (1994) (2 citations) (Correct)
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
Games And Definability For FPC - McCusker (1997) (1 citation) (Correct)
A 2-dimensional view of the Chu-construction - Koslowski (2000) (Correct)
Strategies And String Operations - Koslowski (1997) (Correct)
A Convenient Category For Games And Interaction - Koslowski (1997) (Correct)
A Convenient Category For Games And Interaction - Koslowski (1996) (Correct)
Some Semantical Aspects of Linear Logic - Blass (1997) (2 citations) (Correct)
Games in the Semantics of Programming Languages - Abramsky (1997) (9 citations) (Correct)
Concurrent Games and Full Completeness - Abramsky, Melliès (1998) (16 citations) (Correct)
Full completeness of the multiplicative linear logic of Chu.. - Harish Devarajan (6 citations) (Correct)
Is Game Semantics Necessary? - Blass (Correct)
Types as Processes, via Chu spaces - Vaughan Pratt (1997) (1 citation) (Correct)
Concurrent Games and Full Completeness - Samson Abramsky Lfcs (1998) (16 citations) (Correct)
Proof Nets for Unit-free Multiplicative-Additive Linear Logic - Extended Dominic (2003) (12 citations) (Correct)
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
Chu's construction: A proof-theoretic approach - Bellin (1999) (1 citation) (Correct)
Discreet Games, Light Affine Logic and PTIME Computation - Murawski, Ong Self-citation (Ong) (Correct)
Discreet Games, Light Affine Logic and PTIME Computation - Murawski, Ong Self-citation (Ong) (Correct)
Pi-Calculus, Dialogue Games and PCF - Hyland, Ong (1995) Self-citation (Hyland Ong) (Correct)
Exhausting Strategies, Joker Games and Full Completeness for.. - Murawski, Ong (1999) Self-citation (Ong) (Correct)
First 50 documents
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