Time- and size-efficient supercompilation
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. Supercomp...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Luleå tekniska universitet, EISLAB
2011
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26651 http://nbn-resolving.de/urn:isbn:978-91-7439-241-8 |