Re: [Toss-devel] Bounded/Guarded Sum
Status: Beta
Brought to you by:
lukaszkaiser
From: Lukasz S. <luk...@gm...> - 2010-06-29 21:39:31
|
The optimized version is technically a little bit nontrivial, actually! An optimized version instead of multiplying by Char(Gi) inside recursive calls Alg(Ei), replaces Sum(Vi,Alg(Ei)) by Sum(Vi,Gi,Alg(Ei)). For this to work, distribute "Sum"s from existential quantification over "Plus"es from DNF disjunctions. So, I need to push "Sum" and pull "Char" so that they meet. But this way "Char" disappears and "Sum" is bounded to be computed only when needed. On Tue, Jun 29, 2010 at 10:35 PM, Lukasz Kaiser <luk...@gm...> wrote: >> I will try to get to it and change sum to include the guard as well. > > Done and committed - both the performance bug and guarded sum > are now done. You can try to optimize your stuff to use the guards > in the sum, for now I only put "true" in it to make it compile somehow. > > Best! > > Lukasz > |