@bibtex{2008.04669,
Abstract = {Supercompilation is a powerful program transformation technique with numerous interesting applications. Existing methods of supercompilation, however, are often very unpredictable with respect to the size of the resulting programs. We consider an approach for controlling result size, based on a combination of multi-result supercompilation and a specific generalization strategy, which avoids code duplication. The current early experiments with this method show promising results - we can keep the size of the result small, while still performing powerful optimizations.},
Author = {Krustev, Dimitur Nikolaev},
EPrint = {arXiv:2008.04669},
EPrintType = {arXiv},
File = {2008.04669 - q.pdf},
HowPublished = {EPTCS 320, 2020, pp. 125-139},
Title = {{O}ptimizing {P}rogram {S}ize {U}sing {M}ulti-result {S}upercompilation},
URL = {http://arxiv.org/abs/2008.04669},
Year = {2020},
bdsk-url-1 = {http://arxiv.org/abs/2008.04669},
bdsk-url-2 = {https://doi.org/10.4204/EPTCS.320.9},
comments = {In Proceedings VPT/HCVS 2020, arXiv:2008.02483. arXiv admin note: identical to arXiv:2006.02204, which has added appendices},
date-added = {2021-03-27 15:40:13 +0100},
date-modified = {2021-03-27 15:40:14 +0100},
doi = {10.4204/EPTCS.320.9}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A