David Tarditi  Home/Search
Context
Related
| cmu.edu/papers/Tarditi94un.ps cmu.edu/afs/cs/project...Tarditi94un.ps 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: cmu.edu/~fox/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Compilers for functional languages such as Standard ML can do a good job compiling programs, especially programs that perform symbolic computation. However, they often do a poor job on programs in a wide range of real-world application domains, such as systems programming and scientific computing. One reason for this is that these compilers are not sensitive to program structure, that is, recursions ("loops"), the code executed during the evaluation of a recursive function ("loop bodies"), and... (Update)
Active bibliography (related documents): More All
0.6: Analysis of Recursive Types in an Imperative Language - Wang (1994) (Correct)
0.5: TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995) (Correct)
0.5: Measuring the Cost of Storage Management - David Tarditi (1994) (Correct)
Similar documents based on text: More All
0.0: Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura (1998) (Correct)
0.0: Evaluation of Regular Nonlinear Recursions by Deductive.. - Han, Lakshmanan (1995) (Correct)
0.0: Answering N-chain Recursive Queries with Arithmetic - Robinson, Lin (Correct)
BibTeX entry: (Update)
@misc{ tarditi-using,
author = "David Tarditi",
title = "Using Program Structure to Guide Optimization in the Presence of First-Class
Functions.",
url = "citeseer.ist.psu.edu/tarditi94using.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
232 The Concurrency Workbench: A semantics-based tool for the ve.. - Cleaveland, Parrow et al. - 1993
220 ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1988
220 ORBIT: An Optimizing Compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
197 Revised report on the algorithmic language Scheme - Rees, Clinger - 1986
186 Compilingpolymorphismusing intensional type analysis - Harper, Morrisett
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
162 Unboxed objects and polymorphic typing - Leroy - 1992
158 Reasoning about programs in continuations-passing style - Sabry, Felleisen
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1993
155 The essence of compiling with continuations - Flanagan, Sabry et al. - 1993
144 Two approaches to interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
131 Set Based Program Analysis - Heintze - 1992
127 Control Flow Analysis in Scheme (context) - Shivers - 1988
96 Addison--Wesley Publishing Company (context) - Aho, Sethi et al. - 1986
95 Elements of Functional Programming (context) - Reade - 1989
89 A practical system for intermodule code optimization at link.. - Srivastava, Wall - 1992
68 Interprocedural data flow analysis in the presence of pointe.. - Weihl - 1982
59 The interprocedural coincidence theorem - Knoop, Steffen - 1992
55 Space-efficient closure representations - Shao, Appel
50 A fresh look at optimizing array bound checking (context) - Gupta - 1992
40 A Portable Machine-Independent Global Optimizer --- Design a.. (context) - Chow - 1983
38 A Portable Scheme-to-C Compiler (context) - Bartlett - 1989
37 Back to direct style II: First-class continuations - Danvy, Lawall
37 Lawrence Livermore Laboratory (context) - Crowley, Hendrickson et al. - 1978
36 IEEE Transactions on Software Engineering (context) - Ryder, call et al. - 1979
32 Optimization of range checking (context) - Markstein, Cocke et al. - 1982
31 Flow analysis of lambda expressions (context) - Jones
28 A lexical analyzer generator for Standard ML (context) - Appel, Mattson et al. - 1989
27 Signatures for a network protocol stack: A systems applicati.. - Biagioni, Harper et al.
21 Distributed with Standard ML of New Jersey (context) - Tarditi, Appel et al. - 1990
20 Memory subsystem performance of programs with intensive heap.. - Diwan, Tarditi et al. - 1993
20 a non-strict purely functional language (context) - Hudak, Jones et al. - 1992
17 Compiling Standard ML for Efficient Execution on Modern Mach.. - Shao - 1994
17 An optimizing compiler for lexically scoped LISP (context) - Brooks, Gabriel et al. - 1982
17 Optimization of array subscript range checks (context) - Asuru - 1992
17 SIMPLE: An exercise in future scientific programming (context) - Ekanadham - 1987
15 Parallel implementations from function prototypes: a case st.. (context) - Waugh, McAndrew et al. - 1990
13 LISP on a Reduced-Instruction-Set Processor: Characterizatio.. (context) - Steenkiste - 1987
13 Pseudoknot: A float-intensive benchmark for functional compi.. - Hartel - 1994
12 ACM Conference on Lisp and Functional Programming (context) - the - 1994
12 ACM Conference on Lisp and Functional Programming (context) - the - 1992
10 Interprocedural optimization: experimental results (context) - Richardson, Ganapathi - 1989
9 an optimizing CAML compiler - Serrano, Weis - 1994
8 Software --- Practice and Experience (context) - Griss, Hearn et al. - 1981
7 Memory subsystem performance of programs with copying garbag.. (context) - Diwan, Tarditi et al. - 1994
6 The Python compiler for CMU Common Lisp (context) - MacLachlan
5 Numerical analysis using non-procedural paradigms (context) - Sullivan, Zorn - 1995
5 Letters on Programming Languages and Systems (context) - Hall, Kennedy et al. - 1992
4 Design of an optimizing dynamically retargetable compiler fo.. (context) - Brooks, Posner et al. - 1986
3 Accounting for the performance of Standard ML on the DEC Alp.. - Necula, George - 1994
2 highly optimizing LISP compiler (context) - Kessler, Peterson et al. - 1986
1 Accurate static estimators for progream optimization (context) - Wagner, Maverick et al.
1 Interpocedural dataflow analysis via graph reachability (context) - Reps, Sagiv et al.
1 PhD thesis proposal (context) - Morrisett, representations et al. - 1993
Documents on the same site (http://www.cs.cmu.edu/~fox/publications.html): More
A Modal Analysis of Staged Computation - Davies, Pfenning (1995) (Correct)
Toward a Practical Type Theory for Recursive Modules - Dreyer, Harper, Crary (2001) (Correct)
Replication-Based Incremental Copying Collection - Nettles, O'Toole, Pierce.. (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