diff --git a/docs/reference/mkref/FuncRef.html b/docs/reference/mkref/FuncRef.html index 879fc2e..bf874f1 100644 --- a/docs/reference/mkref/FuncRef.html +++ b/docs/reference/mkref/FuncRef.html @@ -2439,103 +2439,63 @@ a F a

void

-

Basis Function Combinator

+

Basis Function

True if the form on TOS is void otherwise False.

-

Gentzen diagram.

-

Definition

-

if not basis.

-

Derivation

-

if not basis.

-

Source

-

if basis

Discussion

-

Lorem ipsum.

- -

Lorem ipsum.

+

A form is any Joy expression composed solely of lists. This represents a binary Boolean logical formula in the arithmetic of the “Laws of Form”, see The Markable Mark

warranty

-

Basis Function Combinator

+

Basis Function

Print warranty information.

-

Gentzen diagram.

-

Definition

-

if not basis.

-

Derivation

-

if not basis.

-

Source

-

if basis

-

Discussion

-

Lorem ipsum.

- -

Lorem ipsum.

while

-

Basis Function Combinator

-

swap nulco dupdipd concat loop

-

Gentzen diagram.

-

Definition

-

if not basis.

-

Derivation

-

if not basis.

-

Source

-

if basis

-

Discussion

-

Lorem ipsum.

- -

Lorem ipsum.

+

Combinator

+

A specialization of loop that accepts a quoted predicate program P and runs it nullary.

+
   [P] [F] while
+------------------- P -> false
+
+    [P] [F] while
+--------------------- P -> true
+   F [P] [F] while
+

Definition

+
+

swap nulco dupdipd concat loop

+
+ +

loop

words

-

Basis Function Combinator

+

Basis Function

Print all the words in alphabetical order.

-

Gentzen diagram.

-

Definition

-

if not basis.

-

Derivation

-

if not basis.

-

Source

-

if basis

-

Discussion

-

Lorem ipsum.

- -

Lorem ipsum.

+

Discussion

+

Mathematically this is a form of id.

+ +

help

x

-

(Combinator)

+

Combinator

+

Take a quoted function F and run it with itself as the first item on the stack.

   [F] x
 -----------
    [F] F
-

Definition

+

Definition

dup i
-

Discussion

-

The x combinator …

+

Discussion

+

The simplest recursive pattern.

+

See the Recursion Combinators notebook. as well as Recursion Theory and Joy by Manfred von

xor

-

Basis Function Combinator

-

Same as a ^ b.

-

Gentzen diagram.

-

Definition

-

if not basis.

-

Derivation

-

if not basis.

-

Source

-

if basis

-

Discussion

-

Lorem ipsum.

- -

Lorem ipsum.

+

Basis Function

+

Logical bit-wise eXclusive OR.

+ +

and or

zip

-

Basis Function Combinator

+

Function

Replace the two lists on the top of the stack with a list of the pairs from each list. The smallest list sets the length of the result list.

-

Gentzen diagram.

-

Definition

-

if not basis.

-

Derivation

-

if not basis.

-

Source

-

if basis

-

Discussion

-

Lorem ipsum.

- -

Lorem ipsum.

+

Example

+
   [1 2 3] [4 5 6] zip
