Lightweight Closure Conversion

  title={Lightweight Closure Conversion},
  author={Paul Steckler and Mitchell Wand},
  journal={ACM Trans. Program. Lang. Syst.},
We consider the problem of lightweight closure conversion, in which multiple procedure call protocols may coexist in the same code. A lightweight closure omits bindings for some of the free variables of the procedure that is represents. Flow analysis is used to match the protocol expected by each procedure and the protocol used at its possible call sites. We formulate the flow analysis as a deductive system that generates a labeled transition system and a set of constraints. We show that any… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS
40 Citations
5 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-5 of 5 references

Analysis and efficient implementation of functional programs

  • P. Sestoft
  • Ph.D. thesis, DIKU,
  • 1991
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…