Selective and Lightweight Closure Conversion

Selective and Lightweight Closure Conversion (1996)

Cached

Download Links

[ftp.ccs.neu.edu]

Other Repositories/Bibliography

DBLP

by Paul A. Steckler , Mitchell Wand

BibTeX

@MISC{Steckler96selectiveand,
    author = {Paul A. Steckler and Mitchell Wand},
    title = {Selective and Lightweight Closure Conversion},
    year = {1996}
}

Bookmark

OpenURL

Abstract

Citations

2971	Communication and Concurrency - Milner - 1989
1219	An axiomatic basis for computer programming - Hoare - 1969
595	Compiling with Continuations - Appel - 1992
504	Assigning meanings to programs - FLOYD - 1967
299	The mechanical evaluation of expressions - Landin - 1964
285	A unified approach to global program optimization - Kildall - 1973
267	Control-flow Analysis of Higher-Order Languages - Shivers - 1991
219	Call-by-name, call-by-value, and the -calculus - Plotkin - 1975
190	ORBIT: An optimizing compiler for Scheme - KRANZ, KELSEY, et al. - 1986
146	Typed closure conversion - Minamide, Morrisett, et al. - 1996
119	Rabbit: A compiler for Scheme - Steele - 1978
107	Continuation-passing, closure-passing style - Appel, Jim - 1989
97	A flexible approach to interprocedural data flow analysis and programs with recursive data structures - Jones, Muchnick - 1982
94	Set Based Program Analysis - Heintze - 1992
83	A compiler for lazy ml - Augustsson - 1984
74	Replacing function parameters by global variables - SESTOFT - 1988
72	Selective and lightweight closure conversion - WAND, STECKLER - 1994
48	Analysis and efficient implementation of functional programs - Sestoft - 1991
36	Safety analysis versus type inference - Palsberg, Schwartzbach - 1995
36	Specifying the Correctness of Binding-time Analysis - Wand - 1993
35	Compilation of functional languages by program transformation - Fradet - 1991
34	Correctness of procedure representations in higherorder assembly language - Wand - 1991
28	Flow Analysis of Lambda Expressions - Jones - 1981
24	Type systems for closure conversion - Hannan - 1995
24	Program transformations in a denotational setting - Nielson - 1985
21	Is continuation-passing useful for data flow analysis - Sabry, Felleisen - 1994
21	An equational framework for the flow analysis of higher order functional programs - Strfanescu, Zhou - 1994
20	Set-based analysis for full Scheme and its use in soft-typing - Flanagan, Felleisen
19	Automatic autoprojection of higher-order recursive equations. Science of Computer Programming - Bondorf - 1991
12	Abstract analysis and optimization of Scheme - Ayers - 1993
6	Correct Higher-Order Program Transformations - Steckler - 1994
2	Programming Languages Selective and Lightweight Closure Conversion \Delta 39 - Steckler, Wand - 1994
2	Tracking available values for lightweight closures (summary - Steckler, Wand - 1994