Positive supercompilation for a higher-order call-by-value language
Intermediate structures such as lists and higher-order functions are very common in most styles of functional programming. While allowing the programmer to write clear and concise programs, the creation and destruction of these structures impose a run time overhead which is not negligible. Deforesta...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Luleå tekniska universitet, EISLAB
2008
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-18604 |