J.M.E. Hyland, C.-H.L. Ong  Home/Search
Context Related
| stanford.edu/pub/j...longfcomplete.ps comlab.ox.ac.uk/pub/D...fcomplete.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: stanford.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a new category of finite, fair games, and winning strategies, and use it to provide a semantics for the multiplicative fragment of Linear Logic (mll) in which formulae are interpreted as games, and proofs as winning strategies. This interpretation provides a categorical model of mll which satisfies the property that every (history-free, uniformly) winning strategy is the denotation of a unique cut-free proof net. Abramsky and Jagadeesan first proved a result of this kind and they... (Update)
Context of citations to this paper: More
...by most naturally arising models of linear logic, is nevertheless omitted from pure linear logic. Seeking the real McCoy, Hyland and Ong [6] modify AJ s model to refute MIX by disallowing certain plays they characterize as unfair. This work was supported by ONR under grant...
.... have since been verified as canonical from a semantic perspective, with numerous full completeness results for MLL, e.g. [AJ94, HO93, Loa94, Tan97, BS96, DHPP99]. Furthermore, the identifications correspond to coherences of free star autonomous categories [BCST96] The problem...
Cited by: More
Concurrent Games and Full Completeness - Samson Abramsky Lfcs (1998) (Correct)
Proof Nets for Unit-free Multiplicative-Additive Linear Logic - Extended Dominic (2003) (Correct)
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
Active bibliography (related documents): More All
0.7: Explicit Substitution Internal Languages for Autonomous and.. - Koh, Ong (1999) (Correct)
0.4: Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (1994) (Correct)
0.2: Correspondence between operational and denotational semantics: the.. - Ong (1995) (Correct)
Similar documents based on text: More All
0.5: Unknown - It Was Pointed (Correct)
0.4: Evolving Games and Essential Nets for Ane Polymorphism - Murawski Ong Oxford (Correct)
0.3: Exhausting Strategies, Joker Games and Full Completeness for.. - Murawski, Ong (1999) (Correct)
Related documents from co-citation: More All
31: Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
15: Theoretical Computer Science (context) - Girard - 1987
12: Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
BibTeX entry: (Update)
J.M.E. Hyland and C.-H.L. Ong. Fair games and full completeness for multiplicative linear logic without the mix-rule. Available by ftp from ftp.comlab.ox.ac.uk as fcomplete.ps.gz in /pub/Documents/techpapers/Luke.Ong, 1993. http://citeseer.ist.psu.edu/hyland93fair.html More
@unpublished{ hyland93fair,
author = "J. M. E. Hyland and C.-H. L. Ong",
title = "Fair Games and Full Completeness for Multiplicative Linear Logic without the Mix-Rule",
year = "1993",
url = "citeseer.ist.psu.edu/hyland93fair.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1992
103 On Numbers and Games (context) - Conway - 1976
72 Archive for Mathematical Logic (context) - Danos, Regnier et al. - 1989
49 Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
43 Games semantics for linear logic (context) - Lafont, Streicher - 1991
32 Mathematical Structures in Computer Science (context) - Barr, categories et al. - 1991
22 Concurrency on automata and infinite sequences (context) - Park - 1981
13 Proof nets for multiplicative and additive linear logic (context) - Bellin - 1993
12 Fundamentals of Contemporary Set Theory (context) - Devlin - 1980
10 Remarques sur la theorie des jeux a deux personnes (context) - Joyal - 1977
5 Progress in Theoretical Computer Science Series (context) - Curien, Sequential et al. - 1993
5 Lecture Notes in Mathematics Vol (context) - Barr, categories - 1979
5 CSLI Lecture Notes No (context) - Troelstra, Linear et al. - 1992
4 Conway games and linear logic (context) - Hyland - 1990
2 cofree algebras and linear logic (context) - Seely, categories - 1989
1 the proof net problem for additives in linear logic (context) - Lamarche - 1993
1 On fair games and parallelism (context) - Huth - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/theory.stanford.edu.html): More
Partial Orderings of Event Sets and Their.. - Luckham, Vera.. (1992) (Correct)
Classes = Objects + Data Abstraction - Fisher (Correct)
An Efficient System For Geometric Assembly.. - Romney, Godard.. (1995) (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