TY - GEN
T1 - Specification and Correctness of Lambda Lifting?
AU - Fischbach, Adam
AU - Hannan, John
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.
PY - 2000
Y1 - 2000
N2 - We present a formal and general specification of lambda lift- ing and prove its correctness with respect to an operational semantics. Lambda lifting is a program transformation which eliminates free vari- ables from functions by introducing additional formal parameters to func- tion definition and additional actual parameters to function calls. This operation supports the transformation from a lexically-structured func- tional program into a set of recursive equations. Existing results provide specific algorithms with no flexibility, no general specification, and only limited correctness results. Our work provides a general specification of lambda lifting (and related operations) which supports flexible trans- lation strategies which may result in new implementation techniques. Our work also supports a simple framework in which the interaction of lambda lifting and other optimizations can be studied and from which new algorithms might be obtained.
AB - We present a formal and general specification of lambda lift- ing and prove its correctness with respect to an operational semantics. Lambda lifting is a program transformation which eliminates free vari- ables from functions by introducing additional formal parameters to func- tion definition and additional actual parameters to function calls. This operation supports the transformation from a lexically-structured func- tional program into a set of recursive equations. Existing results provide specific algorithms with no flexibility, no general specification, and only limited correctness results. Our work provides a general specification of lambda lifting (and related operations) which supports flexible trans- lation strategies which may result in new implementation techniques. Our work also supports a simple framework in which the interaction of lambda lifting and other optimizations can be studied and from which new algorithms might be obtained.
UR - http://www.scopus.com/inward/record.url?scp=84957797233&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957797233&partnerID=8YFLogxK
U2 - 10.1007/3-540-45350-4_10
DO - 10.1007/3-540-45350-4_10
M3 - Conference contribution
AN - SCOPUS:84957797233
SN - 3540410546
SN - 9783540410546
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 108
EP - 128
BT - Semantics, Applications and Implementation of Program Generation - International Workshop, SAIG 2000, Proceedings
A2 - Taha, Walid
PB - Springer Verlag
T2 - International Workshop on Semantics, Applications and Implementation of Program Generation, SAIG 2000
Y2 - 20 September 2000 through 20 September 2000
ER -