Strictness analysis for a class of second order functional languages

  • Frédéric Burlet

    Student thesis: Master types › Master in Computer science

    Abstract

    Strictness analysis is a method of static analysis based on abstract interpretation
    for functional programs. The purpose of this technique is to transform call-by-name into call-by-value when the result of fonction call are identical. So, the semantics of call-by-name is unchanged and the evaluation of the result is more efficient. This analysis is applied to a second order functional language
    Date of Award2002
    Original languageEnglish
    SupervisorBaudouin LE CHARLIER (Supervisor)

    Cite this

    Documents

    '