Lambda-lifting a block-structured program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope. For lack of block structure and lexical scope, recursive equations must carry around all the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping thus require one to compute Def/Use paths:for lambda-lifting: each of the functions occurring in the path of a free variable is passed this variable as a parameter;for lambda-dropping: parameters which are used in the same scope as their definition do not need to be passed along in their path.A program whose blocks have...
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1969. Ph.D.MICR...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
AbstractAutoprojection, or self-applicable partial evaluation, has been implemented for first order ...
AbstractLambda-lifting a block-structured program transforms it into a set of recursive equations. W...
Lambda-lifting a functional program transforms it into a set of recursive equations. We present the ...
Lambda-lifting and lambda-dropping respectively transform a block-structured functional program into...
Lambda-lifting is a program transformation used in compilers and in partial evaluators and that oper...
Abstract — Lambda lifting is a technique for transforming a program with local function definitions ...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
We prove the correctness of incremental lambda-lifting, an optimization that attempts to reduce the ...
© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms ...
We demonstrate how to model the following common programmingsconstructs in terms of an applicative...
AbstractWe describe lambda calculus reduction strategies using big-step operational semantics and sh...
Substitution in the lambda calculus is a complex operation that traditional presentations of beta co...
We present the lambda sigma^a_w calculus, a formal synthesis of the concepts ofsharing and explicit ...
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1969. Ph.D.MICR...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
AbstractAutoprojection, or self-applicable partial evaluation, has been implemented for first order ...
AbstractLambda-lifting a block-structured program transforms it into a set of recursive equations. W...
Lambda-lifting a functional program transforms it into a set of recursive equations. We present the ...
Lambda-lifting and lambda-dropping respectively transform a block-structured functional program into...
Lambda-lifting is a program transformation used in compilers and in partial evaluators and that oper...
Abstract — Lambda lifting is a technique for transforming a program with local function definitions ...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
We prove the correctness of incremental lambda-lifting, an optimization that attempts to reduce the ...
© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms ...
We demonstrate how to model the following common programmingsconstructs in terms of an applicative...
AbstractWe describe lambda calculus reduction strategies using big-step operational semantics and sh...
Substitution in the lambda calculus is a complex operation that traditional presentations of beta co...
We present the lambda sigma^a_w calculus, a formal synthesis of the concepts ofsharing and explicit ...
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1969. Ph.D.MICR...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
AbstractAutoprojection, or self-applicable partial evaluation, has been implemented for first order ...