Samson Abramsky LFCS, Division of Informatics Univ. of Edinburgh Paul-Andre...  Home/Search
Context Related
Links: ACM DBLP | pps.jussieu.fr/~mellies/...lics99.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: pps.jussieu.fr/~mellies/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is proved for this semantics. (Update)
Cited by: More
Comparing Hierarchies of Types in Models of Linear Logic - Mellies (2003) (Correct)
Sequential Algorithms and Strongly Stable Functions - Mellies (Correct)
Asynchronous games 1: Uniformity by group invariance - Mellies (Correct)
Similar documents (at the sentence level):
62.7%: Concurrent Games and Full Completeness - Abramsky, Melliès (1998) (Correct)
7.9%: Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
Active bibliography (related documents): More All
0.2: Games in the Semantics of Programming Languages - Abramsky (1997) (Correct)
0.1: Full completeness of the multiplicative linear logic of Chu.. - Harish Devarajan (Correct)
0.1: Proof Nets for Unit-free Multiplicative-Additive Linear Logic - Extended Dominic (2003) (Correct)
Similar documents based on text: More All
0.2: Tuesday 7. Sept - Topic Verification Methods (Correct)
0.2: A Fully Complete PER Model for ML Polymorphic Types - Abramsky, Lenisa (2000) (Correct)
0.2: Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (1999) (Correct)
Related documents from co-citation: More All
22: Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
13: Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
13: New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1993
BibTeX entry: (Update)
S. Abramsky and P.-A. Mellies. Concurrent games and full completeness. Draft paper, 37 pages, 1998. http://citeseer.ist.psu.edu/abramsky98concurrent.html More
@inproceedings{ abramsky99concurrent,
author = "Samson Abramsky and Paul-Andre Mellies",
title = "Concurrent Games and Full Completeness",
booktitle = "Logic in Computer Science",
pages = "431-442",
year = "1999",
url = "citeseer.ist.psu.edu/abramsky98concurrent.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987 ACM
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1994 ACM DBLP
168 Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981 ACM
69 Handbook of Logic in Computer Science (context) - Abramsky, Jung - 1994 ACM
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1988
57 A new deconstructive logic: Linear Logic - Danos, Joinet et al. - 1997
50 New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1994 ACM DBLP
50 Domains and Lambda-calculi (context) - Amadio, Curien - 1998 ACM
49 Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
40 Proof-nets: the parallel syntax for proof theory (context) - Girard - 1995
31 Concurrent games and full completeness - Abramsky, Mellies - 1998
29 Fair Games and Full Completeness for Multiplicative Linear L.. - Hyland, Ong - 1992
16 Annals of Pure and Applied Logic (context) - Blute, Scott et al. - 1996
15 Totality and Full Completeness (context) - Loader
8 Models of lambda calculi and linear logic: structural - Loader - 1994
3 AJM's games is a Model of Classical Linear Logic (context) - Baillot, Danos et al. - 1997
3 the Meaning of Logical Rules (context) - Girard - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.pps.jussieu.fr/~mellies/papers.html): More
Semantic Types: A Fresh Look at the Ideal Model for Types - Vouillon, Mellies, Diderot (2004) (Correct)
Double Categories: a modular model of multiplicative linear logic - Mellies (Correct)
Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004) (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