6248 search results - page 90 / 1250 » Programming in a data factory |
130
Voted
FUIN
2006
15 years 2 months ago
2006
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...
112
click to vote
POPL
1998
ACM
15 years 6 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
131
click to vote
FPCA
1995
15 years 6 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
121
Voted
IEEEPACT
2005
IEEE
15 years 8 months ago
2005
IEEE
We describe the design, generation and compression of the extended whole program path (eWPP) representation that not only captures the control flow history of a program execution...
115
Voted
JAVA
2000
Springer
15 years 6 months ago
2000
Springer
We describe a system for gathering and analyzing Java trace data. The system provides relatively complete data collection from large Java systems. It also provides a variety of di...