Higher-Order Minimal Functional Graphs.

Neil D Jones, Mads Rosendahl

    Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch

    Abstract

    We present a minimal function graph semantics for a higher-order functional language with applicative evaluation order. 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.
    Original languageEnglish
    Title of host publicationAlgebraic and Logic Programming, 4th International Conference
    EditorsGiorgio Levi
    Number of pages11
    PublisherKluwer Academic Publishers
    Publication date1994
    Pages242-252
    ISBN (Print)3-540-58431-5
    Publication statusPublished - 1994
    SeriesLecture Notes in Computer Science
    Volume850
    ISSN0302-9743

    Cite this