Selective and lightweight closure conversion

Authors:
Mitchell Wand;Paul Steckler
Affiliations:
College of Computer Science, Northeastern University, 360 Huntington Avenue, 161CN, Boston, MA;College of Computer Science, Northeastern University, 360 Huntington Avenue, 161CN, Boston, MA
Venue:
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1994

Citing 11
Cited 24

Continuation-passing, closure-passing style

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher order escape analysis: optimizing stack allocation in functional program implementations

Proceedings of the third European symposium on programming on ESOP '90
On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static type inference in a dynamically typed language

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving the correctness of storage representations

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Specifying the correctness of binding-time analysis

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Set based program analysis

Set based program analysis
Safety analysis versus type inference

Information and Computation
A flexible approach to interprocedural data flow analysis and programs with recursive data structures

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Correctness of Procedure Representations in Higher-Order Assembly Language

Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Flow Analysis of Lambda Expressions (Preliminary Version)

Proceedings of the 8th Colloquium on Automata, Languages and Programming

Lambda, the ultimate label or a simple optimizing compiler for Scheme

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
An equational framework for the flow analysis of higher order functional programs

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
A type system equivalent to flow analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Closure analysis in constraint form

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system equivalent to flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
A practical and flexible flow analysis for higher-order languages

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed closure conversion

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lightweight closure conversion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Strongly typed flow-directed representation transformations (extended abstract)

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Systematic realisation of control flow analyses for CML

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Lambda-dropping: transforming recursive equations into programs with block structure

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Infinitary control flow analysis: a collecting semantics for closure analysis

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From polyvariant flow information to intersection and union types

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trace-Based Abstract Interpretation of Operational Semantics

Lisp and Symbolic Computation
Efficient and safe-for-space closure conversion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Functioning without closure: type-safe customized function representations for standard ML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Program Representation Size in an Intermediate Language with Intersection and Union Types

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
A calculus with polymorphic and polyvariant flow types

Journal of Functional Programming
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Environment analysis via ΔCFA

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving flow analyses via ΓCFA: abstract garbage collection and counting

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Analyzing the environment structure of higher-order languages using frame strings

Theoretical Computer Science
Exploiting reachability and cardinality in higher-order flow analysis

Journal of Functional Programming
Shape analysis in the absence of pointers and structure

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of selective and lightweight closure conversion, in which multiple procedure-calling protocols may coexist in the same code. Flow analysis is used to match the protocol expected by each procedure and the protocol used at each of its possible call sites. We formulate the flow analysis as the solution of a set of constraints, and show that any solution to the constraints justifies the resulting transformation. Some of the techniques used are suggested by those of abstract interpretation, but others arise out of alternative approaches.