Samson Abramsky and Radha Jagadeesan Department of Computing Imperial College ...  Home/Search
Context Related
Links: ACM DBLP | web.comlab.ox.ac.uk/oucl/wo...gfc.ps.gz depaul.edu/rjagade...letenessMLL.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: web.comlab.ox.ac.uk/oucl/work/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our ... (Update)
Cited by: More
A judgmental analysis of linear logic - Bor-Yuh Evan Chang (Correct)
Full Abstraction for PCF - Samson Abramsky Radha (1994) (Correct)
Games for Controls - Chatterjee, Jagadeesan, Pitcher (2006) (Correct)
Similar documents (at the sentence level):
79.3%: Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1992) (Correct)
Active bibliography (related documents): More All
0.5: An Unexpectedly Simple 2-Categorical Origin - For Chu Spaces (Correct)
0.5: Deductive Synthesis of Recursive Plans in Linear Logic - Cresswell, Smaill, Richardson (1999) (Correct)
0.4: Fair Games and Full Completeness for Multiplicative Linear.. - Hyland, Ong (1993) (Correct)
Similar documents based on text: More All
0.7: Concurrent Games and Full Completeness - Abramsky, Melliès (1998) (Correct)
0.6: Linear Läuchli Semantics - Blute, Scott (Correct)
0.6: Exhausting Strategies, Joker Games and Full Completeness for.. - Murawski, Ong (1999) (Correct)
Related documents from co-citation: More All
54: Theoretical Computer Science (context) - Girard - 1987
38: Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
22: Fair games and full completeness for multiplicative linear logic without the mix.. - Hyland, Ong - 1993
BibTeX entry: (Update)
S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543 -- 574, June 1994. Also appeared as Technical Report 92/24 of the Department of Computing, Imperial College of Science, Technology and Medicine. http://citeseer.ist.psu.edu/article/abramsky94games.html More
@inproceedings{ abramsky92games,
author = "S. Abramsky and R. Jagadeesan",
title = "Games and Full Completeness for Multiplicative Linear Logic",
booktitle = "Foundations of Software Technology and Theoretical Computer Science ({FST}-{TCS}'92)",
address = "New Delhi, India",
editor = "R. Shyamasundar",
pages = "291-301",
year = "1992",
url = "citeseer.ist.psu.edu/article/abramsky94games.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
982 Theoretical Computer Science (context) - Girard, variable et al. - 1986 ACM
982 Theoretical Computer Science (context) - Girard - 1987
509 Introduction to Lattices and Order (context) - Davey, Priestley - 1990
306 LCF considered as a programming language (context) - Plotkin - 1977 DBLP
109 Interaction nets (context) - Lafont - 1990 ACM DBLP
72 Archive for Mathematical Logic (context) - Danos, Regnier et al. - 1989
72 A new constructive logic: classical logic (context) - Girard - 1991 DBLP
69 Geometry of interaction 1: Interpretation of System F (context) - Girard - 1989
68 Towards a geometry of interaction (context) - Girard - 1989
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
50 New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1992 ACM DBLP
49 Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
43 Games semantics for linear logic (context) - Lafont, Streicher - 1991 DBLP
42 Linear logic without boxes - Gonthier, Abadi et al. - 1992 DBLP
42 volume 752 of Lecture Notes in Mathematics (context) - Barr, categories - 1979
29 Theory and practice of sequential algorithms: the kernel of .. (context) - Berry, Curien - 1985
22 dI-domains as a model of polymorphism (context) - Coquand, Gunter et al. - 1987 ACM DBLP
21 games and linear logic (context) - Lamarche - 1992
18 volume 39 of North-Holland Mathematical Library (context) - Freyd, Scedrov et al. - 1991
17 Proofs as processes (context) - Abramsky - 1991 ACM DBLP
17 Semantics of weakening and contraction (context) - Jacobs - 1992 DBLP
15 Algebraic types in per models (context) - Hyland, Robinson et al. - 1989
11 Geometry of interaction 2: Deadlock-free algorithms (context) - Girard - 1988
10 Remarques sur la theorie des jeux a deux personnes (context) - Joyal - 1977
7 coherence and dinaturality (context) - Blute - 1992
6 cofree coalgebras and linear logic (context) - Seeley, categories - 1989
6 To appear (context) - Abramsky, of et al. - 1990
5 Personal communication (context) - Blass - 1992
5 Unpublished note (context) - Fleury, Retor'e et al. - 1990
5 a mathematical model of computing agents (context) - Milner - 1975
4 Conway games and linear logic (context) - Hyland - 1990
3 A strong completeness theorem for multiplicative linear logi.. (context) - Abramsky, Jagadeesan - 1992
3 Email communication on types mailing list (context) - Curien, structures et al. - 1992
3 volume 6 of London Mathematical Society Monographs (context) - Conway, Games - 1976
3 Submitted to Annals of Pure and Applied Logic (context) - Girard, unity - 1991
2 The Dialectica categories (context) - de Paiva - 1989
2 Revised version of Imperial College Technical Report DoC (context) - Abramsky, Vickers et al. - 1990
1 Curien's email announcement hi result appeared following our.. (context) - autonomous, linear et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/): More
Computational Interpretations of Linear Logic - Abramsky (1993) (Correct)
Algorithmic Game Semantics - Abramsky (Correct)
A Structural Approach to Reversible Computation - Abramsky (2001) (Correct)
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