Efficient Strictness Analysis of Haskell

Kristian Damm Jensen, Peter Hjæresen, Mads Rosendahl

    Publikation: Bidrag til bog/antologi/rapportBidrag til bog/antologiForskning

    Resumé

    Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy functional programming languages. This paper focuses on an actual implementation of a strictness analyser for Haskell. The analyser uses abstract interpretation with chaotic fixpoint iteration. The demand-driven nature of this iteration technique allows us to use large domains including function domains in the style of Burn et al. 1986 and Wadler 87 and retain reasonable efficiency. The implementation, furthermore, allows us to introduce a new way of handling polymorphism by parameterizing the strictness functions with domain-variables. Finally we present some results of efficiency and precision and compare them to other works.
    OriginalsprogEngelsk
    TitelStatic Analysis, First International Static Analysis Symposium, SAS'94
    Antal sider17
    Udgivelses stedNamur, Belgien
    ForlagSpringer
    Publikationsdato1994
    Sider246-362
    ISBN (Trykt)3-540-58485-4
    StatusUdgivet - 1994
    NavnLecture Notes in Computer Science
    Vol/bind864
    ISSN0302-9743

    Citer dette

    Jensen, K. D., Hjæresen, P., & Rosendahl, M. (1994). Efficient Strictness Analysis of Haskell. I Static Analysis, First International Static Analysis Symposium, SAS'94 (s. 246-362). Namur, Belgien: Springer. Lecture Notes in Computer Science, Bind. 864
    Jensen, Kristian Damm ; Hjæresen, Peter ; Rosendahl, Mads. / Efficient Strictness Analysis of Haskell. Static Analysis, First International Static Analysis Symposium, SAS'94. Namur, Belgien : Springer, 1994. s. 246-362 (Lecture Notes in Computer Science, Bind 864).
    @inbook{129ec32052be11dba4bc000ea68e967b,
    title = "Efficient Strictness Analysis of Haskell",
    abstract = "Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy functional programming languages. This paper focuses on an actual implementation of a strictness analyser for Haskell. The analyser uses abstract interpretation with chaotic fixpoint iteration. The demand-driven nature of this iteration technique allows us to use large domains including function domains in the style of Burn et al. 1986 and Wadler 87 and retain reasonable efficiency. The implementation, furthermore, allows us to introduce a new way of handling polymorphism by parameterizing the strictness functions with domain-variables. Finally we present some results of efficiency and precision and compare them to other works.",
    author = "Jensen, {Kristian Damm} and Peter Hj{\ae}resen and Mads Rosendahl",
    year = "1994",
    language = "English",
    isbn = "3-540-58485-4",
    pages = "246--362",
    booktitle = "Static Analysis, First International Static Analysis Symposium, SAS'94",
    publisher = "Springer",

    }

    Jensen, KD, Hjæresen, P & Rosendahl, M 1994, Efficient Strictness Analysis of Haskell. i Static Analysis, First International Static Analysis Symposium, SAS'94. Springer, Namur, Belgien, Lecture Notes in Computer Science, bind 864, s. 246-362.

    Efficient Strictness Analysis of Haskell. / Jensen, Kristian Damm; Hjæresen, Peter; Rosendahl, Mads.

    Static Analysis, First International Static Analysis Symposium, SAS'94. Namur, Belgien : Springer, 1994. s. 246-362 (Lecture Notes in Computer Science, Bind 864).

    Publikation: Bidrag til bog/antologi/rapportBidrag til bog/antologiForskning

    TY - CHAP

    T1 - Efficient Strictness Analysis of Haskell

    AU - Jensen, Kristian Damm

    AU - Hjæresen, Peter

    AU - Rosendahl, Mads

    PY - 1994

    Y1 - 1994

    N2 - Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy functional programming languages. This paper focuses on an actual implementation of a strictness analyser for Haskell. The analyser uses abstract interpretation with chaotic fixpoint iteration. The demand-driven nature of this iteration technique allows us to use large domains including function domains in the style of Burn et al. 1986 and Wadler 87 and retain reasonable efficiency. The implementation, furthermore, allows us to introduce a new way of handling polymorphism by parameterizing the strictness functions with domain-variables. Finally we present some results of efficiency and precision and compare them to other works.

    AB - Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy functional programming languages. This paper focuses on an actual implementation of a strictness analyser for Haskell. The analyser uses abstract interpretation with chaotic fixpoint iteration. The demand-driven nature of this iteration technique allows us to use large domains including function domains in the style of Burn et al. 1986 and Wadler 87 and retain reasonable efficiency. The implementation, furthermore, allows us to introduce a new way of handling polymorphism by parameterizing the strictness functions with domain-variables. Finally we present some results of efficiency and precision and compare them to other works.

    M3 - Book chapter

    SN - 3-540-58485-4

    SP - 246

    EP - 362

    BT - Static Analysis, First International Static Analysis Symposium, SAS'94

    PB - Springer

    CY - Namur, Belgien

    ER -

    Jensen KD, Hjæresen P, Rosendahl M. Efficient Strictness Analysis of Haskell. I Static Analysis, First International Static Analysis Symposium, SAS'94. Namur, Belgien: Springer. 1994. s. 246-362. (Lecture Notes in Computer Science, Bind 864).