An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
DOI:
https://doi.org/10.7146/brics.v6i21.20078Resumé
Lambda-lifting and lambda-dropping respectively transform a block-structuredfunctional 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.
Downloads
Publiceret
1999-01-21
Citation/Eksport
Danvy, O. (1999). An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. BRICS Report Series, 6(21). https://doi.org/10.7146/brics.v6i21.20078
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
