JFLP: Volume 1997, Article 2

The Journal of Functional and Logic Programming

Volume 1997

Article 2

Published by The MIT Press . Copyright 1997 Massachusetts Institute of Technology.

Your institution may already be a subscriber to JFLP. If not, please subscribe for legitimate access to all journal articles.

Higher-Order Minimal Function Graphs

Neil D. Jones and Mads Rosendahl

27 February 1997

Abstract

We present a minimal function graph semantics for a higher-order functional language with applicative evaluation order. The approach extends previous results on minimal function graphs to higher-order functions. The semantics captures the intermediate calls performed during the evaluation of a program. This information may be used in abstract interpretation as a basis for proving the soundness of program analyses. An example of this is the ``closure analysis'' of partial evaluation.

The following versions of the article are available:

• Preformatted versions of the article (compressed with gzip )
  • DVI (gzip'ped 23 kb)
  • PostScript (gzip'ped 60 kb)
• Source materials for custom formatting
  • LaTeX ( JFLP-A97-02.tex , gzip'ped 13 kb)
  • BIBTeX ( JFLP-A97-02.bib , gzip'ped 1 kb)
  • Parameter settings for custom formatting ( cjropts.tex , 117 bytes)

You can find this article also on the ftp-server of The MIT Press (access may be faster from some sites).

Self citation

    @article{jflp97-02,
      author={Neil D. Jones and Mads Rosendahl},
      title={Higher-Order Minimal Function Graphs},
      journal={Journal of Functional and Logic Programming},
      volume={1997},
      number={2},
      publisher={The MIT Press},
      month={February},
      year={1997}
    }

Main page