diff options
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/wiki_src/coding/laziness.md | 8 | ||||
| -rw-r--r-- | docs/wiki_src/coding/recursion.md | 5 | ||||
| -rw-r--r-- | docs/wiki_src/technical/performance.md | 1 |
3 files changed, 8 insertions, 6 deletions
diff --git a/docs/wiki_src/coding/laziness.md b/docs/wiki_src/coding/laziness.md index 20d1205..e3d642f 100644 --- a/docs/wiki_src/coding/laziness.md +++ b/docs/wiki_src/coding/laziness.md @@ -38,11 +38,11 @@ Laziness can (in some cases) produce huge performance boosts. For example: ``` bruijn -# 11 seconds -:time (+10) ** (+500) +# 10 seconds +:time (+10) ** (+1000) -# 0.1 seconds -:time ((+10) ** (+500)) =? (+400) +# 0.02 seconds +:time ((+10) ** (+1000)) =? (+42) ``` This works because a ternary number is just a concatenation of trits diff --git a/docs/wiki_src/coding/recursion.md b/docs/wiki_src/coding/recursion.md index 89e71c8..173cd40 100644 --- a/docs/wiki_src/coding/recursion.md +++ b/docs/wiki_src/coding/recursion.md @@ -23,7 +23,7 @@ Say we want a function `g`{.bruijn} to be able to call itself. With the With this equivalence, `g`{.bruijn} is able to call itself since its outer argument is the initial function again. -Example for using `y`{.bruijn} to find the factorial of 2: +Example for using `y`{.bruijn} to find the factorial of 3: ``` bruijn # here, `1` is the induced outer argument `(y g)` @@ -57,7 +57,8 @@ suggestions. For solving mutual recurrence relations, you can use the *variadic fixed-point combinator* `y*`{.bruijn} from [`std/List`](/std/List.bruijn.html). This combinator produces all the -fixed points of a function as an iterable [list](data-structures.md). +fixed points of given functions as an iterable +[list](data-structures.md). Example `even?`{.bruijn}/`odd?`{.bruijn} implementation using `y*`{.bruijn}: diff --git a/docs/wiki_src/technical/performance.md b/docs/wiki_src/technical/performance.md index 709affe..ce3cca0 100644 --- a/docs/wiki_src/technical/performance.md +++ b/docs/wiki_src/technical/performance.md @@ -11,6 +11,7 @@ comparable as possible: - Bruijn uses efficient data structures by default. For example, for nary numbers we use results of Torben Mogensens investigations (as described in [number/byte encodings](../coding/data-structures.md)). +- Bruijn has a `-O` flag that enables abstraction of duplicated terms - The lambda calculus optimizers [BLoC](https://github.com/marvinborner/bloc) and [BLoCade](https://github.com/marvinborner/blocade) are directly |