Request and Assert: A pragmatic approach to generating specialization scenarios
| dc.contributor.author | ZHU, Ping | en_US |
| dc.contributor.author | KHOO, Siau-Cheng | en_US |
| dc.date.accessioned | 2006-11-13T07:09:20Z | en_US |
| dc.date.accessioned | 2017-01-23T06:59:55Z | |
| dc.date.available | 2006-11-13T07:09:20Z | en_US |
| dc.date.available | 2017-01-23T06:59:55Z | |
| dc.date.issued | 2006-11-13T07:09:20Z | en_US |
| dc.description.abstract | A specialization scenario provides a programmer friendly mechanism communicating the information about specialization opportunities to partial evaluators. Unfortunately, the process of generating suitable scenarios remains an art only mastered by programmers with in-depth knowledge about partial evaluation. Existing works on generating scenarios either rely on a brute-force approach to generate all possible scenarios, or to introduce specific design patterns into the programming to facilitate extracting specialization scenarios. In this paper, we provide a lightweight approach to partial evaluation by enabling non-experts to declare two simple specialization concerns: request and assert. The request enables a programmer to declare specialization opportunities and an assert aims to prevent undesirable partial evaluation, such as infinite specialization, from occurring. We describe an algorithm that derives specialization scenarios by declaring the necessary binding-time values at program inputs, aiming at fulfilling any request and satisfy the assert meanwhile. | en_US |
| dc.format.extent | 554655 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2254 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR11/06 | en_US |
| dc.title | Request and Assert: A pragmatic approach to generating specialization scenarios | en_US |
| dc.type | Technical Report | en_US |