2011-08-13 05:40, Levent Erkok skrev:
On 8/12/2011 10:30 AM, Conal Elliott wrote:
Note that data-reify will only find *some* common/equal sub-expressions,
namely the pointer-equal ones. In all of my code-generating (deep)
DSLs, it's been very important for efficiency to also pull out
I guess you mean the function that converts an abstract syntax tree to
a directed acyclic graph (DAG).
Just for completeness I should mention that if the object language has
effects including non-termination, one has to be careful eliminating
seemingly common expressions. For example, in
Just to make it explicit, is it
\a i -
let t = a ! i in
if i = 0 then
t
else if i 0 then
t + a ! (i-1)
else
bad idea, because of last else-case? Can it be mended with
one another pass for if-expressions?
The upcoming
:00, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
libraries. You might be able to find examples that you
can adapt to your own AST written with Uniplate or similar library.
On 11 August 2011 05:00, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Is there a library on common sub-expression elimination
:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing
On 8/12/11 12:52 PM, Anton Kholomiov wrote:
Just to make it explicit, is it
\a i -
let t = a ! i in
if i= 0 then
t
else if i 0 then
t + a ! (i-1)
else
bad idea, because of last else-case? Can it be mended with
one
On 8/12/2011 10:30 AM, Conal Elliott wrote:
Note that data-reify will only find *some* common/equal sub-expressions,
namely the pointer-equal ones. In all of my code-generating (deep)
DSLs, it's been very important for efficiency to also pull out
equal-but-pointer-unequal expressions.
-
in let t= a!i a!i might be out of bounds ?
On Fri, Aug 12, 2011 at 9:52 AM, Anton Kholomiov
anton.kholom...@gmail.comwrote:
Just to make it explicit, is it
\a i -
let t = a ! i in
if i = 0 then
t
else if i 0 then
t + a ! (i-1)
.
On 11 August 2011 05:00, Anton Kholomiov anton.kholom...@gmail.com wrote:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
or similar library.
On 11 August 2011 05:00, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
can adapt to your own AST written with Uniplate or similar library.
On 11 August 2011 05:00, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe
:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
14 matches
Mail list logo
