Sciweavers

28 search results - page 2 / 6
» On Program Transformation in the Glasgow Haskell Compiler
Sort
View
FUIN
2006
85views more  FUIN 2006»
13 years 5 months ago
Higher Order Deforestation
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
Geoff W. Hamilton
HASKELL
2007
ACM
13 years 9 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...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 9 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
TLCA
2009
Springer
13 years 12 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
SIGPLAN
2002
13 years 5 months ago
Template meta-programming for Haskell
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithm...
Tim Sheard, Simon L. Peyton Jones