diff options
| author | Marvin Borner | 2023-12-14 20:14:49 +0100 |
|---|---|---|
| committer | Marvin Borner | 2023-12-15 03:04:16 +0100 |
| commit | d22c013e4e74889a82004b05aab1158b98cfafc9 (patch) | |
| tree | 272e33637521ab46fb375be8a72e3b6983755c0b /docs/wiki_src | |
| parent | b572418b4a4f6ba647a9aaed0bd82bfe9189d9a8 (diff) | |
Minor documentation fixes
Diffstat (limited to 'docs/wiki_src')
| -rw-r--r-- | docs/wiki_src/coding/data-structures.md | 4 | ||||
| -rw-r--r-- | docs/wiki_src/coding/mixfix.md | 3 | ||||
| -rw-r--r-- | docs/wiki_src/technical/performance.md | 2 |
3 files changed, 6 insertions, 3 deletions
diff --git a/docs/wiki_src/coding/data-structures.md b/docs/wiki_src/coding/data-structures.md index 3d2a387..e59fa99 100644 --- a/docs/wiki_src/coding/data-structures.md +++ b/docs/wiki_src/coding/data-structures.md @@ -60,6 +60,10 @@ a-box <>'a' :test (store! a-box 'b') (<>'b') ``` +Options ([`std/Option`](/std/Option.bruijn.html)) use the same data +structure and have additional definitions to resemble Haskell's +`Maybe`{.haskell}. + ## Pairs [`std/Pair`](/std/Pair.bruijn.html) Pairs (tuples) can store any two terms. Pairs can be constructed using diff --git a/docs/wiki_src/coding/mixfix.md b/docs/wiki_src/coding/mixfix.md index d0838cf..43e2100 100644 --- a/docs/wiki_src/coding/mixfix.md +++ b/docs/wiki_src/coding/mixfix.md @@ -41,8 +41,7 @@ chain is not actually overwritten by *another* mixfix chain. ``` bruijn :test ((+8) + (-4) ⋅ (-2)) ((-8)) -# (don't do this) -…+…⋅… [[[(+16)]]] +…+…⋅… [[[2 + (1 ⋅ 0)]]] :test ((+8) + (-4) ⋅ (-2)) ((+16)) ``` diff --git a/docs/wiki_src/technical/performance.md b/docs/wiki_src/technical/performance.md index 05fd683..002a6b8 100644 --- a/docs/wiki_src/technical/performance.md +++ b/docs/wiki_src/technical/performance.md @@ -6,7 +6,7 @@ an extension, bruijn also suffers from bad performance. Bruijn's interpreter works by substituting the entire program into one huge lambda calculus term that will then get reduced by the [reducer](reduction.md). As a result, many equivalent terms get -evaluated multiple times (although some of this get's solved by bruijn's +evaluated multiple times (although some of this is solved by bruijn's call-by-need reduction strategy). We currently work on a solution that reduces all equivalent terms as one, which turns out is not actually that trivial. Follow the [blog](https://text.marvinborner.de) to keep up |