From 6a256ca9562cd593b68e312c3c4de5146272db04 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Fri, 8 Jan 2021 21:47:53 -0500 Subject: Span hasn't been introduced yet! --- docs/tutorial/combinator.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'docs/tutorial') diff --git a/docs/tutorial/combinator.html b/docs/tutorial/combinator.html index 2724cc25..d9e159ae 100644 --- a/docs/tutorial/combinator.html +++ b/docs/tutorial/combinator.html @@ -485,7 +485,7 @@ -

What about the one-argument case? The structure of application is exactly the same, except that there's only one argument available, so it's used in both input positions. If I describe it that way, it sounds like lazy design, but the ability to use one argument in two ways makes the one-argument versions of Before and After even more useful than the two-argument ones. For example, consider the function y = x×(1-x), which gives a parabola that's equal to 0 at 0 and 1, and peaks between them when x is 0.5. Remembering that Span (¬) is defined so that ¬x is 1-x, we can write this function as either ¬⊸× or ×⟜¬.

+

What about the one-argument case? The structure of application is exactly the same, except that there's only one argument available, so it's used in both input positions. If I describe it that way, it sounds like lazy design, but the ability to use one argument in two ways makes the one-argument versions of Before and After even more useful than the two-argument ones. For example, consider the function y = x×(1-x), which gives a parabola that's equal to 0 at 0 and 1, and peaks between them when x is 0.5. The function Not (¬, which we'll discuss in a later tutorial) is defined so that ¬x is 1-x, which conveniently allows us to write this function as either ¬⊸× or ×⟜¬.

↗️
    ¬⊸× 0.5
 0.25
-- cgit v1.2.3