diff --git a/docs/reference/make_generator.md b/docs/reference/make_generator.md index c260071..31f8965 100644 --- a/docs/reference/make_generator.md +++ b/docs/reference/make_generator.md @@ -2,28 +2,36 @@ ## make_generator -Basis Function Combinator +Function -\[codireco\] ccons +Given an initial state value and a quoted generator function build a +generator quote. -Gentzen diagram. + state [generator function] make_generator + ----------------------------------------------- + [state [generator function] codireco] + +### Example + + 230 [dup ++] make_generator + --------------------------------- + [230 [dup ++] codireco] + +And then: + + [230 [dup ++] codireco] 5 [x] times pop + --------------------------------------------- + 230 231 232 233 234 ### Definition -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis +> \[[codireco]\] [ccons] ### Discussion -Lorem ipsum. +See the ["Using `x` to Generate Values" notebook](https://joypy.osdn.io/notebooks/Generator_Programs.html#an-interesting-variation). ### Crosslinks -Lorem ipsum. +[codireco] + diff --git a/docs/reference/map.md b/docs/reference/map.md index 2801c21..6e55b2d 100644 --- a/docs/reference/map.md +++ b/docs/reference/map.md @@ -2,29 +2,28 @@ ## map -Basis Function Combinator +Combinator -Run the quoted program on TOS on the items in the list under it, push a -new list with the results in place of the program and original list. +Given a list of items and a quoted program run the program for each item +in the list (with the rest of the stack) and replace the old list and the +program with a list of the results. -Gentzen diagram. +### Example -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis + 5 [1 2 3] [++ *] map + -------------------------- + 5 [10 15 20] ### Discussion -Lorem ipsum. +This is a common operation in many languages. In Joy it can be a +parallelism combinator due to the "pure" nature of the language. ### Crosslinks -Lorem ipsum. +[app1] +[app2] +[app3] +[appN](#appn) +[fork] + diff --git a/docs/reference/max.md b/docs/reference/max.md index 58672c7..43d8ffd 100644 --- a/docs/reference/max.md +++ b/docs/reference/max.md @@ -2,28 +2,19 @@ ## max -Basis Function Combinator +Basis Function Given a list find the maximum. -Gentzen diagram. +### Example -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + [1 2 3 4] max + ------------------- + 4 ### Crosslinks -Lorem ipsum. +[min] +[size] +[sum] + diff --git a/docs/reference/min.md b/docs/reference/min.md index 1fafc40..3c50b29 100644 --- a/docs/reference/min.md +++ b/docs/reference/min.md @@ -2,28 +2,19 @@ ## min -Basis Function Combinator +Basis Function Given a list find the minimum. -Gentzen diagram. +### Example -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + [1 2 3 4] min + ------------------- + 1 ### Crosslinks -Lorem ipsum. +[max] +[size] +[sum] + diff --git a/docs/reference/mkref/FuncRef.html b/docs/reference/mkref/FuncRef.html index 62b2eee..94fe2e4 100644 --- a/docs/reference/mkref/FuncRef.html +++ b/docs/reference/mkref/FuncRef.html @@ -1423,97 +1423,80 @@ a F a
Basis Function Combinator
-[codireco] ccons
-Gentzen diagram.
+Function
+Given an initial state value and a quoted generator function build a generator quote.
+ state [generator function] make_generator
+-----------------------------------------------
+ [state [generator function] codireco]
+ 230 [dup ++] make_generator
+---------------------------------
+ [230 [dup ++] codireco]
+And then:
+ [230 [dup ++] codireco] 5 [x] times pop
+---------------------------------------------
+ 230 231 232 233 234
if not basis.
-if not basis.
-if basis
++ +
Lorem ipsum.
+See the “Using x to Generate Values” notebook.
Lorem ipsum.
+Basis Function Combinator
-Run the quoted program on TOS on the items in the list under it, push a new list with the results in place of the program and original list.
-Gentzen diagram.
-if not basis.
-if not basis.
-if basis
+Combinator
+Given a list of items and a quoted program run the program for each item in the list (with the rest of the stack) and replace the old list and the program with a list of the results.
+ 5 [1 2 3] [++ *] map
+--------------------------
+ 5 [10 15 20]
Lorem ipsum.
+This is a common operation in many languages. In Joy it can be a parallelism combinator due to the “pure” nature of the language.
Lorem ipsum.
+Basis Function Combinator
+Basis Function
Given a list find the maximum.
-Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
+ [1 2 3 4] max
+-------------------
+ 4
Lorem ipsum.
+Basis Function Combinator
+Basis Function
Given a list find the minimum.
-Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
+ [1 2 3 4] min
+-------------------
+ 1
Lorem ipsum.
+Basis Function Combinator
-Same as a % b.
-Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
+Basis Function
+Return the remainder of a divided by b.
a b mod
+-------------
+ (a%b)
Lorem ipsum.
+See mod.
Basis Function Combinator
-Same as a * b.
-Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
+Basis Function
+Multiply two numbers.
+ a b mul
+-------------
+ (a×b)
Lorem ipsum.
+Basis Function
@@ -1529,13 +1512,13 @@ a F aBasis Function Combinator
Same as -a.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1544,13 +1527,13 @@ a F aBasis Function Combinator
Same as not a.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1566,20 +1549,20 @@ a F a N !- ---------- N >= 0 true -0 >=
Basis Function Combinator
[nullary] cons
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1590,16 +1573,16 @@ a F a ... [P] nullary
---------------------
... A
-[stack] dip infra first
-... [P] nullary
... [P] [stack] dip infra first
... stack [P] infra first
... [...] [P] infra first
... [A ...] first
... A
-A very useful function that runs any other quoted function and returns it’s first result without disturbing the stack (under the quoted program.)
Basis Function Combinator
swap at
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1623,13 +1606,13 @@ a F aBasis Function Combinator
Same as a | b.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1638,13 +1621,13 @@ a F aBasis Function Combinator
(a2 a1 -- a2 a1 a2)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1653,13 +1636,13 @@ a F aBasis Function Combinator
[i] map
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1674,13 +1657,13 @@ a F a ------------- a+b a-bGentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1689,13 +1672,13 @@ a+b a-bBasis Function Combinator
(a1 --)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1704,13 +1687,13 @@ a+b a-bBasis Function Combinator
(a2 a1 -- a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1719,13 +1702,13 @@ a+b a-bBasis Function Combinator
(a3 a2 a1 -- a2 a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1734,13 +1717,13 @@ a+b a-bBasis Function Combinator
(a2 a1 --)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1749,13 +1732,13 @@ a+b a-bBasis Function Combinator
(a3 a2 a1 -- a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1764,13 +1747,13 @@ a+b a-bBasis Function Combinator
(a4 a3 a2 a1 -- a2 a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1779,13 +1762,13 @@ a+b a-bBasis Function Combinator
pop popop
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1794,13 +1777,13 @@ a+b a-bBasis Function Combinator
Same as a ** b.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1809,13 +1792,13 @@ a+b a-bBasis Function Combinator
Decrement TOS.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1836,13 +1819,13 @@ a+b a-b ------------------------------------------ n > 0 n (n-1) [Base] [Recur] primrec RecurGentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1851,13 +1834,13 @@ a+b a-bBasis Function Combinator
1 swap [*] step
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1866,13 +1849,13 @@ a+b a-bBasis Function Combinator
[unit] dip
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1881,13 +1864,13 @@ a+b a-bBasis Function Combinator
[0 <=] [1 - dup] anamorphism
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1896,13 +1879,13 @@ a+b a-bBasis Function Combinator
unit [down_to_zero] infra
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1911,13 +1894,13 @@ a+b a-bBasis Function Combinator
rest cons
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1935,13 +1918,13 @@ a+b a-b ------------------------ [2 3 1]Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1950,13 +1933,13 @@ a+b a-bBasis Function Combinator
([a1 ...0] -- [...0])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1966,13 +1949,13 @@ a+b a-bReverse the list on the top of the stack. :
reverse == [] swap shunt
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1981,13 +1964,13 @@ a+b a-bBasis Function Combinator
(a1 a2 a3 -- a2 a3 a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -1996,13 +1979,13 @@ a+b a-bBasis Function Combinator
(a1 a2 a3 -- a3 a1 a2)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2018,13 +2001,13 @@ a+b a-bRound a number to a given precision in decimal digits.
The return value is an integer if ndigits is omitted or None. Otherwise the return value has the same type as the number. ndigits may be negative.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2033,13 +2016,13 @@ a+b a-bBasis Function Combinator
([a1 a2 ...1] -- [...1])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2057,13 +2040,13 @@ a+b a-bBasis Function Combinator
<{} infra
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2072,13 +2055,13 @@ a+b a-bBasis Function Combinator
([a1 a2 ...1] -- a2)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2096,13 +2079,13 @@ a+b a-b BThe sequence can contain more than two items but not fewer. Currently Python semantics are used to evaluate the "truthiness" of the Boolean value (so empty string, zero, etc. are counted as false, etc.)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2111,13 +2094,13 @@ a+b a-bBasis Function Combinator
Print redistribution information.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2126,13 +2109,13 @@ a+b a-bBasis Function Combinator
uncons [swons] dip
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2146,13 +2129,13 @@ a+b a-b --------------------------- [f e d a b c]Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2161,13 +2144,13 @@ a+b a-bBasis Function Combinator
[pop ++] step_zero
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2176,13 +2159,13 @@ a+b a-bBasis Function Combinator
Given a list return it sorted.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2191,13 +2174,13 @@ a+b a-bBasis Function Combinator
[[[abs] ii <=] [[<>] [pop !-] ||] &&] [[!-] [[++]] [[--]] ifte dip] [[pop !-] [--] [++] ifte] ifte
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2206,13 +2189,13 @@ a+b a-bBasis Function Combinator
[drop] [take] clop
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2221,13 +2204,13 @@ a+b a-bBasis Function Combinator
[take reverse] [drop] clop
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2236,13 +2219,13 @@ a+b a-bBasis Function Combinator
dup *
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2251,13 +2234,13 @@ a+b a-bBasis Function Combinator
Return the square root of the number a. Negative numbers return complex roots.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2266,13 +2249,13 @@ a+b a-bBasis Function Combinator
(... -- ... [...])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2281,13 +2264,13 @@ a+b a-bBasis Function Combinator
[stack] dip
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2310,13 +2293,13 @@ a+b a-b ... a . Q [b c] [Q] stepThe step combinator executes the quotation on each member of the list on top of the stack.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2325,13 +2308,13 @@ a+b a-bBasis Function Combinator
0 roll> step
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2340,13 +2323,13 @@ a+b a-bBasis Function Combinator
(... a1 -- ... a1 a1 [...])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2355,13 +2338,13 @@ a+b a-bBasis Function Combinator
(... a2 a1 -- ... a2 a1 a1 a2 [...])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2370,13 +2353,13 @@ a+b a-bBasis Function Combinator
Same as a - b.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2385,13 +2368,13 @@ a+b a-bBasis Function Combinator
Increment TOS.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2401,13 +2384,13 @@ a+b a-bGiven a quoted sequence of numbers return the sum. :
sum == 0 swap [+] step
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2416,13 +2399,13 @@ a+b a-bBasis Function Combinator
([...1] -- [...0])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2431,13 +2414,13 @@ a+b a-bBasis Function Combinator
(a1 a2 -- a2 a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2446,13 +2429,13 @@ a+b a-bBasis Function Combinator
[swap] dip
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2461,13 +2444,13 @@ a+b a-bBasis Function Combinator
swap concat
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2476,13 +2459,13 @@ a+b a-bBasis Function Combinator
([...1] a1 -- [a1 ...1])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2491,13 +2474,13 @@ a+b a-bBasis Function Combinator
[i] genrec
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2509,13 +2492,13 @@ a+b a-b ---------------------- [b a]Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2526,9 +2509,9 @@ a+b a-b ... z y x [P] unary
-------------------------
... A
-binary popd
-Runs any other quoted function and returns its first result while consuming exactly three items from the stack.
Basis Function Combinator
([a1 a2 a3 ...1] -- a3)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2565,13 +2548,13 @@ a+b a-b ------------------------------------- w/ n > 1 ... . Q (n - 1) [Q] timesGentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2583,13 +2566,13 @@ a+b a-bBasis Function Combinator
(a2 a1 -- a1 a2 a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2600,9 +2583,9 @@ a+b a-b ... x [P] unary
---------------------
... A
-nullary popd
-Runs any other quoted function and returns its first result while consuming exactly one item from the stack.
[A ...] uncons
--------------------
A [...]
-func(uncons, Si, So) :- func(cons, So, Si).
-This is the inverse of cons.
Basis Function Combinator
Given a list remove duplicate items.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2639,13 +2622,13 @@ a+b a-bBasis Function Combinator
(a1 -- [a1 ])
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2654,13 +2637,13 @@ a+b a-bBasis Function Combinator
[i] dip
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2669,13 +2652,13 @@ a+b a-bBasis Function Combinator
([a1 ...1] -- [...1] a1)
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2684,13 +2667,13 @@ a+b a-bBasis Function Combinator
True if the form on TOS is void otherwise False.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2699,13 +2682,13 @@ a+b a-bBasis Function Combinator
Print warranty information.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2714,13 +2697,13 @@ a+b a-bBasis Function Combinator
swap nulco dupdipd concat loop
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2729,13 +2712,13 @@ a+b a-bBasis Function Combinator
Print all the words in alphabetical order.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2745,22 +2728,22 @@ a+b a-b [F] x
-----------
[F] F
-dup i
-The x combinator …
Basis Function Combinator
Same as a ^ b.
Gentzen diagram.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
@@ -2769,13 +2752,13 @@ a+b a-bBasis Function Combinator
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.
-if not basis.
-if not basis.
-if basis
-Lorem ipsum.
Lorem ipsum.
diff --git a/docs/reference/mkref/Functor-Reference.md b/docs/reference/mkref/Functor-Reference.md index cc4bc22..01432e1 100644 --- a/docs/reference/mkref/Functor-Reference.md +++ b/docs/reference/mkref/Functor-Reference.md @@ -2122,152 +2122,129 @@ stack, replacing them with a Boolean value. ## make_generator -Basis Function Combinator +Function -\[codireco\] ccons +Given an initial state value and a quoted generator function build a +generator quote. -Gentzen diagram. + state [generator function] make_generator + ----------------------------------------------- + [state [generator function] codireco] + +### Example + + 230 [dup ++] make_generator + --------------------------------- + [230 [dup ++] codireco] + +And then: + + [230 [dup ++] codireco] 5 [x] times pop + --------------------------------------------- + 230 231 232 233 234 ### Definition -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis +> \[[codireco]\] [ccons] ### Discussion -Lorem ipsum. +See the ["Using `x` to Generate Values" notebook](https://joypy.osdn.io/notebooks/Generator_Programs.html#an-interesting-variation). ### Crosslinks -Lorem ipsum. +[codireco] + ------------------------------------------------------------------------ ## map -Basis Function Combinator +Combinator -Run the quoted program on TOS on the items in the list under it, push a -new list with the results in place of the program and original list. +Given a list of items and a quoted program run the program for each item +in the list (with the rest of the stack) and replace the old list and the +program with a list of the results. -Gentzen diagram. +### Example -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis + 5 [1 2 3] [++ *] map + -------------------------- + 5 [10 15 20] ### Discussion -Lorem ipsum. +This is a common operation in many languages. In Joy it can be a +parallelism combinator due to the "pure" nature of the language. ### Crosslinks -Lorem ipsum. +[app1] +[app2] +[app3] +[appN](#appn) +[fork] + ------------------------------------------------------------------------ ## max -Basis Function Combinator +Basis Function Given a list find the maximum. -Gentzen diagram. +### Example -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + [1 2 3 4] max + ------------------- + 4 ### Crosslinks -Lorem ipsum. +[min] +[size] +[sum] + ------------------------------------------------------------------------ ## min -Basis Function Combinator +Basis Function Given a list find the minimum. -Gentzen diagram. +### Example -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + [1 2 3 4] min + ------------------- + 1 ### Crosslinks -Lorem ipsum. +[max] +[size] +[sum] + ------------------------------------------------------------------------ ## mod -Basis Function Combinator +Basis Function -Same as a % b. +Return the remainder of `a` divided by `b`. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + a b mod + ------------- + (a%b) ### Crosslinks -Lorem ipsum. +[divmod] +[mul] + -------------- @@ -2280,31 +2257,19 @@ See [mod](#mod). ## mul -Basis Function Combinator +Basis Function -Same as a \* b. +Multiply two numbers. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + a b mul + ------------- + (a×b) ### Crosslinks -Lorem ipsum. +[div] +[product] + ------------------------------------------------------------------------ diff --git a/docs/reference/mod.md b/docs/reference/mod.md index 687044c..9659302 100644 --- a/docs/reference/mod.md +++ b/docs/reference/mod.md @@ -2,28 +2,16 @@ ## mod -Basis Function Combinator +Basis Function -Same as a % b. +Return the remainder of `a` divided by `b`. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + a b mod + ------------- + (a%b) ### Crosslinks -Lorem ipsum. +[divmod] +[mul] + diff --git a/docs/reference/mul.md b/docs/reference/mul.md index 3e579c7..4cfa5d1 100644 --- a/docs/reference/mul.md +++ b/docs/reference/mul.md @@ -2,28 +2,16 @@ ## mul -Basis Function Combinator +Basis Function -Same as a \* b. +Multiply two numbers. -Gentzen diagram. - -### Definition - -if not basis. - -### Derivation - -if not basis. - -### Source - -if basis - -### Discussion - -Lorem ipsum. + a b mul + ------------- + (a×b) ### Crosslinks -Lorem ipsum. +[div] +[product] +