This commit is contained in:
Simon Forman 2022-03-27 12:01:37 -07:00
parent aae78523d3
commit fb2cdff6b9
5 changed files with 381 additions and 409 deletions

File diff suppressed because it is too large Load Diff

View File

@ -2373,7 +2373,7 @@ item of the result on the stack.
... [P] nullary ... [P] nullary
--------------------- ---------------------
... A ... a
### Definition ### Definition
@ -2385,8 +2385,8 @@ item of the result on the stack.
... [P] [stack] dip infra first ... [P] [stack] dip infra first
... stack [P] infra first ... stack [P] infra first
... [...] [P] infra first ... [...] [P] infra first
... [A ...] first ... [a ...] first
... A ... a
### Discussion ### Discussion
@ -2405,91 +2405,75 @@ program.)
## of ## of
Basis Function Combinator Function
swap at Like [getitem] but [swap]s the order of arguments.
Gentzen diagram. ### Example
2 [a b c d] of
--------------------
c
### Definition ### Definition
if not basis. > [swap] [getitem]
### Derivation
if not basis.
### Source
if basis
### Discussion
Lorem ipsum.
### Crosslinks ### Crosslinks
Lorem ipsum. [getitem]
------------------------------------------------------------------------ ------------------------------------------------------------------------
## or ## or
Basis Function Combinator Basis Function
Same as a \| b. Logical bit-wise OR.
Gentzen diagram.
### Definition
if not basis.
### Derivation
if not basis.
### Source
if basis
### Discussion
Lorem ipsum.
### Crosslinks ### Crosslinks
Lorem ipsum. [and]
[xor]
------------------------------------------------------------------------ ------------------------------------------------------------------------
## over ## over
Basis Function Combinator Function
(a2 a1 -- a2 a1 a2) [dup] the second item on the stack `over` the first.
Gentzen diagram. a b over
--------------
a b a
### Definition ### Definition
if not basis. There are many many ways to define this function.
### Derivation > [swap] [tuck]
if not basis. > \[[pop]\] [nullary]
### Source > \[[dup]\] [dip] [swap]
if basis > [unit] [dupdip]
> [unit] [dupdipd] [first]
And so on...
### Discussion ### Discussion
Lorem ipsum. A fine old word from Forth.
### Crosslinks ### Crosslinks
Lorem ipsum. [tuck]
------------------------------------------------------------------------ ------------------------------------------------------------------------

View File

@ -2,28 +2,21 @@
## of ## of
Basis Function Combinator Function
swap at Like [getitem] but [swap]s the order of arguments.
Gentzen diagram. ### Example
2 [a b c d] of
--------------------
c
### Definition ### Definition
if not basis. > [swap] [getitem]
### Derivation
if not basis.
### Source
if basis
### Discussion
Lorem ipsum.
### Crosslinks ### Crosslinks
Lorem ipsum. [getitem]

View File

@ -2,28 +2,12 @@
## or ## or
Basis Function Combinator Basis Function
Same as a \| b. Logical bit-wise OR.
Gentzen diagram.
### Definition
if not basis.
### Derivation
if not basis.
### Source
if basis
### Discussion
Lorem ipsum.
### Crosslinks ### Crosslinks
Lorem ipsum. [and]
[xor]

View File

@ -2,28 +2,35 @@
## over ## over
Basis Function Combinator Function
(a2 a1 -- a2 a1 a2) [dup] the second item on the stack `over` the first.
Gentzen diagram. a b over
--------------
a b a
### Definition ### Definition
if not basis. There are many many ways to define this function.
### Derivation > [swap] [tuck]
if not basis. > \[[pop]\] [nullary]
### Source > \[[dup]\] [dip] [swap]
if basis > [unit] [dupdip]
> [unit] [dupdipd] [first]
And so on...
### Discussion ### Discussion
Lorem ipsum. A fine old word from Forth.
### Crosslinks ### Crosslinks
Lorem ipsum. [tuck]