View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Strictness analysis in Helium

        Thumbnail
        View/Open
        Thesis-MarcovandeWeerthof-final.pdf (341.2Kb)
        Publication date
        2021
        Author
        Weerthof, M. van de
        Metadata
        Show full item record
        Summary
        Strictness analysis is an important optimization in compilers for lazy languages. Expressions which are guaranteed to be used should preferably be evaluated in a strict manner to improve performance. This thesis implements strictness analysis in the Helium compiler for Haskell. The analysis is based on relevance and applicativeness typing. A monovariant and polyvariant analysis are proposed, with an optimal precision-speed balance required. The monovariant analysis with monotypes provides the best trade-off, while the polyvariant analysis provides better precision but at an increased analysis cost. An alternative system without applicativeness annotations was proposed which could have improved the balance even further, but this turned out to be unsound.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/41247
        Collections
        • Theses
        Utrecht university logo