In this paper we describe a series of program transformations that are currently being implemented in the Glasgow Haskell Compiler. They are semantics preserving program transform...
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
mplate Haskell for Abstract Interpretation Clara Segura1 ,2 Departamento de Sistemas Inform´aticos y Programaci´on Universidad Complutense de Madrid Madrid, Spain Carmen Torrano3...
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Higher-order languages, such as Haskell, encourage the proto build abstractions by composing functions. A good compiler must inline many of these calls to recover an e ciently exe...