Sciweavers

1882 search results - page 182 / 377
» Transformational Programming and Forests
Sort
View
ICFP
2004
ACM
15 years 10 months ago
Scrap more boilerplate: reflection, zips, and generalised casts
Writing boilerplate code is a royal pain. Generic programming promises to alleviate this pain by allowing the programmer to write a generic "recipe" for boilerplate code...
Ralf Lämmel, Simon L. Peyton Jones
HASKELL
2009
ACM
15 years 4 months ago
The architecture of the Utrecht Haskell compiler
In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some ex...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra
84
Voted
CC
2005
Springer
120views System Software» more  CC 2005»
15 years 3 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula
90
Voted
SAIG
2001
Springer
15 years 2 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
86
Voted
ICFP
1997
ACM
15 years 2 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves