aboutsummaryrefslogtreecommitdiff
path: root/docs/doc/primitive.html
diff options
context:
space:
mode:
authorMarshall Lochbaum <mwlochbaum@gmail.com>2021-06-28 14:16:12 -0400
committerMarshall Lochbaum <mwlochbaum@gmail.com>2021-06-28 14:17:37 -0400
commit59811c3d764e0aee7899601bf5c524c661890e39 (patch)
treecda4169d7a7ed01ef2d01c2f3356239d52852d65 /docs/doc/primitive.html
parent35a7ff22e400968ef1d9b89bb43564197f43f001 (diff)
Link to primitive commentary page
Diffstat (limited to 'docs/doc/primitive.html')
-rw-r--r--docs/doc/primitive.html2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/doc/primitive.html b/docs/doc/primitive.html
index 4822d10a..9eddb08d 100644
--- a/docs/doc/primitive.html
+++ b/docs/doc/primitive.html
@@ -5,7 +5,7 @@
</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 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><em>Primitives</em> are the basic functions and modifiers built into the language, written with individual glyphs (more about the concept <a href="../commentary/primitive.html">here</a>). 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 &quot;impure&quot; tasks like file access or other I/O.</p>
<h2 id="functions">Functions</h2>