Andrew W. Appel, David B. MacQueen  Home/Search
Context Related
| princeton.edu/fac/appel/papers/97.ps princeton.edu/faculty/appel/pap...97.ps ksu.edu/~hatcliff/...pelmacqueen.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: princeton.edu/fac/appel/vita (more) From: princeton.edu/faculty/appel/pa... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Standard ML is a major revision of earlier dialects of the functional language ML. We describe the first compiler written for Standard ML in Standard ML. The compiler incorporates a number of novel features and techniques, and is probably the largest system written to date in Standard ML. Great attention was paid to modularity in the construction of the compiler, leading to a successful large-scale test of the modular capabilities of Standard ML. The front end is useful for purposes other than... (Update)
Context of citations to this paper: More
...typed. Most existing ML implementations have taken this approach: they use one word representations and uniform calling conventions [6, 9, 4, 3]. This approach solves the problem of polymorphism, but results in a serious loss of eciency. For instance, tuples are always heap...
...initially bootstrapped from the Edinburgh compiler. An overview of this new compiler, known as Standard ML of New Jersey, is given in [1]. The implementation of modules in this new compiler went through two generations. A first version was done in the fall of 1986, but it was...
Cited by: More
Interfacing Compilers, Proof Checkers, and Proofs for Foundational.. - Wu (2005) (Correct)
Using ML as a Command Language - Steve Chapin Ryan (1990) (Correct)
Separate Compilation for Standard ML - Appel, MacQueen (1994) (Correct)
Active bibliography (related documents): More All
0.1: Types and Polymorphism in Persistent Programming Systems - Connor (1990) (Correct)
0.1: Optimizing Pattern Matching - Le Fessant, Maranget (2001) (Correct)
0.1: Semantics-Directed Code Generation - Appel (1985) (Correct)
Similar documents based on text: More All
0.3: A Critique of Standard ML - Appel (1992) (Correct)
0.2: Modules for Standard ML - MacQueen (1984) (Correct)
0.2: An Implementation of Standard ML Modules - David Macqueen Att (1988) (Correct)
Related documents from co-citation: More All
21: Compiling with Continuations (context) - Appel - 1992
19: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
19: ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1988
BibTeX entry: (Update)
Andrew W. Appel and David B. MacQueen. A Standard ML compiler. In Gilles Kahn, editor, Functional Programming Languages and Computer Architecture (LNCS 274), pages 301--324. Springer--Verlag, 1987. http://citeseer.ist.psu.edu/appel87standard.html More
@inproceedings{ appel87standard,
author = "Andrew W. Appel and David B. MacQueen",
title = "{A Standard {ML} Compiler}",
booktitle = "{Proceedings of the Conference on Functional Programming Languages and Computer Architecture}",
volume = "274",
publisher = "Springer, Berlin",
address = "Portland, Oregon, USA, September 14--16",
pages = "301--324",
year = "1987",
url = "citeseer.ist.psu.edu/appel87standard.html" }
Citations (may not include all citations):809 A Theory of Type Polymorphism in Programming (context) - Milner - 1978 DBLP
258 Miranda: a non-strict functional language with polymorphic t.. (context) - Turner - 1985 ACM DBLP
220 ORBIT: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986 ACM DBLP
173 A real-time garbage collector based on the lifetimes of obje.. - Lieberman, Hewitt - 1983 ACM DBLP
167 Generation scavenging: a non-disruptive high performance sto.. (context) - Ungar - 1984 DBLP
116 Rabbit: a compiler for Scheme (context) - Steele - 1978 ACM
106 The Categorical Abstract Machine (context) - Cousineau, Curien et al. - 1985 ACM DBLP
101 Garbage collection in a large LISP system (context) - Moon - 1984 ACM DBLP
95 Hope: an Experimental Applicative Language - Burstall, MacQueen et al. - 1980 DBLP
91 Code generation using tree matching and dynamic programming (context) - Aho, Ganapathi et al. - 1989 ACM DBLP
85 Garbage collection can be faster than stack allocation - Appel - 1987 ACM DBLP
83 Modules for Standard ML - MacQueen - 1985
83 Modules for Standard ML - MacQueen - 1984 ACM DBLP
81 A proposal for Standard ML (context) - Milner - 1984 ACM DBLP
59 Basic polymorphic typechecking - Cardelli - 1985 ACM DBLP
42 Compiling a functional language - Cardelli - 1984 ACM DBLP
30 The sharing of structure in theorem-proving programs (context) - Boyer, Moore - 1972
30 The Standard ML Core Language (context) - Milner - 1985
29 The functional abstract machine (context) - Cardelli - 1983
27 Type Assignment in Programming Languages (context) - Damas - 1985
22 A type discipline for program modules (context) - Harper, Milner et al. - 1987 ACM DBLP
20 Design of an Optimizing Compiler (context) - Wulf, Johnsson et al. - 1975
10 Formalization and automatic derivation of code generators (context) - Cattell - 1978
9 The Poly manual (context) - Matthews - 1985
9 The next 700 programming languages (context) - Landin - 1966 ACM DBLP
7 Tree Pattern Matching for ML (context) - Baudinet, MacQueen - 1986
1 An implementation of Standard ML in Poly - Matthews - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.princeton.edu/fac/appel/vita.html): More
Standard ML of New Jersey - Appel, MacQueen (1991) (Correct)
Continuation-Passing, Closure-Passing Style - Andrew Appel (1989) (Correct)
Vectorized Garbage Collection - Andrew Appel (1990) (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