Abstract
In this paper, we provide an improved basis for the " distillation" program transformation. It is known that superlinear speedups can be obtained using distillation, but cannot be obtained by other earlier automatic program transformation techniques such as deforestation, positive supercompilation and partial evaluation. We give distillation an improved semantic basis, and explain how superlinear speedups can occur.
Original language | English |
---|---|
Title of host publication | Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation |
Number of pages | 10 |
Publisher | Association for Computing Machinery |
Publication date | 2012 |
Pages | 15-24 |
ISBN (Print) | 978-1-4503-1118-2 |
DOIs | |
Publication status | Published - 2012 |
Event | 2012 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - Philadelphia, United States Duration: 23 Jan 2012 → 24 Jan 2012 |
Conference
Conference | 2012 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation |
---|---|
Country/Territory | United States |
City | Philadelphia |
Period | 23/01/2012 → 24/01/2012 |
Keywords
- Bisimulation
- Labelled transitions systems
- Program transformation
- Superlinear improvement
- Unfold/fold