ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Electronic Notes in Theoretical Computer Science
Volume 177, 1 June 2007, Pages 201-217
Proceedings of the 15th Workshop on Functional and (Constraint) Logic Programming (WFLP 2006)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (295 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2007.01.012    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Using Template Haskell for Abstract Interpretation

Clara Segura1, a, E-mail The Corresponding Author and Carmen Torranoa, E-mail The Corresponding Author

aDepartamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Madrid, Spain

Available online 30 May 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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.

Keywords: Meta-programming; Template Haskell; abstract interpretation; strictness analysis


Electronic Notes in Theoretical Computer Science
Volume 177, 1 June 2007, Pages 201-217
Proceedings of the 15th Workshop on Functional and (Constraint) Logic Programming (WFLP 2006)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.