Paul A. Steckler, MITCHELL WAND  Home/Search
Context Related
| neu.edu/pub/people...tecklerwand95.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: neu.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: nalyses is to annotate a program with certain propositions about the behavior of the program. One can then apply optimizations to the This work was supported by the National Science Foundation and DARPA under grants CCR9002253 and CCR-9014603. Preliminary presentations of this work appeared in the conferences POPL'94 [Wand and Steckler 1994] and Atlantique [Steckler and Wand 1994b], and in the firstnamed author's Ph.D. dissertation [Steckler 1994]. Authors' addresses: P.A. Steckler, Laboratory ... (Update)
Context of citations to this paper: More
.... of formal treatments of closure conversion, by modelling it as a translation of a lambda calculus into a calculus with closures [Han95, WS94, MMH96, MMH96]. Soundness proofs are established by proving the translation of a program operationally equivalent to the original...
Cited by: More
Typed Closure Conversion - Yasuhiko Minamide Greg (Correct)
Strongly Typed Flow-Directed Representation Transformations - Dimock, Muller, Turbak.. (1997) (Correct)
A Typed Intermediate Language for Flow-Directed Compilation - Wells, Dimock, Muller.. (1997) (Correct)
Similar documents (at the sentence level):
28.6%: Lightweight Closure Conversion - Steckler, WAND (1996) (Correct)
27.0%: Correct Higher-Order Program Transformations - Steckler (1994) (Correct)
Active bibliography (related documents): More All
0.3: Correct Separate and Selective Closure Conversion - Steckler (Correct)
0.1: Detecting Local Channels in Distributed Poly/ML - Steckler (1996) (Correct)
0.1: Proving the Correctness of Recursion-Based Automatic Program.. - Sands (1996) (Correct)
Similar documents based on text: More All
0.4: Selectors Make Analyzing case-lambda Too Hard - Meunier, Findler, Steckler, Wand (2001) (Correct)
0.2: Validating the Unit Correctness of Spreadsheet Programs - Tudor Antoniu Blunk (2004) (Correct)
0.2: Unknown - (2003) (Correct)
Related documents from co-citation: More All
19: Compiling with Continuations (context) - Appel - 1992
17: Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
16: Soft typing with conditional types - Aiken, Wimmers et al. - 1994
BibTeX entry: (Update)
M. Wand and P. Steckler. Selective and lightweight closure conversion. In ACM Symp. on Principles of Programming Languages, 1994. http://citeseer.ist.psu.edu/steckler96selective.html More
@misc{ wand94selective,
author = "M. Wand and P. Steckler",
title = "Selective and lightweight closure conversion",
text = "M. Wand and P. Steckler. Selective and lightweight closure conversion.
In ACM Symp. on Principles of Programming Languages, 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/steckler96selective.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
650 An axiomatic basis for computer programming (context) - Hoare - 1969 ACM DBLP
521 Compiling with Continuations (context) - Appel - 1992 ACM
223 Assigning meanings to programs (context) - Floyd - 1967
176 Control-flow analysis of higher-order languages (context) - Shivers - 1991
156 A unified approach to global program optimization (context) - Kildall - 1973 ACM DBLP
131 Set based program analysis - Heintze - 1992 ACM
116 Rabbit: A compiler for Scheme (context) - Steele - 1978 ACM
92 A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982 ACM DBLP
83 Automatic autoprojection of higher-order recursive equations (context) - Bondorf - 1991
74 Replacing function parameters by global variables (context) - Sestoft - 1988 ACM DBLP
59 A compiler for lazy ML (context) - Augustsson - 1984 ACM DBLP
54 Safety analysis versus type inference - Palsberg, Schwartzbach - 1995
49 Specifying the correctness of binding-time analysis (context) - Wand - 1993 ACM DBLP
46 Analysis and efficient implementation of functional programs - Sestoft - 1991
42 Call-by-name (context) - Plotkin - 1975
39 Compilation of functional languages by program transformatio.. (context) - Fradet, Le M'etayer - 1991 ACM DBLP
31 Flow analysis of lambda expressions (context) - Jones - 1981
29 Is continuation-passing useful for data flow analysis - Sabry, Felleisen - 1994
23 Type systems for closure conversion - Hannan - 1995
23 Set-based analysis for full scheme and its use in softtyping - Flanagan, Felleisen - 1995
22 Correctness of procedure representations in higher-order ass.. (context) - Wand - 1992 ACM DBLP
15 An equational framework for the flow analysis of higherorder.. (context) - Stefanescu, Zhou - 1994
15 Continuation-passing (context) - Appel, Jim - 1989
9 Abstract analysis and optimization of Scheme (context) - Ayers - 1993 ACM
6 Correct higher-order program transformations - Steckler - 1994
6 Tracking available values for lightweight closures - Steckler, Wand
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ccs.neu.edu.html): More
Incremental Testing of Adaptive Software - Keszenheimer, Lieberherr (1994) (Correct)
Experience with a Graph-Based Propagation Programming.. - Lieberherr, Hürsch.. (1992) (Correct)
Understanding Diagrams in Technical Documents - Futrelle, Kakadiaris.. (1992) (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