The theory of strictness analysis for higher order functions
on Programs as data objects
Projections for strictness analysis
Proc. of a conference on Functional programming languages and computer architecture
Strictness analysis in logical form
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Template meta-programming for Haskell
ACM SIGPLAN Notices
SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Sized Types for Typing Eden Skeletons
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Parallelism abstractions in eden
Patterns and skeletons for parallel and distributed computing
Non-determinism analyses in a parallel-functional language
Journal of Functional Programming
Preprocessing eden with template haskell
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
| Hi-index | 0.00 |
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.