Version -10.0.0
Each function, combinator, or definition should be documented here.
Not negative.
+Version -10.0.0
Each function, combinator, or definition should be documented here.
Not negative.
n !-
----------- n < 0
false
@@ -8,13 +8,13 @@
---------- n >= 0
true
Return a Boolean value indicating if a number is greater than or equal to -zero.
... b a <{}
+zero. ... b a <{}
-----------------
... [] b a
Tuck an empty list just under the first two items on the stack.
... a <{}
----------------
... [] a
-Tuck an empty list just under the first item on the stack.
Is the item on the top of the stack "truthy"?
You often want to test the truth value of an item on the stack without +
Tuck an empty list just under the first item on the stack.
Is the item on the top of the stack "truthy"?
You often want to test the truth value of an item on the stack without consuming the item.
combinator
Build a list of values from a generator program G and a stopping
predicate P.
[P] [G] anamorphism
@@ -113,7 +113,7 @@ empty list is false and all other lists are true.<
T
This is one of the fundamental operations (although it can be defined in terms of [choice] as above). The more common "if..then..else" construct -[ifte] adds a predicate function that is evaluated [nullary].
a b c d [...] ccccons
+[ifte] adds a predicate function that is evaluated [nullary]. a b c d [...] ccccons
---------------------------
[a b c d ...]
[a b c] [d e f] concat
----------------------------
[a b c d e f]
-combinator
This combinator works like a case statement. It expects a single quote +
combinator
This combinator works like a case statement. It expects a single quote on the stack that must contain zero or more condition quotes and a default quote. Each condition quote should contain a quoted predicate followed by the function expression to run if that predicate returns @@ -206,7 +206,7 @@ expressions, e.g.: ------------------ [a ...]
Cons is a venerable old function from Lisp. -Its inverse operation is [uncons].
combinator built-in
The dip combinator expects a quoted program on the stack and below it
+Its inverse operation is [uncons].
combinator built-in
The dip combinator expects a quoted program on the stack and below it
some item, it hoists the item into the expression and runs the program
on the rest of the stack.
... x [Q] . dip
@@ -228,7 +228,7 @@ pending expression (not counting modifications to the dictionary.) ... y x [Q] . dipd
-------------------------
... . Q y x
-See [dip].
combinator
Like [dip] but expects three items. :
... z y x [Q] . dipdd
-----------------------------
... . Q z y x
@@ -264,7 +264,7 @@ items removed off the top.
a dup
-----------
a a
-
[dup] the second item down on the stack.
+[dup] the second item down on the stack.
a b dupd
--------------
a a b
@@ -288,7 +288,8 @@ a F a
a [F] dupdipd
-------------------
F a [F]
-
Put the stack onto the stack replacing the contents of the stack.
+Expects a list on the stack and pushes true if it's empty and false otherwise.
+It doesn't consume the list.
Put the stack onto the stack replacing the contents of the stack.
... a b c enstacken
-------------------------
[c b a ...]
@@ -303,7 +304,7 @@ them with a Boolean value.
[a ...]
--------------
a
-
Replace a list with its first two items.
+Replace a list with its first two items.
[a b ...] first_two
-------------------------
a b
@@ -313,7 +314,7 @@ them with a Boolean value.
-------------------------------------
[1 2 3 [4] 5 6 7]
Note that only one "level" of lists is flattened. In the example above
-[4] is not unquoted.
combinator
Run two quoted programs in parallel and replace them with their results.
+[4] is not unquoted.combinator
Run two quoted programs in parallel and replace them with their results.
... [F] [G] fork
----------------------
... f g
@@ -374,7 +375,7 @@ nth position in the quote counting from 0.
c
If the number isn't a valid index into the quote getitem will cause
some sort of problem (the exact nature of which is
-implementation-dependant.)
Expect a number on the top of the stack and [cons] that many items from under it onto a new list.
+implementation-dependant.)Expect a number on the top of the stack and [cons] that many items from under it onto a new list.
a b c d e 3 grabN
-----------------------
@@ -390,21 +391,16 @@ It's part of the [app2] definition.Accepts a quoted symbol on the top of the stack and prints its -documentation.
- [foo] help
-----------------
-Technically this is equivalent to pop, but it will only work if the
-item on the top of the stack is a quoted symbol.
combinator built-in
Append a quoted expression onto the pending expression.
+combinator built-in
Append a quoted expression onto the pending expression.
[Q] . i
-------------
. Q
This is a fundamental combinator. It is used in all kinds of places. For
-example, the [x] combinator can be defined as dup i.
The identity function.
Does nothing. It's kind of a mathematical thing, but it occasionally comes in handy.
combinator
If-Then-Else combinator, a common and convenient specialization of [branch].
+example, the [x] combinator can be defined asdup i.combinator
If-Then-Else combinator, a common and convenient specialization of [branch].
[if] [then] [else] ifte
---------------------------------------
[if] nullary [else] [then] branch
-combinator
Take a quoted program from the stack and run it twice, first under the top item, then again with the top item.
... a [Q] ii
------------------
@@ -427,7 +423,7 @@ top item, then again with the top item.
1 9
1 2 3 4 [+] app2
----------------------
- 1 2 5 6combinator
Accept a quoted program and a list on the stack and run the program with + 1 2 5 6
combinator
Accept a quoted program and a list on the stack and run the program with the list as its stack. Does not affect the stack (below the list.)
... x y z [a b c] [Q] infra
---------------------------------
@@ -515,12 +511,12 @@ parallelism combinator due to the "pure" nature of the language. [1 2 3 4] max
-------------------
4
-Expects two integers on the stack and removes the lesser of them, if they are equal just remove one.
Expects two integers on the stack and removes the greater of them, if they are equal just remove one.
Return the remainder of a divided by b.
a b mod
-------------
(a%b)
@@ -552,7 +548,7 @@ stack, replacing them with a Boolean value.
[[F] nullary]
Helper function for [or] and [and].
True if the item on the top of the stack is an empty list, false if it's a list but not empty, -and an error if it's not a list.
combinator
Run a quoted program without using any stack values and leave the first +and an error if it's not a list.
combinator
Run a quoted program without using any stack values and leave the first item of the result on the stack.
... [P] nullary
---------------------
@@ -614,11 +610,11 @@ the underlying [map] function is so implemented, of course.)[pop] the second item down on the stack.
+[pop] the second item down on the stack.
a b popd
--------------
b
-[pop] the third item on the stack.
+[pop] the third item on the stack.
a b c popdd
-----------------
b c
@@ -679,11 +675,19 @@ together.
Or,
[1] [[mul]] [primrec]
-
Take two items from the stack and put them into a new list.
+joy? 1 2 3 4
+
+1 2 3 4
+
+joy? quote-two
+
+1 2 [3 4]
+"Quote D" Wrap the second item on the stack in a list.
a b quoted
----------------
[a] b
-This comes from the original Joy stuff.
Expect a number n on the stack and replace it with a list:
+
This comes from the original Joy stuff.
Expect a number n on the stack and replace it with a list:
[(n-1)...0].
5 range
@@ -703,15 +707,7 @@ together.
a [b ...] reco
--------------------
[a ...]
-
Expects an item on the stack and a quote under it and removes that item -from the the quote. The item is only removed once. If the list is empty -or the item isn't in the list then the list is unchanged.
- [1 2 3 1] 1 remove
-------------------------
- [2 3 1]
-See the "Remove Function" notebook.
Reverse the list on the top of the stack.
@@ -740,7 +736,7 @@ or the item isn't in the list then the list is unchanged.Use a Boolean value to select one of two items from a sequence. :
+Use a Boolean value to select one of two items from a sequence. :
[a b] false select
------------------------
a
@@ -748,7 +744,7 @@ or the item isn't in the list then the list is unchanged.
[a b] true select
-----------------------
b
-The sequence can contain more than two items but not fewer.
Print redistribution information.
Mathematically this is a form of [id], but it has the side-effect of +
The sequence can contain more than two items but not fewer.
Print redistribution information.
Mathematically this is a form of [id], but it has the side-effect of printing out the GPL notice.
Move the top item from one list to another.
[x y z] [a b c] shift
@@ -767,12 +763,7 @@ preserve order.Return true if the item on the top of the stack is a list with zero or one item in it,
false if it is a list with more than one item in it,
-and an error if it is not a list.
Given a list return it sorted.
- [4 2 5 7 1] sort
-----------------------
- [1 2 4 5 7]
-Split a list (second on the stack) at the position given by the number on +and an error if it is not a list.
Split a list (second on the stack) at the position given by the number on the top of the stack.
[1 2 3 4 5 6 7] 4 split_at
@@ -825,12 +816,7 @@ complement to the "destructive" pair [enstacken] and [disenstacken]. 1 2 3 stuncons
--------------------
1 2 3 3 [2 1]
-Take the [stack] and [uncons] the top two items.
- 1 2 3 stununcons
-----------------------
- 1 2 3 3 2 [1]
-built-in
Subtract the number on the top of the stack from the number below it.
a b sub
-------------
(a-b)
@@ -854,7 +840,7 @@ definition of [infra]. a b c swapd
-----------------
b a c
-Like [cons] but [swap] the item and list.
+Like [cons] but [swap] the item and list.
[...] a swons
-------------------
[a ...]
@@ -920,10 +906,18 @@ the list. You cannot uncons an item from an empty list.
[a ...] uncons
--------------------
a [...]
-
This is the inverse of [cons].
Given a list remove duplicate items.
Expect two non-empty lists on the stack and uncons the first item from each and put them in a new list.
joy? [1 2] [3 4] uncons-pair
+
+[1 3] [2] [4]
+Expect two non-empty lists on the stack and uncons the first item from each.
joy? [1 2] [3 4] uncons-two
+
+1 3 [2] [4]
+combinator
Unquote (using [i]) the list that is second on the stack.
1 2 [3 4] 5 unquoted
--------------------------
@@ -939,9 +933,7 @@ joy? unstack
True if the form on TOS is void otherwise False.
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
Print warranty information.
Print warranty information.
combinator
A specialization of [loop] that accepts a quoted predicate program P
and runs it [nullary].
[P] [F] while
------------------- P -> false
@@ -949,7 +941,7 @@ and runs it [nullary].
[P] [F] while
--------------------- P -> true
F [P] [F] while
-Print all the words in alphabetical order.
Mathematically this is a form of [id].
combinator
Take a quoted function F and run it with itself as the first item on
+
combinator
Take a quoted function F and run it with itself as the first item on
the stack.
[F] x
-----------
@@ -963,4 +955,4 @@ from each list. The smallest list sets the length of the result list.
[1 2 3] [4 5 6] zip
-------------------------
[[1 4] [2 5] [3 6]]
-