See this document in CiteSeerX!

Global Tagging Optimization by Type Inference (1992)  (Make Corrections)  (48 citations)
Fritz Henglein
Proc. 1992 ACM Conf. on LISP and Functional Programming (LFP), San Francisco, California



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~aike...optimization.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~cs264/f95/p...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special hardware support. We present a tagging optimization algorithm based on type inference that is global: it traces tag information across procedure boundaries, not only within procedures; efficient: it runs asymptotically in almost-linear time with excellent practical run-time behavior (e.g. 5,000 line Scheme programs are ... (Update)

Cited by:   More
Reducing the Overhead of Dynamic Analysis - Yong, Horwitz (2002)   (Correct)
On Jones-Optimal Specialization - For Strongly Typed   (Correct)
Taming C Pointers - Necula, McPeak, Weimer (2002)   (Correct)

Active bibliography (related documents):   More   All
1.4:   Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)   (Correct)
0.6:   Combining Recursive and Dynamic Types - Leiss   (Correct)
0.5:   SETL for Internet Data Processing - Bacon (2000)   (Correct)

Similar documents based on text:   More   All
0.2:   Coinductive Axiomatization of Recursive Type Equality and.. - Brandt, Henglein (1998)   (Correct)
0.2:   Safe polymorphic type inference for a Dynamically Typed.. - Henglein, Rehof (1995)   (Correct)
0.2:   Breaking through the n³ barrier: Faster object type inference - Henglein   (Correct)

Related documents from co-citation:   More   All
16:   Soft typing with conditional types - Aiken, Wimmers et al. - 1994
15:   Set-based analysis of ML programs (context) - Heintze - 1994
14:   Soft typing - Cartwright, Fagan - 1991

BibTeX entry:   (Update)

F. Henglein. Global tagging optimization by type inference. In Lisp and Functional Programming 1992. ACM Press, 1992. http://citeseer.ist.psu.edu/henglein92global.html   More

@inproceedings{ henglein92global,
    author = "Fritz Henglein",
    title = "Global Tagging Optimization by Type Inference",
    booktitle = "Proc. 1992 {ACM} Conf. on {LISP} and Functional Programming ({LFP}), San Francisco, California",
    publisher = "ACM Press",
    pages = "205--215",
    year = "1992",
    url = "citeseer.ist.psu.edu/henglein92global.html" }
Citations (may not include all citations):
1074   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
484   Common LISP -- The Language (context) - Steele - 1984
315   Dynamic typing in a statically typed language - Abadi, Cardelli et al. - 1991
220   Orbit: an optimizing compiler for scheme (context) - Kranz, Kelsey et al. - 1986
179   Dynamic typing (context) - Henglein - 1992
138   Type inference for polymorphic references (context) - Tofte - 1990
127   Control flow analysis in Scheme (context) - Shivers - 1988
92   A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982
83   Automatic autoprojection of higher order recursive equations (context) - Bondorf - 1991
80   The Scheme Programming Language (context) - Dybvig - 1987
78   Soft typing - Cartwright, Fagan - 1991
74   Replacing function parameters by global variables (context) - Sestoft - 1989
67   Iterative type analysis and extended message splitting: opti.. - Chambers, Ungar - 1990
64   Efficient type inference for higherorder binding-time analys.. - Henglein - 1991
53   Static type inference in a dynamically typed language - Aiken, Murphy - 1991
41   The semantics of scheme controlflow analysis - Shivers - 1991
41   Polymorphic type inference and assignment - Leroy, Weis - 1991
36   TS: an optimizing compiler for Smalltalk (context) - Johnson, Graver et al. - 1988
35   Partial type inference for untyped functional programs (context) - Gomard - 1990
35   An automatic technique for selection of data representations.. (context) - Schonberg, Schwartz et al. - 1981
35   Data-flow analysis and type recovery in scheme (context) - Shivers - 1991
31   Tag-free garbage collection for strongly typed programming l.. (context) - Goldberg - 1991
28   Quasi-static typing (context) - Thatte - 1990
17   Data Structures and Network Flow Algorithms (context) - Tarjan - 1983
17   An optimizing compiler for lexically scoped LISP (context) - Brooks, Gabriel et al. - 1982
13   Untagged data in tagged environments: choosing optimal repre.. (context) - Peterson - 1989
13   A scheme for the automatic inference of variable types (context) - Kaplan, Ullman - 1980
12   Tags and type checking in LISP: hardware and software approa.. (context) - Steenkiste, Hennessy - 1987
11   Generating a compiler for a lazy language by partial evaluat.. - rgensen - 1992
11   Binding time optimization in programming languages: some tho.. (context) - Jones, Muchnick - 1976
9   TICL -- a type inference system for common lisp (context) - Ma, Kessler - 1990
9   Experience with the SETL optimizer (context) - Freudenberger, Schwartz et al. - 1975
8   The implementation of tags and run-time type checking (context) - Steenkiste - 1991
6   Type Determination for Very High Level Languages (context) - Tenenbaum - 1974
5   The runtime environment for Screme (context) - Vegdahl, Pleban - 1989
3   Recursive Data Types in SETL: Automatic Determination (context) - Weiss - 1986
3   Dynamic types in statically typed languages (context) - Mycroft - 1984
2   A Type Inference System for Icon (context) - Walker - 1988
1   The standard ml of new jersey implementation of callcc is no.. (context) - Harper, Lillibridge - 1991
1   Compilation issues in the screme implementation (context) - Pleban - 1991



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://parker.eecs.berkeley.edu/~cs264/f95/papers/index.html):   More
Garbage Collection Can Be Faster Than Stack Allocation - Appel (1987)   (Correct)
Continuation-Passing, Closure-Passing Style - Andrew Appel (1989)   (Correct)
Parallel Programming in Split-C - Culler (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