See this document in CiteSeerX!

Compiling with Non-Parametric Polymorphism  (Make Corrections)  
(Preliminary Report) Robert Harper and Greg Morrisett February 1994...



  Home/Search   Context   Related

 
View or download:
cmu.edu/anon/1994/CMUCS94122.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/anon/1994/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depend upon a type parameter but is restricted to being defined at all types in an inductive fashion. We call such polymorphism non-parametric. We show how nonparametric polymorphism can be used to implement a variety of useful language mechanisms including overloading, unboxed data representations in the presence of ML-style polymorphism, and canonical representations of equivalent types. We show... (Update)

Similar documents (at the sentence level):
78.9%:   Compiling with Non-Parametric Polymorphism (Preliminary Report) - Robert Harper   (Correct)

Active bibliography (related documents):   More   All
0.3:   Inductive Data Types: Well-ordering Types Revisited - Goguen, Luo (1992)   (Correct)
0.1:   Compiling Polymorphism Using Intensional Type - Analysis Robert Harper   (Correct)
0.1:   Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (1995)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ robert-compiling,
  author = "Preliminary Report Robert",
  title = "Compiling with Non-Parametric Polymorphism",
  url = "citeseer.ist.psu.edu/763318.html" }
Citations (may not include all citations):
1074   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990  ACM
521   Compiling with Continuations (context) - Appel - 1992
306   A syntactic approach to type soundness - Wright, Felleisen - 1991  ACM   DBLP
190   How to make ad hoc polymorphism less ad hoc - Wadler, Blott - 1989
178   Standard ML of New Jersey - Appel, MacQueen - 1991  DBLP
162   Unboxed objects and polymorphic typing - Leroy - 1992  ACM   DBLP
63   Tag-free garbage collection using explicit type parameters - Tolmach - 1994  ACM   DBLP
56   Explicit polymorphism and CPS conversion - Harper, Lillibridge - 1993
55   A compilation method for ML-style polymorphic record calculi - Ohori - 1992  ACM   DBLP
51   Fundamental concepts in programming languages (context) - Strachey - 1967
42   An ad hoc approach to the implementation of polymorphism - Morrison, Dearle et al. - 1991
39   A simple applicative language: Mini-ML (context) - Cl'ement, Despeyroux et al. - 1986  ACM   DBLP
37   Polymorphism for imperative languages without imperative typ.. - Wright - 1993
34   Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986  DBLP
33   Implementing Haskell overloading - Augustsson - 1993  ACM   DBLP
3   Recursive Definition in Type Theory (context) - Mendler - 1987

Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/1994/):   More
Problems in Rewriting applied to Categorical Concepts by the.. - Gehrke (1994)   (Correct)
Visual Tracking of Self-Occluding Articulated Objects - Rehg, Kanade (1995)   (Correct)
Reducing Network Depth in the Cascade-Correlation Learning.. - Baluja, al. (1994)   (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