Generating power of lazy semantics

AbstractWe discuss the use of the lazy evaluation scheme as coding tool in some algebraic manipulations. We show —on several examples —how to process the infinite power series or other open-ended data structures with co-recurrent algorithms, which simplify enormously the coding of recurrence relations or solving equations in the power series domain. The important point is not the “infinite” length of the data, but the fact that the algorithms use open recursion, and the user never thinks about the truncation