Using Template Haskell for Abstract Interpretation | Zendy

Clara Segura | Zendy; Carmen Torrano | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Using Template Haskell for Abstract Interpretation

Author(s) -

Clara Segura,

Carmen Torrano

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.01.012

Subject(s) - haskell , compiler , computer science , programming language , metaprogramming , compile time , functional programming , interpretation (philosophy) , extension (predicate logic) , transformation (genetics) , program transformation , generic programming , biochemistry , chemistry , gene

Metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile time. Our aim is to apply these facilities in order to statically analyse programs and transform them at compile time. In this paper we use Template Haskell to implement an abstract interpretation based strictness analysis and a let-to-case transformation that uses the results of the analysis. This work shows the advantages and disadvantages of the tool in order to incorporate new analyses and transformations into the compiler without modifying it

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research