Sciweavers

1882 search results - page 156 / 377
» Transformational Programming and Forests
Sort
View
SAS
2000
Springer
15 years 1 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 1 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
FPCA
1991
15 years 1 months ago
Syntactic Detection of Single-Threading Using Continuations
We tackle the problem of detecting global variables in functional programs. We present syntactic criteria for single-threading which improves upon previous solutions (both syntact...
Pascal Fradet
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
14 years 11 months ago
Automatic generation of XSLT stylesheets using evolutionary algorithms
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
Pablo García-Sánchez, Juan Juli&aacu...
FUIN
2006
81views more  FUIN 2006»
14 years 10 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones