| P. Wadler, Listlessness is better than laziness II, in "Programs as Data Objects," Lecture Notes in Computer Science, Vol. 217, Springer-Verlag, Berlin, 1985. |
....generalized this to any i and o. ffl The normal form used by Paredaen and Van Gucht is a normal form of logic formulae and the intuition behind their proof is mainly that of logical equivalence. In our case, our inspiration comes from a well known optimization strategy (see Wadler s early paper [23, 24] on this subject) In plain terms, we have evaluated the query without looking at the input and managed to flatten the query sufficiently until all intermediate operators of higher heights are optimized out. This idea is summarized by the rewriting rule fe j Delta 1 ; x 2 fe 0 j Delta 0 g; ....
P. Wadler. Listlessness is better than laziness II. In H. Ganzinger and N. D. Jones, editors, LNCS 217: Programs as Data Objects. Springer-Verlag, October 1985.
....and o. ffl The normal form used by Paredaens and Van Gucht is a normal form of logic formulae and the intuition behind their proof is mainly that of logical equivalence and quantifier elimination. In our case, the inspiration comes from a well known optimization strategy (see Wadler s early paper [32, 33] on this subject) In plain terms, we have evaluated the query without looking at the input and managed to flatten the query sufficiently until all intermediate operators of higher heights are optimized out. This idea is summarized by the pipeline rule fe j Delta 1 ; x 2 fe 0 j Delta 0 g; ....
P. Wadler, Listlessness is better than laziness II, in "Programs as Data Objects," Lecture Notes in Computer Science, Vol. 217, Springer-Verlag, Berlin, 1985.
No context found.
P. Wadler, Listlessness is better than laziness II, in "Programs as Data Objects," Lecture Notes in Computer Science, Vol. 217, Springer-Verlag, Berlin, 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC