16 search results - page 1 / 4 » Common Subexpressions Are Uncommon in Lazy Functional Langua... |
IFL
1997
Springer
13 years 9 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
ICALP
1990
Springer
13 years 9 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
CEFP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we sketch some experiments with the construction of a simple compiler for a high level intermediate lazy functional language, with C++ as a target language....
IFL
2005
Springer
13 years 10 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
FPCA
1993
13 years 9 months ago
1993
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...