3 citations found. Retrieving documents...
Julia Lawall and Olivier Danvy. Continuation-based partial evaluation. Technical Report Technical Report CS-95178, Brandeis University, Waltham, Massachusetts, 1995. Extended version of [21] from ftp://ftp.brics.dk/pub/ danvy/Papers/lawall-danvy-lfp94-extended.ps.gz.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Final Shift for Call/cc: Direct Implementation of Shift and.. - Gasbichler, Sperber (2002)   (3 citations)  (Correct)

....composes it with its own continuation and binds that function to c. It then evaluates the body expression M within the empty continuation. A number of applications make inherent use of shift and reset, among them direct style formulations of monads [13, 14] continuation based partial evaluation [21, 22, 26], and type directed partial evaluation [6] However, implementations of these control operators are usually formulated in terms of call cc. This is a reasonable and quite portable approach. However, these indirect implementations of shift and reset exhibit suboptimal performance. Therefore, we ....

Julia Lawall and Olivier Danvy. Continuation-based partial evaluation. Technical Report Technical Report CS-95178, Brandeis University, Waltham, Massachusetts, 1995. Extended version of [21] from ftp://ftp.brics.dk/pub/ danvy/Papers/lawall-danvy-lfp94-extended.ps.gz.


Polymorphic Specialization for ML - Helsen, Thiemann (2001)   (Correct)

....values embedded in a dynamic context. If a static answer occurs in a static context, a specializer can bring the static context closer to the embedded static value, allowing further specialization. These are well known binding time improvements in partial evaluation for call by value calculi [22, 37, 38] and are implemented by the specialization rules in Figure 5. In 2 there are ve such static contexts, which can be read from the context rules (10) to (14) However, as can be seen from reduction rule (6) we recast the static context induced by rule (11) to that of (13) Moreover, the ....

....when region inference is used solely for a binding time analysis (as is the case in this paper) it does not really matter when a region is deallocated as long as region separation is still good. More importantly, our specializer implements context shifts that make a CPS transformation redundant [37], so the impact of this observation on our framework is insigni cant. This paper provides a rst step towards a usable program specializer for a real programming language like ML. Whereas the constraint analysis can be readily built on top of region inference (section 2.4 suggests an algorithm) ....

Julia L. Lawall and Olivier Danvy. Continuation-based partial evaluation. Technical Report Technical Report CS-95-178, Brandeis University, Waltham, Massachusetts, 1995. Extended version of [36] from ftp://ftp.brics.dk/pub/danvy/Papers/lawall-danvy-lfp94-extended.ps.gz.


Polymorphic Specialization for ML - Helsen, Thiemann (2002)   (Correct)

....values embedded in a dynamic context. If a static answer occurs in a static context, a specializer can bring the static context closer to the embedded static value, allowing further specialization. These are well known binding time improvements in partial evaluation for call by value calculi [22, 37, 38] and are implemented by the specialization rules in Figure 5. In #2 there are five such static contexts, which can be read from the context rules (10) to (14) However, as can be seen from reduction rule (6) we recast the static context induced by rule (11) to that of (13) Moreover, the ....

....when region inference is used solely for a binding time analysis (as is the case in this paper) it does not really matter when a region is deallocated as long as region separation is still good. More importantly, our specializer implements context shifts that make a CPS transformation redundant [37], so the impact of this observation on our framework is insignificant. This paper provides a first step towards a usable program specializer for a real programming language like ML. Whereas the constraint analysis can be readily built on top of region inference (section 2.4 suggests an ....

Julia L. Lawall and Olivier Danvy. Continuation-based partial evaluation. Technical Report Technical Report CS-95-178, Brandeis University, Waltham, Massachusetts, 1995. Extended version of [36] from ftp://ftp.brics.dk/pub/danvy/Papers/lawall-danvy-lfp94-extended.ps.gz.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC