JFP
2002
13 years 4 months ago
2002
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...
HASKELL
2007
ACM
13 years 8 months ago
2007
ACM
The Glasgow Haskell Compiler (GHC) has quite sophisticated support for concurrency in its runtime system, which is written in lowlevel C code. As GHC evolves, the runtime system b...
FP
1992
13 years 8 months ago
1992
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...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
HASKELL
2005
ACM
13 years 10 months ago
2005
ACM
Multi-core processors are coming, and we need ways to program them. The combination of purely-functional programming and explicit, monadic threads, communicating using transaction...
TLCA
2009
Springer
13 years 11 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
ICFP
2007
ACM
14 years 4 months ago
2007
ACM
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...
POPL
2007
ACM
14 years 4 months ago
2007
ACM
We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original p...
POPL
2007
ACM
14 years 4 months ago
2007
ACM
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...