linear iterative functions. Similarly patterns
can be written for functions which replicate the behavior of an
already existing function (such as reverse, map, apply etc) and a rule
to replace those functions with the predefined ones.
Thank you,
Andru Gheorghiu
--
You received this message
am.
I suppose an approach can be found which makes the best out of both
worlds: a tree shaker and constant folding implementation + an
automated program which detects recursions and replaces them with more
efficient versions and a rule-based system to cover some cases which
the first approach misses.
And
Thank you for the responses. I'm looking into the resources you gave
me.
Andru Gheorghiu
On Mar 21, 1:16 pm, Sanel Zukan wrote:
> I'm happy to see you are familiar with the subject :)
>
> I was thinking that a
>
> > similar program for Clojure could detect s
have
avoided this?
Andru Gheorghiu
On Mar 22, 1:41 pm, Andru Gheorghiu wrote:
> Thank you for the responses. I'm looking into the resources you gave
> me.
>
> Andru Gheorghiu
>
> On Mar 21, 1:16 pm, Sanel Zukan wrote:
>
>
>
>
>
>
>
> > I'
s the global n defined outside the let.
Andru Gheorghiu
On Apr 6, 10:56 am, Sanel Zukan wrote:
> This looks really nice; good work!
>
> To force evaluation of lazy constructs, you can use 'doall' and 'dorun'.
> Can you show the snippet with this problem?
>
&g
