aboutsummaryrefslogtreecommitdiff
path: root/docs/tutorial/combinator.html
diff options
context:
space:
mode:
Diffstat (limited to 'docs/tutorial/combinator.html')
-rw-r--r--docs/tutorial/combinator.html1
1 files changed, 1 insertions, 0 deletions
diff --git a/docs/tutorial/combinator.html b/docs/tutorial/combinator.html
index 23a2d410..baddaa83 100644
--- a/docs/tutorial/combinator.html
+++ b/docs/tutorial/combinator.html
@@ -836,5 +836,6 @@
</g>
</svg>
+<p>Documentation: <a href="../doc/compose.html">Atop and Over</a>, <a href="../doc/hook.html">Before and After</a>, <a href="../doc/swap.html">Self/Swap</a>, <a href="../doc/constant.html">Constant</a>.</p>
<p>A data value (number, character, or array) can be applied as a function, in which case it ignores any arguments and returns itself. In particular, using a data value as the left operand of Before or the right operand of After is called Bind because it attaches that data value as an argument to the other operand.</p>
<p>This section was a bit long because combinators are conceptually difficult, but as you can see we didn't cover all that much material (and our diagrams <em>fully</em> define the combinators in question, which is unusual in a summary!). The tacit style we've used here can be very confusing or uncomfortable at first, maybe <em>because</em> it's so radically simple. We'll keep working with it in future tutorials, and it should start to feel more solid and logical. Even if not, that's okay! As I said, BQN has a more explicit function style as well, and it's completely possible to program without ever using a combinator. But perhaps you'll find that a well-placed Over or Bind can make things a lot smoother.</p>