Zhong Shao  Home/Search
Context Related
| yale.edu/pub/flint/p...zshthesis.ps.gz princeton.edu/techreports/19...475.ps.Z yale.edu/flint/publi...zshthesis.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 From: yale.edu/HTML/YALE/CS/Hy...papers (more) From: yale.edu/flint/publi...zshthesis (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many language theoreticians have taken great efforts in designing higher-level programming languages that are more elegant and more expressive than conventional languages. However, few of these new languages have been implemented very efficiently. The result is that most software engineers still prefer to use conventional languages, even though the new higherlevel languages offer a better and simpler programming model. This dissertation concentrates on improving the performance of programs... (Update)
Context of citations to this paper: More
.... can get for different typebased optimizations, we have measured the performance of six different compilers on twelve SML benchmarks [20, 19]. 8 The six compilers we use are all simple variations of the Standard ML of New Jersey compiler version 1.03z. All of these compilers use...
.... is to adapt Leroy s wrapping unwrapping technique for representation analysis [7] refinements of which have been studied by Shao [15, 16]. Recall the example of structure F with its abstract type F.t from the beginning of this section. We can retain knowledge of the...
Cited by: More
Strongly Typed Flow-Directed Representation Transformations - Dimock, Muller, Turbak.. (1997) (Correct)
A Typed Intermediate Language for Flow-Directed Compilation - Wells, Dimock, Muller.. (1997) (Correct)
Using Program Structure to Guide Optimization in the Presence of.. - Tarditi (1994) (Correct)
Similar documents (at the sentence level):
13.3%: An Empirical and Analytic Study of Stack vs. Heap Cost for.. - Appel, Shao (1993) (Correct)
7.9%: Space-Efficient Closure Representations - Shao, Appel (1994) (Correct)
6.5%: Unrolling Lists - Shao, Reppy, Appel (1994) (Correct)
Active bibliography (related documents): More All
0.9: Cache Performance of Fast-Allocating Programs - Gonçalves, Appel (1994) (Correct)
0.7: A Type-Based Compiler for Standard ML - Shao, Appel (1994) (Correct)
0.6: Hierarchical Modularity And Intermodule Optimization - Blume (1997) (Correct)
Similar documents based on text: More All
0.2: Algorithms and Arrays for Computing on Massive Data Sets - Gum (2001) (Correct)
0.2: Multiobjective Synthesis of Low-Power Real-Time Distributed.. - Dick (2002) (Correct)
0.1: Flexible Representation Analysis - Shao (1997) (Correct)
Related documents from co-citation: More All
15: Compiling with Continuations (context) - Appel - 1992
11: Unboxed objects and polymorphic typing - Leroy - 1992
10: Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
BibTeX entry: (Update)
Zhong Shao. Compiling Standard ML for Efficient Execution on Modern Machines. PhD thesis, Princeton University, Princeton, New Jersey, November 1994. http://citeseer.ist.psu.edu/shao94compiling.html More
@techreport{ shao94compiling,
author = "Zhong Shao",
title = "Compiling Standard {ML} for Efficient Execution on Modern Machines (Thesis)",
number = "TR-475-94",
pages = "169",
year = "1994",
url = "citeseer.ist.psu.edu/shao94compiling.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. - 1990
809 A theory of type polymorphism in programming (context) - Milner - 1978
521 Compiling with Continuations (context) - Appel - 1992
369 A Semantics of Multiple Inheritance - Cardelli - 1984
362 ML for the Working Programmer (context) - Paulson - 1991
343 Principal type-schemes for functional programs (context) - Damas, Milner - 1982
283 Theoretical Computer Science (context) - Plotkin, Call-by-Value et al. - 1975
257 Report on the Programming Language Haskell (context) - Hudak, Jones et al. - 1992
257 Force Calculation Algorithm (context) - Barnes, Hut et al. - 1986
220 ORBIT: An optimizing compiler for Scheme (context) - Kranz - 1987
220 ORBIT: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
218 The mechanical evaluation of expressions (context) - Landin - 1964
216 Register Allocation and Spilling via Graph Coloring (context) - Chaitin - 1982
215 A Type-Theoretic Approach to HigherOrder Modules with Sharin.. - Harper, Lillibridge - 1994
210 Its Syntax and Semantics (context) - Barendregt, Calculus - 1984
210 Implementing lazy functional languages on stock hardware: th.. - Jones - 1992
197 Revised Report on the Algorithmic Language Scheme - Rees, Clinger - 1986
190 List Processing in Real Time on a Serial Computer - Baker - 1978
190 How to make ad hoc polymorphism less ad hoc - Wadler, Blott - 1989
186 Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett - 1995
185 The Calculi of Lambda Conversion (context) - Church - 1941
178 Standard ML of New Jersey - Appel, MacQueen - 1991
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
173 A Real-Time Garbage Collector Based on the Lifetimes of Obje.. - Lieberman, Hewitt - 1983
163 Commentary on Standard ML (context) - Milner, Tofte - 1991
162 Unboxed objects and polymorphic typing - Leroy - 1992
159 CML: A Higher-order Concurrent Language (context) - Reppy - 1991
139 Recursive functions of symbolic expressions and their comput.. - McCarthy - 1960
128 and Separate Compilation (context) - Leroy, Modules - 1994
123 Simple Generational Garbage Collection and Fast Allocation - Appel - 1989
116 Rabbit: a compiler for Scheme (context) - Steele - 1978
109 The Implementation of Functional Programming Languages (context) - Jones - 1987
108 Coloring Heuristics for Register Allocation (context) - Briggs, Cooper et al. - 1989
106 The Categorical Abstract Machine (context) - Cousineau, Curien et al. - 1985
103 A Case for Direct-Mapped Caches (context) - Hill - 1988
95 Virtual Memory Primitives for User Programs - Appel, Li - 1991
95 Elements of Functional Programming (context) - Reade - 1989
89 Closure-Passing Style (context) - Appel, Jim - 1989
86 A correspondence between Algol 60 and Church's lambda notati.. (context) - Landin - 1965
85 Garbage Collection can be Faster than Stack Allocation - Appel - 1987
85 Cache Write Policies and Performance - Jouppi - 1993
84 The Design and Evaluation of A High Performance Smalltalk Sy.. (context) - Ungar - 1986
83 Modules for Standard ML - MacQueen - 1984
81 Refinement Types for ML - Freeman, Pfenning - 1991
79 Elements of ML Programming (context) - Ullman - 1993
73 Unboxed Values as First Class Citizens in a Non-Strict Funct.. - Jones, Launchbury - 1991
69 Typing First-Class Continuations in ML - Duba, Harper et al. - 1991
68 Performance and Evaluation of Lisp Systems (context) - Gabriel - 1985
67 Representing Control in the Presence of First-Class Continua.. - Hieb, Dybvig et al. - 1990
66 Views: A way for pattern matching to cohabit with data abstr.. - Wadler - 1987
65 A semantics for higher order functors - MacQueen, Tofte - 1994
65 Lisp and Symbolic Computation (context) - Appel, System - 1990
63 and Application of Functional Programming Languages (context) - Hudak, Evolution - 1989
59 Smartest Recompilation - Shao, Appel - 1993
57 Continuation-Based Multiprocessing - Wand - 1980
55 Space-Efficient Closure Representations - Shao, Appel - 1994
53 Realistic Compilation by Program Transformation - Kelsey, Hudak - 1989
50 Elimination Algorithms for Data Flow Analysis (context) - Ryder, Paull - 1986
49 A theory of qualified types - Jones - 1992
49 Heap Profiling of Lazy Functional Programs - Runciman, Wakeling - 1993
47 Minimizing Register Usage Penalty at Procedure Calls (context) - Chow - 1988
46 Caching Considerations for Generational Garbage Collection - Wilson, Lam et al. - 1992
43 Formally Optimal Boxing (context) - Henglein, Jorgensen - 1994
42 Compiling a functional language - Cardelli - 1984
37 Lawrence Livermore Laboratory (context) - Crowley, Hendrickson et al. - 1978
35 Lisp Machine Manual (context) - Weinreb, Moon - 1981
34 Lambda Lifting: Transforming Programs to Recursive Equations - Johnsson - 1985
30 The Sharing of Structure in Theorem-Proving Programs (context) - Boyer, Moore - 1972
29 Memory subsystem performance of programs using copying garba.. - Diwan, Tarditi et al. - 1994
29 An Empirical and Analytic Study of Stack vs (context) - Appel, Shao - 1994
28 A lexical analyzer generator for Standard ML (context) - Appel, Mattson et al. - 1989
28 ACM Transactions on Programming Languages and Systems (context) - Bobrow, Clark et al. - 1979
27 Implementation Strategies for Continuations (context) - Clinger, Hartheimer et al. - 1988
25 Callee-save Registers in ContinuationPassing Style - Appel, Shao - 1992
25 The Effect of Garbage Collection on Cache Performance - Zorn - 1991
25 Performance Features of the PA7100 Microprocessor (context) - Asprey, Averill et al. - 1993
24 Introduction to Standard ML (context) - Harper - 1986
23 Safety considerations for storage allocation optimizations (context) - Chase - 1988
22 An Empirical Study of List Structure in Lisp (context) - Clark, Green - 1977
22 A High-Performance Garbage Collector for Standard ML - Reppy - 1993
21 Cache Performance of Garbage-Collected Programs - Reinhold - 1994
21 Distributed with Standard ML of New Jersey (context) - MacQueen - 1988
21 Distributed with Standard ML of New Jersey (context) - Tarditi, Appel et al. - 1990
17 SIMPLE: An Exercise in Future Scientific Programming (context) - Ekanadham - 1987
16 Abstract Value Constructors (context) - Aitken, Reppy - 1992
14 Memory Allocation and Higher-Order Functions (context) - Danvy - 1987
13 Unrolling Lists - Shao, Reppy et al. - 1994
13 Untagged data in tagged environments: choosing optimal repre.. (context) - Peterson - 1989
12 Incremental Recompilation for Standard ML of New Jersey - Harper, Lee et al. - 1994
12 Data Cache and Storage Control Units (context) - Hardell, Hicks et al. - 1990
12 Testing flow graph reducibility (context) - Tarjan - 1974
11 A portable and optimizing backend for the SML/NJ compiler - George, Guillaume et al. - 1994
11 Efficient Stack Allocation for Tail-Recursive Languages (context) - Hanson - 1990
11 Digital Equipment Corporation (context) - Steele, LISP et al. - 1984
10 Globalization and Live Variables (context) - Gomard, Sestoft - 1991
10 Some Issues and Strategies in Heap Management and Memory Hie.. (context) - Wilson - 1991
10 Using Multilisp for solving constraint satisfaction problems.. - Feeley, Turcotte et al. - 1994
9 The principle type scheme of an object in combinatory logic (context) - Hindley - 1969
9 Compact List Representation: Definition (context) - Hansen - 1969
8 Characterization of Object Behaviour in Standard ML of New J.. (context) - Stefanovic, Eliot et al. - 1994
8 Representation Analysis for Efficient Implementation of Poly.. (context) - Poulsen - 1993
8 Principal Signatures for High-order ML Functors (context) - Tofte - 1992
8 Software -- Practice and Experience (context) - Li, Hudak et al. - 1986
7 A Lisp machine with very compact programs (context) - Deutsch - 1973
7 Computability and -definability (context) - Turing - 1937
6 Optimizing Closure Environment Representations (context) - Appel, Jim - 1988
6 A note on hash linking (context) - Bobrow - 1975
6 A Portable Storage Management System for the Icon Programmin.. (context) - Hanson - 1980
6 Using Hindley-Milner Type Inference to Optimize List Represe.. (context) - Hall - 1994
6 SPEC Benchmark Suite Release (context) - Evaluation - 1989
5 List structure: measurements (context) - Clark - 1976
5 Technical Report CS-TR (context) - Shao, Appel - 1992
5 The Dream of a Lifetime: A Lazy Variable Extent Mechanism (context) - Steele, Sussman - 1980
4 LISP Machine Progress Report memo (context) - Greenblatt - 1977
4 AA Microprocessor Hardware Reference Manual (context) - Corp, MA et al. - 1992
4 Technical Report PMG memo (context) - Augustsson, in et al. - 1989
4 Minimial Typing Derivations (context) - Bjorner - 1994
4 The Buried Binding and Stale Binding Problems of LISP (context) - Baker - 1976
4 Multiprocessing Aspects of the PowerPC (context) - Allen, Becker - 1993
4 Loop Headers in -calculus or CPS (context) - Appel - 1994
4 Carnegie Mellon University (context) - Freeman - 1992
3 Emulating Write-Allocate on a No-Write-Allocate Cache - Appel - 1994
3 Re: stack scanning for generational g (context) - Doligez, Gonthier - 1994
2 of Computer Science and Electrical Engineering (context) - Rozas, an et al. - 1984
1 Carnegie Mellon Univ (context) - Freeman, for et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yale.edu/HTML/YALE/CS/HyPlans/shao-zhong/papers.html): More
Unrolling Lists - Zhong Shao (1994) (Correct)
Type-Directed Continuation Allocation - Shao, Trifonov (1998) (Correct)
Inferring Type Maps during Garbage Collection - Boehm, Shao (1993) (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