2010
DOI: 10.1007/978-3-642-11486-1_13
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Abstract. In this paper, we give a re-formulation of our previously defined distillation algorithm, which can automatically transform higherorder functional programs into equivalent tail-recursive programs. Our re-formulation simplifies the presentation of the transformation and hopefully makes it easier to understand. Using distillation, it is possible to produce superlinear improvement in the run-time of programs. This represents a significant advance over deforestation, partial evaluation and positive super… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 14 publications
(9 reference statements)
0
3
0
Order By: Relevance
“…For example, supercompilation is able to improve the worst-case time complexity of some input programs, while partial evaluation cannot [23]. Other transformation techniques such as distillation [18] can also improve the worst-case time complexity of some programs. In this section we consider one of the supercompilation tools for such a kind of transformations assisted by the finite countermodel method.…”
Section: Global Unreachabilitymentioning
confidence: 99%
“…For example, supercompilation is able to improve the worst-case time complexity of some input programs, while partial evaluation cannot [23]. Other transformation techniques such as distillation [18] can also improve the worst-case time complexity of some programs. In this section we consider one of the supercompilation tools for such a kind of transformations assisted by the finite countermodel method.…”
Section: Global Unreachabilitymentioning
confidence: 99%
“…This inconvenience appears because modern supercompilers are very careful in transforming programs (or proofs) not to change their semantics (or admit very slight changes) and permit only very few logical transformations. It is supposed that strengthened techniques like distillation [5] can do more complicated transformations like merging several induction proofs in a one so can be able to avoid these restrictions.…”
Section: Example 2 Consider a Recursive Function On Natural Numbersmentioning
confidence: 99%
“…The first author defined a transformation algorithm called distillation [6][7][8] formed. However, the correctness of this algorithm was not perfectly clear; it needed a more solid theoretical foundation.…”
Section: Introductionmentioning
confidence: 99%