Higher-Order Minimal Functional Graphs.

Neil D Jones, Mads Rosendahl

    Publikation: Bidrag til bog/antologi/rapportBidrag til bog/antologiForskning

    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.
    OriginalsprogEngelsk
    TitelAlgebraic and Logic Programming, 4th International Conference
    RedaktørerGiorgio Levi
    Antal sider11
    ForlagKluwer Academic Publishers
    Publikationsdato1994
    Sider242-252
    ISBN (Trykt)3-540-58431-5
    StatusUdgivet - 1994
    NavnLecture Notes in Computer Science
    Vol/bind850
    ISSN0302-9743

    Citer dette

    Jones, N. D., & Rosendahl, M. (1994). Higher-Order Minimal Functional Graphs. I G. Levi (red.), Algebraic and Logic Programming, 4th International Conference (s. 242-252). Kluwer Academic Publishers. Lecture Notes in Computer Science, Bind. 850