aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--README.md2
-rw-r--r--docs/index.html2
2 files changed, 2 insertions, 2 deletions
diff --git a/README.md b/README.md
index 35b1ecc6..2ebfb4ad 100644
--- a/README.md
+++ b/README.md
@@ -25,7 +25,7 @@ repl ∾< ∾(""Enc˜"script"Attr"src"≍○<∾⟜".js")¨"bqn"‿"repl"
**BQN** is a new programming language in the APL lineage, which aims to remove irregular and burdensome aspects of the APL tradition and put the great ideas on a firmer footing. While its use demands a solid understanding of functions and multidimensional arrays, BQN's focus on providing simple, consistent, and powerful array operations (and documentation!) makes it a good language for learning array programming and building stronger array intuition.
BQN maintains many of the ideas that made APL\360 revolutionary in 1966:
-* Human-friendly **infix notation** has no precedence rules to remember.
+* Human-friendly [**infix notation**](tutorial/expression.md) has no precedence rules to remember.
* [**Built-in array operations**](doc/primitive.md) handle any number of dimensions easily.
* **Higher-order functions** allow basic functions to be applied in more powerful ways.
diff --git a/docs/index.html b/docs/index.html
index f324cd68..e09205cb 100644
--- a/docs/index.html
+++ b/docs/index.html
@@ -24,7 +24,7 @@
<p><strong>BQN</strong> is a new programming language in the APL lineage, which aims to remove irregular and burdensome aspects of the APL tradition and put the great ideas on a firmer footing. While its use demands a solid understanding of functions and multidimensional arrays, BQN's focus on providing simple, consistent, and powerful array operations (and documentation!) makes it a good language for learning array programming and building stronger array intuition.</p>
<p>BQN maintains many of the ideas that made APL\360 revolutionary in 1966:</p>
<ul>
-<li>Human-friendly <strong>infix notation</strong> has no precedence rules to remember.</li>
+<li>Human-friendly <a href="tutorial/expression.html"><strong>infix notation</strong></a> has no precedence rules to remember.</li>
<li><a href="doc/primitive.html"><strong>Built-in array operations</strong></a> handle any number of dimensions easily.</li>
<li><strong>Higher-order functions</strong> allow basic functions to be applied in more powerful ways.</li>
</ul>