Combining Closure Conversion with Closure Analysis using Algebraic Types

@inproceedings{Tolmach1997CombiningCC,
  title={Combining Closure Conversion with Closure Analysis using Algebraic Types},
  author={Andrew Tolmach},
  year={1997}
}
We have developed a new approach to typed closure conversion of higher-order monomorphic languages which also provides a useful uniform framework for closure analysis and subsequent optimization. The approach is based on representing closures as ordinary algebraic data constructors, grouped into algebraic datatypes according to source type; no special type system is needed. Closure applications are interpreted in the style of Reynolds [13]. Programs in our closure-converted form can also be… CONTINUE READING
8 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

An implementation of Reynold's defunctionalization method for a modern functional language

  • J. M. Bell
  • Master's thesis, Oregon Graduate Institute,
  • 1994
1 Excerpt

Higher-order removal: A modular approach

  • W.-N. Chin, J. Darlington
  • Submitted for publication,
  • 1994
1 Excerpt

E  cient analyses for realistic oline partial evaluation

  • L. Cardelli.
  • Journal of Functional Programming
  • 1993

rgensen. E cient analyses for realistic o -line partial evaluation

  • A. Bondorf, J J.
  • Journal of Functional Programming,
  • 1993
3 Excerpts

Similar Papers

Loading similar papers…