Parametricity as Isomorphism - Robinson (ResearchIndex)

See this document in CiteSeerX!

Parametricity as Isomorphism (1993) (Make Corrections) (2 citations)
Edmund RobinsonTheoretical Computer Science

View or download:
di.uminho.pt/ftp/p...obinson.isos.ps.gz
Cached: PS.gz PS PDF Image Update Help

From: di.uminho.pt/ftp/pub/DI/F...clics (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: . We investigate a simple form of parametricity, based on adding "abstract" copies of pre-existing types. Connections are made with the Reynolds-Ma theory of parametricity by logical relations, with the theory of parametricity via dinaturality, and with the categorical notion of equivalence. Introduction In his fundamental paper on the notion of parametricity in connection with type theories [Rey83], John Reynolds links the notion of parametricity firmly to the notion of data abstraction.... (Update)

Similar documents based on text: More All
0.5: Using the Parametricity Theorem for Program Fusion - Fegaras (1996) (Correct)
0.5: Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (Correct)
0.5: Categorical Combinators for Charity - Vesely (1996) (Correct)

BibTeX entry: (Update)

E. P. Robinson. Parametricity as isomorphism. Theoretical Computer Science. Accepted for publication. http://citeseer.ist.psu.edu/robinson93parametricity.html More

@article{ robinson94parametricity,
    author = "Edmund Robinson",
    title = "Parametricity as isomorphism",
    journal = "Theoretical Computer Science",
    volume = "136",
    number = "1",
    pages = "163--181",
    year = "1994",
    url = "citeseer.ist.psu.edu/robinson93parametricity.html" }

Citations (may not include all citations):
562 Categories for the Working Mathematician (context) - Lane - 1971
97 and parametric polymorphism (context) - Reynolds, abstraction - 1983
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
53 Automatic synthesis of typed -programs on term algebras (context) - Bohm, Berarducci - 1985
50 Polymorphism is not set-theoretic (context) - Reynolds - 1984
39 Polymorphism is set-theoretic (context) - Pitts - 1987
16 A small complete category (context) - Hyland - 1987
15 Algebraic types in PER models (context) - Hyland, Robinson et al. - 1990
14 The discrete objects in the effective topos (context) - Hyland, Robinson et al. - 1990
8 Functorial parametricity (context) - Freyd, Robinson et al. - 1992
8 How complete is PER (context) - Robinson - 1989
7 Normal forms and cut-free proofs as natural transformations - Girard, Scedrov et al. - 1991
4 Two results on set-theoretic polymorphism (context) - Phoa - 1991
1 a and J.C. Reynolds. Types, abstraction, and parametricpolym.. (context) - Qing-Ming - 1991

Documents on the same site (http://www.di.uminho.pt/ftp/pub/DI/Fundamentos/Papers/mirror-ImperialCollege/AbramskyS/clics): More
Schematic Consequence - Aczel (1992) (Correct)
A Note on SDT in Filter Spaces - Moggi (1993) (Correct)
Constructing a Quasi-Uniform Function Space - S�nderhauf (1993) (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