Samson Abramsky and Radha Jagadeesan Oxford University Computing Laboratory...  Home/Search
Context Related
| web.comlab.ox.ac.uk/oucl...fossacs04.ps 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/w...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Genericity is the idea that the same program can work at many di erent data types. Longo, Milsted and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type 8X: A[X], are equal at any given instance A[T ], then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but nding a semantically... (Update)
Similar documents based on text: More All
0.5: Full Abstraction for PCF - Samson Abramsky University (1994) (Correct)
0.5: A Game Semantics For Generic Polymorphism - Abramsky, Jagadeesan (1971) (Correct)
0.4: Approximate Reasoning for Real-Time Probabilistic Processes - Gupta, Jagadeesan.. (2006) (Correct)
BibTeX entry: (Update)
Abramsky, S., and Jagadeesan, R. A game semantics for generic polymorphism. In Proc. FOSSACS'03 (April 2003), no. 2620 in LNCS, Springer, pp. 1-22. http://citeseer.ist.psu.edu/article/abramsky03game.html More
@misc{ abramsky03game,
author = "S. Abramsky and R. Jagadeesan",
title = "A game semantics for generic polymorphism",
text = "Abramsky, S., and Jagadeesan, R. A game semantics for generic polymorphism.
In Proc. FOSSACS'03 (April 2003), no. 2620 in LNCS, Springer, pp. 1-22.",
year = "2003",
url = "citeseer.ist.psu.edu/article/abramsky03game.html" }
Citations (may not include all citations):325 Towards a Theory of Type Structure (context) - Reynolds - 1974
268 Proofs and Types (context) - Girard, Lafont et al. - 1989
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1994
147 Abstraction and Parametric Polymorphism (context) - Reynolds - 1983
144 Full Abstraction for PCF - Abramsky, Jagadeesan et al. - 2000
94 The Foundations of Esterel - Berry - 2000
58 A Logic for Parametric Polymorphism - Plotkin, Abadi - 1993
38 Semantics of Interaction - Abramsky - 1997
37 Formal Parametric Polymorphism - Abadi, Cardelli et al. - 1993
34 Equality in hyperdoctrines and the comprehension schema as a.. (context) - Lawvere - 1970
21 Annals of Pure and Applied Logic (context) - Hyland, complete - 1988
15 A Fully-complete PER Model for ML Polymorphic Types - Abramsky, Lenisa - 2000
12 Polymorphism is set-theoretic constructively (context) - Pitts - 1988
11 Abstraction and Parametric Polymorphism (context) - Ma, Reynolds - 1992
11 Games for Recursive Types - Abramsky, McCusker - 1995
[Article contains additional citations not shown here]
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/pubs.html): More
High-Level Methods for Quantum Computation and Information - Samson Abramsky Oxford (Correct)
A Categorical Semantics of Quantum Protocols - Samson Abramsky And (2004) (Correct)
Nominal Games and Full Abstraction for the Nu-Calculus - Abramsky, Ghica.. (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