Heap Recycling Analysis in Helium

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	Wolff, I.G. de
dc.contributor.advisor	Hage, J.
dc.contributor.author	Klei, T.M.L. van
dc.date.accessioned	2020-08-28T18:00:18Z
dc.date.available	2020-08-28T18:00:18Z
dc.date.issued	2020
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/37136
dc.description.abstract	Pure functional programming languages, such has Haskell, preclude destructive updates of heap-allocated data. To update a newly computed algebraic value, fresh heap space is allocated to store the result. This causes idiomatic programs to be notoriously inefficient when compared to their imperative and impure counterparts. J. Hage and S. Holdermans describe in `Heap Recycling for Lazy Languages` a way to partly overcome this shortcoming. We implement the described analysis in the Haskell compiler Helium and analyze the memory usage of various programs.
dc.description.sponsorship	Utrecht University
dc.format.extent	541942
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.title	Heap Recycling Analysis in Helium
dc.type.content	Master Thesis
dc.rights.accessrights	Open Access
dc.subject.courseuu	Computing Science