More actions
imported>linflus No edit summary |
imported>linflus No edit summary |
||
| Line 2: | Line 2: | ||
== 11/26 == | == 11/26 == | ||
* naturalSequence().filter(limit(n)).reduce(sum) | * | ||
** sum(a, b) := a + b | naturalSequence().filter(limit(n)).reduce(sum) | ||
** limit(n)(a) := (n | ** | ||
sum(a, b) := a + b | |||
** | |||
limit(n)(a) := (n >= a) | |||
** | ** | ||
.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last]) | .reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last]) | ||
** filter(f(a)) := for each a in seq, sequence of a which f(a) is true. | ** | ||
filter(f(a)) := for each a in seq, sequence of a which f(a) is true. | |||
Revision as of 13:58, 26 November 2011
Implementing Infinite Data Structure in JavaScript.
11/26
naturalSequence().filter(limit(n)).reduce(sum)
sum(a, b) := a + b
limit(n)(a) := (n >= a)
.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])
filter(f(a)) := for each a in seq, sequence of a which f(a) is true.