diff options
Diffstat (limited to 'docs/doc')
| -rw-r--r-- | docs/doc/primitive.html | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/docs/doc/primitive.html b/docs/doc/primitive.html index 62b612dc..19c30c47 100644 --- a/docs/doc/primitive.html +++ b/docs/doc/primitive.html @@ -5,11 +5,11 @@ </head> <div class="nav"><a href="https://github.com/mlochbaum/BQN">BQN</a> / <a href="../index.html">main</a> / <a href="index.html">doc</a></div> <h1 id="bqn-primitives">BQN primitives</h1> -<p><em>Primitives</em> are functions and modifiers that are built into the language and written with individual glyphs. The role of a primitive when written always matches its type (but you can use its value in other roles by assigning it or various other methods).</p> -<p>Primitives have no side effects other than errors, and can't perform infinite computations, except in the case that the operand to a primitive modifier is a function that has side effects or never returns (primitive modifiers never perform computation when passed operands—they always bind the operands and act when called on arguments). Side effects here include both writing state such as variables or printed output, and reading any outside state, so that a function with no side effects always returns the same result if passed the same arguments. Trains and list notation have the same properties, so that tacit code written entirely with primitives, trains, and lists always describes finite, self-contained computations.</p> +<p><em>Primitives</em> are the basic functions and modifiers built into the language, written with individual glyphs. The role of a primitive when written always matches its type (but you can use its value in other roles by assigning it, or other methods).</p> +<p>Primitives have no side effects other than errors, and can't perform infinite computations, except when a primitive modifier calls an operand function that does one of these things (this can only happen when arguments are passed, as primitive modifiers are always deferred). Side effects here include both writing state such as variables or printed output, and reading any outside state, so that a function without them always returns the same result if passed the same arguments. Since trains and list notation have the same nice properties, tacit code written entirely with primitives, trains, and lists always describes finite, self-contained computations.</p> <p>Recursion is the primary way to perform potentially infinite computations in BQN, and it can be packaged into <a href="control.html">control structures</a> like <code><span class='Function'>While</span></code> for ease of use. A given BQN implementation might also provide <a href="../spec/system.html">system values</a> for "impure" tasks like file access or other I/O.</p> <h2 id="functions">Functions</h2> -<p>Functions that have significant differences from APL functions are marked with an asterisk. Primitives without an asterisk don't all have documentation; those without it link to the APL Wiki.</p> +<p>Functions that have significant differences from APL functions are marked with an asterisk. A few of the non-asterisk links go the the APL Wiki currently.</p> <table> <thead> <tr> @@ -496,7 +496,7 @@ <td><code><span class='Modifier'>¨</span></code></td> <td><a href="https://aplwiki.com/wiki/Each">Each</a></td> <td><code><span class='Modifier2'>⚇</span></code></td> -<td>Depth</td> +<td><a href="depth.html#the-depth-modifier">Depth</a></td> </tr> <tr> <td><code><span class='Modifier'>⌜</span></code></td> |