655 search results - page 56 / 131 » On Flat Programs with Lists |
SAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
EUROPAR
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
SAIG
2001
Springer
14 years 5 days ago
2001
Springer
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...
WSCG
2001
13 years 9 months ago
2001
Research performed in the field of computer vision has steadily ignored recent advances in programming tools and techniques, relying on well-established traditional methods, such ...
ICAI
2010
13 years 5 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...