A. S. Murawski C.-H. L. Ong Oxford University Computing Laboratory Wolfson...  Home/Search
Context Related
| web.comlab.ox.ac.uk/oucl...affine.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: This paper presents a game model of Second-order Intuitionistic Multiplicative Ane Logic (IMAL2). We extend Lamarche's essential nets to the second-order ane setting and use them to show that the model is fully and faithfully complete. (Update)
Context of citations to this paper: More
...full abstraction for System F. His model is somewhat complex due to its direct representation of type instantiation. Murawski and Ong [21] substantially simplify Hughes approach, but do not obtain full abstraction for impredicative polymorphism. Abramsky and Lenisa [3, 4]...
...proves full abstraction for System F, though the result arguably relies on the somewhat syntactic nature of the model. Murawski and Ong [29] substantially simplify Hughes approach, but do not obtain full abstraction for impredicative polymorphism. Abramsky and Lenisa [5, 6]...
Cited by: More
Genericity and the π-Calculus - Berger, Honda, Yoshida (Correct)
Genericity and the pi-Calculus - Berger, Honda, Yoshida (Correct)
Similar documents (at the sentence level):
5.5%: On Semantic and Type-Theoretic - Aspects Of Polynomial-Time (Correct)
Active bibliography (related documents): More All
1.9: Evolving Games and Essential Nets for Affine Polymorphism - Murawski, Ong (Correct)
0.3: A Linear-time Algorithm for Verifying MLL Proof Nets via.. - Murawski, Ong (1999) (Correct)
0.2: Discreet Games, Light Affine Logic and PTIME Computation - Murawski, Ong (Correct)
Similar documents based on text: More All
0.7: Dominator Trees and Fast Verification of Proof Nets - Murawski, Ong (2000) (Correct)
0.6: A Linear-time Algorithm for Verifying MLL Proof Nets via.. - Murawski, Ong (1999) (Correct)
0.5: Exhausting Strategies, Joker Games and Full Completeness for.. - Murawski, Ong (1999) (Correct)
Related documents from co-citation: More All
5: Sequentiality and the -Calculus (context) - Berger, Honda et al. - 2044
5: Game-theoretic Analysis of Call-by-value Computation - Honda, Yoshida - 1997
3: Games and de nability for system F (context) - Hughes - 1997
BibTeX entry: (Update)
Murawski, A., and Ong, C.-H. L. Evolving games and essential nets for ane polymorphism. In Proc. of TLCA'01 (2001), no. 2044 in LNCS, Springer. http://citeseer.ist.psu.edu/480546.html More
@misc{ murawski01evolving,
author = "A. Murawski and C. Ong",
title = "Evolving games and essential nets for ane polymorphism",
text = "Murawski, A., and Ong, C.-H. L. Evolving games and essential nets for ane
polymorphism. In Proc. of TLCA'01 (2001), no. 2044 in LNCS, Springer.",
year = "2001",
url = "citeseer.ist.psu.edu/480546.html" }
Citations (may not include all citations):175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
72 Archive for Mathematical Logic (context) - Danos, Regnier - 1989
68 On Full Abstraction for PCF (context) - Hyland, Ong - 2000
21 Light linear logic - Girard - 1998
16 Proof Nets for Intuitionistic Linear Logic 1: Essential Nets (context) - Lamarche - 1994
16 Semantics of Interaction: an introduction to Game Semantics (context) - Abramsky
15 A Fully-complete PER Model for ML Polymorphic Types - Abramsky, Lenisa
11 Light ane logic (context) - Asperti - 1998
8 Joker Games and Full Completeness for IMLL with Unit (context) - Murawski, Ong - 1999
7 A universal innocent game model for the Bohm tree lambda th.. (context) - Ker, Nickau et al.
6 Quantiers in Linear Logic II (context) - Girard - 1991
4 Dominator Trees and Fast Verication of Proof Nets (context) - Murawski, Ong - 2000
2 Games and denability for System F (context) - Hughes - 1997
2 Light Ane Logic and PTIME Computation (context) - Murawski, Ong
1 Games for System F (context) - Nickau, Ong - 1999
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/andrzej.murawski/): More
Discreet Games, Light Affine Logic and PTIME Computation - Murawski, Ong (Correct)
On Semantic and Type-Theoretic - Aspects Of Polynomial-Time (Correct)
On Program Equivalence in Languages with Ground-Type.. - Andrzej Murawski Oxford (2003) (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