(Enter summary)
Abstract: We propose several calculi for explicit type passing that enable us to formalize
compilation of polymorphic programming languages like ML as phases of typepreserving
translations. In our calculi various manipulations for type parameters
can be expressed without typing problems---this is impossible in the polymorphic
-calculi. Furthermore, we develop the translation from an explicit typed source
calculus similar to Core-XML to one of the proposed calculi which completely
eliminates runtime... (Update)
Context of citations to this paper: More
...The semantic preservation can then be shown that the meaning of the translated term is related to the meaning of the source term. In [31, 25], such proofs are carried out. We believe that for each concrete instance of our framework, those technique can be adopted. However, a...
.... 6 Related Work Closely related to our work is the work of Minamide on lifting of type parameters for tag free garbage collection [14]. Minamide was interested in lifting type parameters out of code so they could be preallocated at compile time. His lifting procedure...
Cited by: More
Intensional Polymorphism in Type-Erasure Semantics - Crary, Weirich, Morrisett (1998)
(Correct)
A Functional Representation of Data Structures with a Hole - Yasuhiko Minamide Research (1998)
(Correct)
Type-Directed Specialization of Polymorphism - Ohori (1999)
(Correct)
Similar documents (at the sentence level):
32.8%: Full Lifting of Type Parameters - Minamide (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (1995)
(Correct)
0.3: Typed Closure Conversion - Yasuhiko Minamide Greg
(Correct)
0.3: No Type Stamps and No Structure Stamps - a.. - Grosch (1995)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Runtime Behavior of Conversion Interpretation of Subtyping - Minamide
(Correct)
0.3: Selective Tail Call Elimination - Minamide (2003)
(Correct)
0.2: Static Approximation of Dynamically Generated Web Pages - Minamide (2005)
(Correct)
Related documents from co-citation: More All
10: TIL: A type-directed optimizing compiler for ML
- Tarditi, Morrisett et al. - 1995
9: Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995
9: Typed closure conversion
- Minamide, Morrisett et al. - 1996
BibTeX entry: (Update)
Y. Minamide. Full lifting of type parameters. Submitted for publication. Earlier version published as "Compilation Based on a Calculus for Explicit Type-Passing" in the Second Fuji International Workshop on Functional and Logic Programming, 1996. http://citeseer.ist.psu.edu/minamide96compilation.html More
@misc{ minamide96compilation,
author = "Y. Minamide and l of and p Submitted and p Earlier and p as",
title = "Compilation Based on a Calculus for Explicit Type-Passing",
text = "Y. Minamide. Full lifting of type parameters. Submitted for publication.
Earlier version published as Compilation Based on a Calculus for Explicit
Type-Passing in the Second Fuji International Workshop on Functional and
Logic Programming, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/minamide96compilation.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tafte et al. - 1990
521
Compiling with Continuation (context) - Appel - 1992
215
A type-theoretic approach to higher-order modules
- Harper, Lillibridge - 1994
210
TIL: A type-directed optimizing compiler for ML
- Tarditi, Morrisett et al. - 1996
190
How to make ad-hoc polymorphism less ad hoc
- Wadler, Blott - 1989
186
Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995
162
Unboxed objects and polymorphic typing
- Leroy - 1992
155
The essence of compiling with continuations
- Flanagan, Sabry et al. - 1993
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996
128
and separate compilation (context) - Leroy, modules - 1994
121
Intensional interpretation of functionals of finite type (context) - Tait - 1967
101
ACM Transaction on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1993
79
A type-based compiler for Standard ML
- Shao, Appel - 1995
63
Tag-free garbage collection using explicit type parameters
- Tolmach - 1994
55
A compilation method for ML-style polymorphic record calculi
- Ohori - 1992
54
A polymorphic record calculus and its compilation
- Ohori - 1995
53
Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
49
A theory of qualified types
- Jones - 1992
43
Formally optimal boxing (context) - Henglein, Jorgensen - 1994
42
An ad hoc approach to the implementation of polymorphism
- Morrison, Dearle et al. - 1991
41
Equality between functionals (context) - Friedman - 1975
37
Polymorphism for imperative languages without imperative typ..
- Wright - 1993
30
Information and Control (context) - Statman, the et al. - 1985
8
explicit polymorphism and qualified types (context) - Jones - 1994
7
Minimal typing derivations
- Bjorner - 1994
6
and lambda-definability (context) - Statman, invariance - 1982
4
Generic polymorphism (context) - Dubois, Weis - 1995
3
The ML Kit Version
- Birkedal, Rothwell et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.score.is.tsukuba.ac.jp/~minamide/papers.html): More
On the Runtime Complexity of Type-Directed Unboxing - Minamide (1998)
(Correct)
Typed Closure Conversion - Minamide, Morrisett, Harper (1996)
(Correct)
Typed Closure Conversion - Minamide, Morrisett, Harper (1996)
(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