| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Dijkstra, A. | |
| dc.contributor.advisor | Hage, J. | |
| dc.contributor.author | Verburg, G. | |
| dc.date.accessioned | 2012-09-25T17:01:19Z | |
| dc.date.available | 2012-09-25 | |
| dc.date.available | 2012-09-25T17:01:19Z | |
| dc.date.issued | 2012 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/11635 | |
| dc.description.abstract | This thesis will investigate how strictness analysis can be done using a type-based
approach in a real life compiler. It is inspired by the work of Holdermans et al. [9].
They used relevance typing as an approach to strictness analysis. The work is done in
the context of the Utrecht Haskell Compiler (UHC). For the UHC Core language, an
implementation is defined for the analysis and the transformation.
In this thesis a monovariant analysis is chosen since there is no support for polyvariance
in the code generation. The result is that there is no good support for higher order
functions. Recursion is implemented using fixed point iteration. There is no support
for datatypes yet. | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | en | |
| dc.title | Strictness Analysis in UHC | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Strictness analysis, functional programming, lazy evaluation, relevance typing | |
| dc.subject.courseuu | Computing Science | |
