(Enter summary)
Abstract: We motivate the design of a statically typed assembly language (TAL) and present a typepreserving
translation from System F to TAL. The TAL we present is based on a conventional
RISC assembly language, but its static type system provides support for enforcing high-level
language abstractions, such as closures, tuples, and objects, as well as user-defined abstract data
types. The type system ensures that well-typed programs cannot violate these abstractions. In
addition, the typing constructs... (Update)
Similar documents (at the sentence level):
21.2%: From System F to Typed Assembly Language - Morrisett, Walker, Crary, Glew (1998)
(Correct)
Active bibliography (related documents): More All
0.4: Stack-Based Typed Assembly Language - Morrisett, Crary, Glew, Walker (1998)
(Correct)
0.3: Flexible Type Analysis - Crary, Weirich (1999)
(Correct)
0.3: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
BibTeX entry: (Update)
@techreport{ morrisett97from,
author = "Greg Morrisett and David Walker and Karl Crary and Neal Glew",
title = "From System {F} to Typed Assembly Language (Extended Version)",
number = "TR97-1651",
month = "21,",
pages = "45",
year = "1997",
url = "citeseer.ist.psu.edu/morrisett97from.html" }
Citations (may not include all citations):
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1986
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1997 ACM
746
The Java Virtual Machine Specification (context) - Lindholm, Yellin - 1996
566
Proof-carrying code
- Necula - 1997 ACM DBLP
521
Compiling with Continuations (context) - Appel - 1992 ACM
400
safety and performance in the SPIN operating system (context) - Bershad, Savage et al. - 1995
339
Efficient software-based fault isolation
- Wahbe, Lucco et al. - 1993 ACM DBLP
325
Towards a theory of type structure (context) - Reynolds - 1974 ACM DBLP
311
Abstract types have existential type (context) - Mitchell, Plotkin - 1988 ACM DBLP
283
Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975 ACM
264
Safe kernel extensions without run-time checking
- Necula, Lee - 1996 ACM DBLP
254
Comprehending monads
- Wadler - 1990 ACM DBLP
220
ORBIT: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986 ACM DBLP
218
The mechanical evaluation of expressions (context) - Landin - 1964
215
Theoretical Computer Science (context) - Girard - 1987 ACM
210
TIL: A type-directed optimizing compiler for ML
- Tarditi, Morrisett et al. - 1996 DBLP
184
Linear types can change the world
- Wadler - 1990
178
Standard ML of New Jersey
- Appel, MacQueen - 1991 DBLP
162
Unboxed objects and polymorphic typing
- Leroy - 1992 ACM DBLP
146
The Glasgow Haskell compiler: a technical overview
- Jones, Hall et al. - 1993
138
Type inference for polymorphic references (context) - Tofte - 1990 ACM DBLP
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996 ACM DBLP
116
Rabbit: A compiler for Scheme (context) - Jr - 1978 ACM
89
closure-passing style (context) - Appel, Jim - 1989
83
From region inference to von Neumann machines via region rep..
- Birkedal, Tofte et al. - 1996 ACM DBLP
82
Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988 ACM DBLP
77
LISP and Symbolic Computation (context) - Launchbury, Jones et al. - 1995
71
Lambda calculus schemata
- Fischer - 1972 ACM
67
Inheritance as implicit coercion (context) - Breazu-Tannen, Coquand et al. - 1991 ACM DBLP
63
Tag-free garbage collection using explicit type parameters
- Tolmach - 1994 ACM DBLP
58
Simple imperative polymorphism
- Wright - 1995 ACM DBLP
56
Explicit polymorphism and CPS conversion
- Harper, Lillibridge - 1993 ACM DBLP
55
Representing control: a study of the CPS transformation
- Danvy, Filinski - 1992 DBLP
50
Semantics of memory management for polymorphic languages
- Morrisett, Harper - 1997 ACM
50
Flexible representation analysis
- Shao - 1997 ACM DBLP
43
A taste of linear logic
- Wadler - 1993 ACM DBLP
43
An overview of the FLINT/ML compiler
- Shao - 1997
40
Interpr'etation fonctionelle et 'elimination des coupures de.. (context) - Girard - 1972
34
Department of Computer Science (context) - Birkedal, Rothwell et al. - 1993
27
Partitioning dataflow analyses using types (context) - Ruf - 1997 ACM DBLP
25
ML compiler: Performance and safety through types (context) - Morrisett, Tarditi et al. - 1996
24
The effectiveness of type-based unboxing
- Leroy - 1997
23
Garbage collection for strongly-typed languages using run-ti..
- Aditya, Flood et al. - 1994 ACM DBLP
22
Correctness of procedure representations in higher-order ass.. (context) - Wand - 1992 ACM DBLP
18
Published as CMU Technical Report CMU-CS (context) - Morrisett, Types et al. - 1995
15
Strongly typed flow-directed reprsentation transformations (context) - Dimock, Muller et al. - 1997
15
Foundations for the implementation of higher-order subtyping
- Crary - 1997 ACM DBLP
12
Department of Computer Science (context) - Crary, Manual - 1996
7
de l'interpr'etation de Godel `a l'analyse, et son applicati.. (context) - Girard - 1971
Documents on the same site (http://cs.cornell.edu/home/jgm/papers.html): More
Typed Closure Conversion for Recursively-Defined Functions.. - Morrisett, Harper (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