A. S. Murawski, C.-H. L. Ong  Home/Search
Context
Related
Links: ACM DBLP | comlab.ox.ac.uk/pub/Doc...exhaust.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: comlab.ox.ac.uk/ou...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a game description of free symmetric monoidal closed categories, which can also be viewed as a fully complete model for the Intuitionistic Multiplicative Linear Logic with the tensor unit. We model the unit by a distinguished one-move game called Joker. Special rules apply to the joker move. Proofs are modelled by what we call conditionally exhausting strategies, which are deterministic and total only at positions where no joker move exists in the immediate neighbourhood, and satisfy ... (Update)
Active bibliography (related documents): More All
0.5: Dominator Trees and Fast Verification of Proof Nets - Murawski, Ong (2000) (Correct)
0.5: Can Safe Recursion Be Interpreted in Light Logic? - Murawski, Ong (Correct)
0.4: Internal Languages for Autonomous and *-Autonomous Categories - Koh, Ong (Correct)
Similar documents based on text: More All
0.6: Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (Correct)
0.5: Evolving Games and Essential Nets for Ane Polymorphism - Murawski Ong Oxford (Correct)
0.4: Fully Complete Minimal PER Models for the Simply Typed.. - Abramsky, Lenisa (Correct)
BibTeX entry: (Update)
@article{ murawski99exhausting,
author = "Andrzej S. Murawski and C.-H. Luke Ong",
title = "Exhausting Strategies, Joker Games and {IMLL} with Units",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "29",
year = "1999",
url = "citeseer.ist.psu.edu/murawski99exhausting.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
32 Mathematical Structures in Computer Science (context) - Barr, categories et al. - 1991
29 Fair games and full completeness for Multiplicative Linear L.. - Hyland, Ong - 1993
24 Coherence in closed categories (context) - Kelly, MacLane - 1971
16 Semantics of interaction: an introduction to game semantics (context) - Abramsky - 1997
6 Explicit substitution internal languages for autonomous and .. - Koh, Ong - 1999
3 Type theories for autonomous and -autonomous categories (context) - Koh, Ong - 1998
3 ftp-able from Ong's homepage (context) - Hyland, Ong et al. - 1997
3 Proof Nets for Intuitionistic Logic 1: Essential Nets (context) - Lamarche - 1994
2 A linear-time algorithm for verifying MLL proof nets via Lam.. - Murawski, Ong - 1999
Documents on the same site (http://www.comlab.ox.ac.uk/oucl/users/luke.ong/publications.html): More
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (Correct)
Non-Determinism in a Functional Setting (Extended Abstract) - Ong (1993) (Correct)
Correspondence between Operational and Denotational Semantics - Ong (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