Sciweavers

JFP
2002
96views more  JFP 2002»
14 years 3 days 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
HASKELL
2007
ACM
14 years 4 months ago
Lightweight concurrency primitives for GHC
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...
Peng Li, Simon Marlow, Simon L. Peyton Jones, Andr...
FP
1992
87views Formal Methods» more  FP 1992»
14 years 4 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
SAC
2004
ACM
14 years 5 months ago
A back-end for GHC based on categorical multi-combinators
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...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...
HASKELL
2005
ACM
14 years 6 months ago
Haskell on a shared-memory multiprocessor
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...
Tim Harris, Simon Marlow, Simon L. Peyton Jones
TLCA
2009
Springer
14 years 7 months ago
Parametricity for Haskell with Imprecise Error Semantics
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...
Florian Stenger, Janis Voigtländer
ICFP
2007
ACM
15 years 12 days 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
POPL
2007
ACM
15 years 23 days ago
Data parallel Haskell: a status report
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...
Manuel M. T. Chakravarty, Roman Leshchinskiy, Simo...
POPL
2007
ACM
15 years 23 days 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