Syntactic detection of single-threading using continuations

Fradet, Pascal

doi:10.1007/3540543961_12

Cited by 8 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Likewise, Fradet has investigated the detection of single-threaded variables using continuations [19]. Such variables come in two flavors: global, read-only variables, and updatable, single-threaded variables.…”

Section: Detecting Global Variablesmentioning

confidence: 99%

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Danvy¹,

Schultz²

1999

BRICS

View full text Add to dashboard Cite

Lambda-lifting a block-structured program transforms it into a set of recursive equations. We present the symmetric transformation: lambdadropping. 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 no free variables is scope-insensitive. Its blocks are then free to float (for lambda-lifting) or to sink (for lambdadropping) along the vertices of the scope tree. *

show abstract

Section: Detecting Global Variablesmentioning

confidence: 99%

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Danvy¹,

Schultz²

1999

BRICS

View full text Add to dashboard Cite

show abstract

“…Following Schmidt's initial impetus on single-threading [31], Sestoft has investigated the detection of global variables in recursive equations [33], and Fradet, the detection of single-threaded variables using continuations [16]. Such variables come in two flavors: global, read-only variables, and updatable, single-threaded variables.…”

Section: Detecting Global Variablesmentioning

confidence: 99%

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Danvy¹,

Schultz²

1997

BRICS

View full text Add to dashboard Cite

Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambdadropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope.For lack of scope, recursive equations must carry around all the parameters that any of their callees might possibly need. Both lambdalifting and lambda-dropping thus require one to compute a transitive closure over the call graph:• for lambda-lifting: to establish the Def/Use path of each free variable (these free variables are then added as parameters to each of the functions in the call path); We believe lambda-lifting and lambda-dropping are interesting per se, both in principle and in practice, but our prime application is partial evaluation: except for Malmkjaer and Ørbaek's case study presented at PEPM'95, most polyvariant specializers for procedural programs operate on recursive equations. To this end, in a pre-processing phase, they lambda-lift source programs into recursive equations. As a result, residual programs are also expressed as recursive equations, often with dozens of parameters, which most compilers do not handle efficiently. Lambda-dropping in a post-processing phase restores their block structure and lexical scope thereby significantly reducing both the compile time and the run time of residual programs.

show abstract

Lambda-dropping: transforming recursive equations into programs with block structure

Danvy¹,

Schultz

2000

Theoretical Computer Science

View full text Add to dashboard Cite

Syntactic detection of single-threading using continuations

Cited by 8 publications

References 18 publications

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Lambda-dropping: transforming recursive equations into programs with block structure

Contact Info

Product

Resources

About