(Enter summary)
Abstract: Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, these two features conflict each other in design and implementation of a modern statically typed programming language. Flexibility is achieved by high-degree of polymorphism, which is based on generic primitives in an abstract model of computation, while efficiency requires optimal use of low-level primitives specialized to individual data structures. The... (Update)
Context of citations to this paper: More
.... compilation Another major motivation of this work comes from implementation of type directed specialization of polymorphism [17]. In this paradigm, type information is passed at runtime to achieve ecient implementation of polymorphic functions. This approach has been rst...
Cited by: More
Type Inference with Rank 1 Polymorphism for Type-Directed.. - Ohori, Yoshida (1998)
(Correct)
Similar documents (at the sentence level):
48.5%: Type Directed Specialization of Polymorphism - Ohori (1999)
(Correct)
Active bibliography (related documents): More All
1.4: A Polymorphic Record Calculus and Its Compilation - Ohori (1995)
(Correct)
0.4: Polymorphism and Type Inference in Database Programming - Buneman, Ohori (1994)
(Correct)
0.3: On the Type Structure of Standard ML - Harper, Mitchell (1992)
(Correct)
Similar documents based on text: More All
0.2: An Unboxed Operational Semantics for ML Polymorphism - Ohori, Takamizawa (1997)
(Correct)
0.1: Parallel Functional Programming on Recursively Defined Data.. - Nishimura, Ohori (1993)
(Correct)
0.1: A Polymorphic Calculus for Views and Object Sharing - Ohori, Tajima (1994)
(Correct)
BibTeX entry: (Update)
A. Ohori. Type-directed specialization of polymorphism. Journal of Information and Computation, 1999. To appear. A preliminary summary appeared in Proc. International Conference on Theoretical Aspects of Computer Software, Springer LNCS 1281, pages 107{ 137. http://citeseer.ist.psu.edu/article/ohori99typedirected.html More
@article{ ohori99typedirected,
author = "Atsushi Ohori",
title = "Type-Directed Specialization of Polymorphism",
journal = "Information and Computation",
volume = "155",
number = "1--2",
pages = "64--107",
year = "1999",
url = "citeseer.ist.psu.edu/article/ohori99typedirected.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
388
On understanding types (context) - Cardelli, Wegner - 1985
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982 DBLP
325
Towards a theory of type structure (context) - Reynolds - 1974
233
Natural semantics (context) - Kahn - 1987
210
TIL : A type-directed optimizing compiler for ML
- Tarditi, Morrisett et al. - 1996
186
Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995 ACM DBLP
178
Standard ML of New Jersey
- Appel, MacQueen - 1991 DBLP
162
Unboxed objects and polymorphic typing
- Leroy - 1992 ACM DBLP
139
Type systems for programming languages (context) - Mitchell - 1990 ACM DBLP
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996 ACM DBLP
103
The Denition of Standard ML (context) - Milner, Tofte et al. - 1990
101
ACM Transactions on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1993
87
Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1988
86
Intensional polymorphism in type-erasure semantics
- Crary, Weirich et al. - 1998 ACM DBLP
81
The ZINC experiment: an economical implementation of the ML ..
- Leroy - 1992
63
Tag-free garbage collection using explicit type parameters
- Tolmach - 1994 ACM DBLP
55
A compilation method for ML-style polymorphic record calculi
- Ohori - 1992
37
Polymorphism for imperative languages without imperative typ..
- Wright - 1993
34
Type classes in Haskell
- Hall, Hammond et al. - 1994 ACM DBLP
30
Polymorphic typing of an algorithmic language
- Leroy - 1992
24
Polymorphism and type inference in database programming
- Buneman, Ohori - 1996
18
Relational interpretations of recursive types in an operatio..
- Birkedal, Harper - 1997 ACM DBLP
18
Implementing type classes
- Peterson, Jones - 1993
13
Unboxed values as rst class citizens in a non-strict functio..
- Jones, Launchbury - 1991
12
A simple semantics for ML polymorphism (context) - Ohori - 1989 ACM DBLP
11
Compilation based on a calculus for explicit type passing
- Minamide - 1996
9
A theory of qualied types (context) - Jones - 1992
7
A functional representation of data structures with a hole
- Minamide - 1998 ACM DBLP
5
Logical predicates for intuitionistic linear type theories
- Hasegawa - 1999 ACM DBLP
5
A polymorphic unboxed calculus as an abstract machine for po.. (context) - Ohori, Takamizawa - 1997
5
A characterization of lambda denability in categorical model.. (context) - Alimohamed - 1995
4
Une extension de l'interpretation de godel a l'analyse (context) - Girard - 1971
4
The Objective Caml User's Manual (context) - Leroy - 1997
4
Polymorphic equality - no tags required
- Elsman - 1998
4
Inheritance as explicit coercion (context) - Breazu-Tannen, Coquand et al. - 1991
3
Report on programming language Haskel a non-strict (context) - Hudak, Jones et al. - 1992
2
Ecient representation of extensible records
- emy - 1994
1
explicit polymorphism and qualied types (context) - Jones - 1994
Documents on the same site (http://www.jaist.ac.jp/~ohori/list.html): More
An Equational Object-Oriented Data Model and its.. - Nishimura, Ohori, Tajima (1996)
(Correct)
Proof-Directed De-compilation of Low-Level Code - Katsumata, Ohori (2001)
(Correct)
A Curry-Howard Isomorphism for Compilation and Program Execution.. - Ohori (1999)
(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