From 9a2978af122dc0c043020c77d96318679cb7575a Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sun, 8 May 2022 13:48:52 -0400 Subject: Add combinator documentation links to tutorials --- docs/tutorial/combinator.html | 1 + 1 file changed, 1 insertion(+) (limited to 'docs/tutorial/combinator.html') 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 @@ +

Documentation: Atop and Over, Before and After, Self/Swap, Constant.

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.

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 fully 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 because 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.

-- cgit v1.2.3