An Extensional Characterization of Lambda-Lifting and Lambda-Dropping

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch


    Lambda-lifting and lambda-dropping respectively transform a block-structured functional program into recursive equations and vice versa. Lambda-lifting was developed in the early 80’s, whereas lambda-dropping is more recent. Both are split into an analysis and a transformation. Published work, however, has only concentrated on the analysis parts. We focus here on the transformation parts and more precisely on their correctness, which appears never to have been proven. To this end, we define extensional versions of lambda-lifting and lambda-dropping and establish their correctness with respect to a least fixed-point semantics.
    Original languageEnglish
    Book seriesB R I C S Report Series
    Number of pages13
    Publication statusPublished - 1999


    Dive into the research topics of 'An Extensional Characterization of Lambda-Lifting and Lambda-Dropping'. Together they form a unique fingerprint.

    Cite this