Sciweavers

2000 search results - page 193 / 400
» Program Transformation and Proof Transformation
Sort
View
138
Voted
IJCAI
1989
15 years 5 months ago
Program Derivation Using Analogy
We present a methodology for using analogy to derive programs based on a derivational transformation method. The derived programs are deductively closed under the rules in the kno...
Mehdi T. Harandi, Sanjay Bhansali
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
15 years 9 months ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
ICFP
2004
ACM
16 years 3 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 10 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
CC
2005
Springer
120views System Software» more  CC 2005»
15 years 9 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