P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48-86, Jan. 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Faithful Translations between Polyvariant Flows and.. - Amtoft, Turbak (9 citations) (Correct)
....1.2 Motivation While the relationship between flow logics and type systems is an intriguing theoretical question, it has important practical ramifications as well. Flow information is useful for guiding and or enhancing a wide variety of analyses and optimizations, such as closure conversion( SW97, DWM 01] defunctionalization( Tol97, TO98, CJW00] inlining( WJ98] uncurrying ( HH98] eager thunk evaluation ( Fax93] dead code elimination ( WS99] run time check elimination ( WJ98] loop detection[SGL96] and object specialization ( DCG95, PC95] Encoding flow information into ....
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48--86, Jan. 1997.
Functioning without Closure: Type-Safe Customized.. - Dimock.. (Correct)
....other representation decisions. In terms of function representations, we are currently investigating: 1) uncurrying [19] which can increase the number of closed functions; 2) closure representations that exclude free variables from an environment if their values are available at all call sites [36]; and (3) register allocation and calling conventions informed by flow information. There are numerous other closure representation tricks (e.g. those discussed in [24, 2, 34] to investigate in the context of our framework. We have yet to explore customized representations for other structures, ....
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48--86, Jan. 1997.
Program Representation Size in an Intermediate.. - Dimock.. (2001) (Correct)
....and developing heuristics for choosing between allowable representations. In terms of function representations, we are currently investigating function representations that do not close over variables whose values are available on the stack (the so called lightweight closure conversion of [SW97] higher order uncurrying [HH98] removing manipulation of records with known components (along the lines of the fictitious data elimination in [Sis99] and register allocation and calling conventions informed by flow information. We have yet to explore customized representations for other ....
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48--86, Jan. 1997.
Inferring Annotated Types for Inter-procedural Register.. - Amtoft, Muller (2002) (Correct)
No context found.
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48-86, Jan. 1997.
Inferring Annotated Types for Inter-procedural Register.. - Amtoft, Muller (2002) (Correct)
No context found.
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48--86, Jan. 1997.
Simple Relational Correctness Proofs for Static Analyses and.. - Benton (2004) (4 citations) (Correct)
No context found.
P. A. Steckler and M. Wand. Lightweight closure conversion. (TOPLAS), pages 48--86, January 1997.
Program Representation Size in an Intermediate.. - Dimock.. (2000) (Correct)
No context found.
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48-86, Jan. 1997.
A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
No context found.
P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48--86, Jan. 1997.
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