Sciweavers

28 search results - page 1 / 6
» On Program Transformation in the Glasgow Haskell Compiler
Sort
View
FP
1992
87views Formal Methods» more  FP 1992»
13 years 9 months ago
On Program Transformation in the Glasgow Haskell Compiler
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...
André Santos, Simon L. Peyton Jones
ICFP
2007
ACM
14 years 4 months ago
Call-pattern specialisation for haskell programs
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...
Simon L. Peyton Jones
ENTCS
2007
100views more  ENTCS 2007»
13 years 4 months ago
Using Template Haskell for Abstract Interpretation
mplate Haskell for Abstract Interpretation Clara Segura1 ,2 Departamento de Sistemas Inform´aticos y Programaci´on Universidad Complutense de Madrid Madrid, Spain Carmen Torrano3...
Clara Segura, Carmen Torrano
POPL
2007
ACM
14 years 5 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
JFP
2002
96views more  JFP 2002»
13 years 4 months ago
Secrets of the Glasgow Haskell Compiler inliner
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...
Simon L. Peyton Jones, Simon Marlow