See this document in CiteSeerX!

Compiling Polymorphism Using Intensional Type  (Make Corrections)  (186 citations)
Analysis Robert Harper Greg Morrisett September 2, 1994 CMU-CS-94-185...
Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages



  Home/Search   Context   Related

 
View or download:
cmu.edu/anon/1994/CMUCS94185.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: Types have been used to describe the size and shape of data structures at compile time. In polymorphic languages or languages with abstract types, this is not possible since the types of some objects are not known at compile time. Consequently, most implementations of polymorphic languages box data (i.e., represent an object as a pointer), leading to inefficiencies. We introduce a new compilation method for polymorphic languages that avoids the problems associated with boxing data. The... (Update)

Cited by:   More
Typed Closure Conversion - Yasuhiko Minamide Greg   (Correct)
Sound and Complete Elimination of Singleton Kinds - Crary (2005)   (Correct)
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000)   (Correct)

Similar documents (at the sentence level):
35.4%:   Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (1995)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Applicative Programming and Specification - Gilmore (1993)   (Correct)
0.3:   Advanced Languages for Systems Software The Fox Project in 1994 - Harper, Lee (1994)   (Correct)
0.3:   Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)   (Correct)

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

Related documents from co-citation:   More   All
45:   Unboxed objects and polymorphic typing - Leroy - 1992
41:   TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1995
35:   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990

BibTeX entry:   (Update)

@inproceedings{ harper95compiling,
    author = "Robert Harper and Greg Morrisett",
    title = "Compiling Polymorphism Using Intensional Type Analysis",
    booktitle = "Conference Record of {POPL} '95: 22nd {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
    address = "San Francisco, California",
    pages = "130--141",
    year = "1995",
    url = "citeseer.ist.psu.edu/harper95compiling.html" }
Citations (may not include all citations):
521   Compiling with Continuations (context) - Appel - 1992
384   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
325   Towards a theory of type structure (context) - Reynolds - 1974
311   Abstract types have existential type (context) - Mitchell, Plotkin - 1988
190   How to make ad hoc polymorphism less ad hoc - Wadler, Blott - 1989
165   Set-based analysis of ML programs (context) - Heintze - 1994
162   Unboxed objects and polymorphic typing - Leroy - 1992
157   Soft typing with conditional types - Aiken, Wimmers et al. - 1994
129   A system of constructor classes: overloading and implicit hi.. - Jones - 1993
121   Higher-order modules and the phase distinction - Harper, Mitchell et al. - 1990
101   ACM Transactions on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1993
101   ACM Transactions on Programming Languages and Systems (context) - Constable, Zlatin et al. - 1984
97   and parametric polymorphism (context) - Reynolds, abstraction - 1983
85   Abstract models of memory management (context) - Morrisett, Felleisen et al. - 1994
81   The ZINC experiment: an economical implementation of the ML .. - Leroy - 1990
79   Computer Science Department (context) - Constable, of et al. - 1982
78   Soft typing - Cartwright, Fagan - 1991
76   DEC Systems Research Center (context) - Cardelli, Technical - 1989
65   A practical soft type system for scheme - Wright, Cartwright - 1994
63   Tag-free garbage collection using explicit type parameters - Tolmach - 1994
55   A compilation method for ML-style polymorphic record calculi - Ohori - 1992
53   The semantics of reflected proof - Allen, Constable et al. - 1990
48   Polymorphic type assignment and CPS conversion - Harper, Lillibridge - 1993
48   Polymorphic type assignment and CPS conversion - Harper, Lillibridge - 1992
46   Reflection and semantics in LISP (context) - Smith - 1984
44   Uber eine bisher noch nicht benutzte Erweiterung des finiten.. (context) - Godel - 1958
43   Formally optimal boxing (context) - Henglein, Jrgensen - 1994
42   An ad hoc approach to the implementation of polymorphism - Morrison, Dearle et al. - 1991
40   Unboxed values as first-class citizens (context) - Jones, Launchbury - 1991
39   A simple applicative language: Mini-ML (context) - Cl'ement, Despeyroux et al. - 1986
38   de l'interpr'etation de Godel `a l'analyse, et son applicati.. (context) - Girard - 1971
37   Polymorphism for imperative languages without imperative typ.. - Wright - 1993
35   The essence of ML (context) - Mitchell, Harper - 1988
33   Implementing Haskell overloading - Augustsson - 1993
29   A theory of type polymorphism in programming languages (context) - Milner - 1978
28   Quasi-static typing (context) - Thatte - 1990
25   ACM Transactions on Programming Languages and Systems (context) - Abadi, Cardelli et al. - 1991
22   Phase distinctions in type theory - Cardelli
22   Semantics for communication primitives in a polymorphic lang.. - Ohori, Kato - 1993
18   About models for intuitionistic type theories and the notion.. (context) - Martin-Lof - 1975
16   Report on the programming language Haskell (context) - Hudak, Jones et al. - 1992
15   Inheritance as implicit coercion - Breazu-Tannen, Coquand et al. - 1991
10   terms and Proof Theory (context) - Stenlund - 1972
9   Elimination des Coupures dans l'Arithm'etique d'Ordre Sup'er.. (context) - Girard, et - 1972
8   Representation analysis for efficient implementation of poly.. (context) - Poulsen - 1993
8   explicit polymorphism and qualified types (context) - Jones - 1994
8   Polymorphism by name (context) - Leroy - 1993
7   Semantics of type classes revisited (context) - Thatte - 1994
6   Research Report YALEUDCRR (context) - for, Research et al. - 1993
5   Technical Report CS--TR (context) - Appel, of et al. - 1992
3   Computing ML equality kinds using abstract interpretation (context) - Gunter, Gunter et al. - 1993
3   Currently available as Technical Monograph PRG-106 (context) - Jones, Theory et al. - 1992



The graph only includes citing articles where the year of publication is known.


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