+-------------------------
+   [[4 1] [5 2] [6 3]]
diff --git a/docs/reference/mkref/Functor-Reference.md b/docs/reference/mkref/Functor-Reference.md index effdeaa..f78af40 100644 --- a/docs/reference/mkref/Functor-Reference.md +++ b/docs/reference/mkref/Functor-Reference.md @@ -3940,127 +3940,76 @@ Function ## void -Basis Function Combinator +Basis Function True if the form on TOS is void otherwise False. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - ### Discussion -Lorem ipsum. +A form is any Joy expression composed solely of lists. +This represents a binary Boolean logical formula in the arithmetic of the +"Laws of Form", see [The Markable Mark](http://www.markability.net/) -### Crosslinks - -Lorem ipsum. ------------------------------------------------------------------------ ## warranty -Basis Function Combinator +Basis Function Print warranty information. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. - -### Crosslinks - -Lorem ipsum. ------------------------------------------------------------------------ ## while -Basis Function Combinator +Combinator -swap nulco dupdipd concat loop +A specialization of [loop] that accepts a quoted predicate program `P` +and runs it [nullary]. -Gentzen diagram. + [P] [F] while + ------------------- P -> false + + [P] [F] while + --------------------- P -> true + F [P] [F] while ### Definition -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. +> [swap] [nulco] [dupdipd] [concat] [loop] ### Crosslinks -Lorem ipsum. +[loop] + ------------------------------------------------------------------------ ## words -Basis Function Combinator +Basis Function Print all the words in alphabetical order. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - ### Discussion -Lorem ipsum. +Mathematically this is a form of [id]. ### Crosslinks -Lorem ipsum. +[help] + -------------------- ## x -(Combinator) +Combinator + +Take a quoted function `F` and run it with itself as the first item on +the stack. [F] x ----------- @@ -4072,66 +4021,40 @@ Lorem ipsum. ### Discussion -The `x` combinator ... +The simplest recursive pattern. + +See the [Recursion Combinators notebook](https://joypy.osdn.io/notebooks/Recursion_Combinators.html). +as well as +[Recursion Theory and Joy](https://www.kevinalbrecht.com/code/joy-mirror/j05cmp.html) by Manfred von + ------------------------------------------------------------------------ ## xor -Basis Function Combinator +Basis Function -Same as a \^ b. - -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. +Logical bit-wise eXclusive OR. ### Crosslinks -Lorem ipsum. +[and] +[or] + ------------------------------------------------------------------------ ## zip -Basis Function Combinator +Function Replace the two lists on the top of the stack with a list of the pairs from each list. The smallest list sets the length of the result list. -Gentzen diagram. +### Example -### Definition + [1 2 3] [4 5 6] zip + ------------------------- + [[4 1] [5 2] [6 3]] -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. - -### Crosslinks - -Lorem ipsum. diff --git a/docs/reference/void.md b/docs/reference/void.md index 11115cc..9599456 100644 --- a/docs/reference/void.md +++ b/docs/reference/void.md @@ -2,28 +2,13 @@ ## void -Basis Function Combinator +Basis Function True if the form on TOS is void otherwise False. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - ### Discussion -Lorem ipsum. +A form is any Joy expression composed solely of lists. +This represents a binary Boolean logical formula in the arithmetic of the +"Laws of Form", see [The Markable Mark](http://www.markability.net/) -### Crosslinks - -Lorem ipsum. diff --git a/docs/reference/warranty.md b/docs/reference/warranty.md index 997e370..be4792c 100644 --- a/docs/reference/warranty.md +++ b/docs/reference/warranty.md @@ -2,28 +2,7 @@ ## warranty -Basis Function Combinator +Basis Function Print warranty information. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. - -### Crosslinks - -Lorem ipsum. diff --git a/docs/reference/while.md b/docs/reference/while.md index 322a537..c1234b0 100644 --- a/docs/reference/while.md +++ b/docs/reference/while.md @@ -2,28 +2,23 @@ ## while -Basis Function Combinator +Combinator -swap nulco dupdipd concat loop +A specialization of [loop] that accepts a quoted predicate program `P` +and runs it [nullary]. -Gentzen diagram. + [P] [F] while + ------------------- P -> false + + [P] [F] while + --------------------- P -> true + F [P] [F] while ### Definition -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. +> [swap] [nulco] [dupdipd] [concat] [loop] ### Crosslinks -Lorem ipsum. +[loop] + diff --git a/docs/reference/words.md b/docs/reference/words.md index d02f181..5d13803 100644 --- a/docs/reference/words.md +++ b/docs/reference/words.md @@ -2,28 +2,15 @@ ## words -Basis Function Combinator +Basis Function Print all the words in alphabetical order. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - ### Discussion -Lorem ipsum. +Mathematically this is a form of [id]. ### Crosslinks -Lorem ipsum. +[help] + diff --git a/docs/reference/x.md b/docs/reference/x.md index d956a4f..762825e 100644 --- a/docs/reference/x.md +++ b/docs/reference/x.md @@ -2,7 +2,10 @@ ## x -(Combinator) +Combinator + +Take a quoted function `F` and run it with itself as the first item on +the stack. [F] x ----------- @@ -14,5 +17,10 @@ ### Discussion -The `x` combinator ... +The simplest recursive pattern. + +See the [Recursion Combinators notebook](https://joypy.osdn.io/notebooks/Recursion_Combinators.html). +as well as +[Recursion Theory and Joy](https://www.kevinalbrecht.com/code/joy-mirror/j05cmp.html) by Manfred von + diff --git a/docs/reference/xor.md b/docs/reference/xor.md index 66e1ece..fd90599 100644 --- a/docs/reference/xor.md +++ b/docs/reference/xor.md @@ -2,28 +2,12 @@ ## xor -Basis Function Combinator +Basis Function -Same as a \^ b. - -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. +Logical bit-wise eXclusive OR. ### Crosslinks -Lorem ipsum. +[and] +[or] + diff --git a/docs/reference/zip.md b/docs/reference/zip.md index 9b487e3..fc0efb5 100644 --- a/docs/reference/zip.md +++ b/docs/reference/zip.md @@ -2,29 +2,14 @@ ## zip -Basis Function Combinator +Function Replace the two lists on the top of the stack with a list of the pairs from each list. The smallest list sets the length of the result list. -Gentzen diagram. +### Example -### Definition + [1 2 3] [4 5 6] zip + ------------------------- + [[4 1] [5 2] [6 3]] -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. - -### Crosslinks - -Lorem ipsum.