1 # -*- coding: utf-8 -*-
3 # Copyright © 2014, 2015, 2017, 2018 Simon Forman
5 # This file is part of Thun
7 # Thun is free software: you can redistribute it and/or modify
8 # it under the terms of the GNU General Public License as published by
9 # the Free Software Foundation, either version 3 of the License, or
10 # (at your option) any later version.
12 # Thun is distributed in the hope that it will be useful,
13 # but WITHOUT ANY WARRANTY; without even the implied warranty of
14 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 # GNU General Public License for more details.
17 # You should have received a copy of the GNU General Public License
18 # along with Thun. If not see <http://www.gnu.org/licenses/>.
21 This module contains the Joy function infrastructure and a library of
22 functions. Its main export is a Python function initialize() that
23 returns a dictionary of Joy functions suitable for use with the joy()
26 from inspect import getdoc
27 from functools import wraps
30 from .parser import text_to_expression, Symbol
31 from .utils.stack import list_to_stack, iter_stack, pick, pushback
32 from .utils.brutal_hackery import rename_code_object
38 def inscribe(function):
39 '''A decorator to inscribe functions into the default dictionary.'''
40 _dictionary[function.name] = function
45 '''Return a dictionary of Joy functions for use with joy().'''
46 return _dictionary.copy()
55 ('mod', ['%', 'rem', 'remainder', 'modulus']),
58 ('getitem', ['pick', 'at']),
69 ('rolldown', ['roll<']),
70 ('rollup', ['roll>']),
75 def add_aliases(D, A):
77 Given a dict and a iterable of (name, [alias, ...]) pairs, create
78 additional entries in the dict mapping each alias to the named function
79 if it's in the dict. Aliases for functions not in the dict are ignored.
81 for name, aliases in A:
92 third == rest rest first
94 product == 1 swap [*] step
96 swoncat == swap concat
97 flatten == [] swap [concat] step
101 enstacken == stack [clear] dip
102 disenstacken == ? [uncons ?] loop pop
104 dinfrirst == dip infra first
105 nullary == [stack] dinfrirst
106 unary == [stack [pop] dip] dinfrirst
107 binary == [stack [popop] dip] dinfrirst
108 ternary == [stack [popop pop] dip] dinfrirst
112 size == 0 swap [pop ++] step
113 cleave == [i] app2 [popd] dip
114 average == [sum 1.0 *] [size] cleave /
115 gcd == 1 [tuck modulus dup 0 >] loop pop
116 least_fraction == dup [gcd] infra [div] concat map
117 *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
118 *fraction0 == concat [[swap] dip * [*] dip] infra
119 down_to_zero == [0 >] [dup --] while
120 range_to_zero == unit [down_to_zero] infra
121 anamorphism == [pop []] swap [dip swons] genrec
122 range == [0 <=] [1 - dup] anamorphism
123 while == swap [nullary] cons dup dipd concat loop
125 primrec == [i] genrec
126 step_zero == 0 roll> step
130 ##z-down == [] swap uncons swap
131 ##z-up == swons swap shunt
132 ##z-right == [swons] cons dip uncons swap
133 ##z-left == swons [uncons swap] dip swap
136 ##divisor == popop 2 *
138 ##radical == swap dup * rollup * 4 * - sqrt
141 ##q0 == [[divisor] [minusb] [radical]] pam
142 ##q1 == [[root1] [root2]] pam
143 ##quadratic == [q0] ternary i [q1] ternary
147 ##PE1.1 == + dup [+] dip
148 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
149 ##PE1.3 == 14811 swap [PE1.2] times pop
150 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
152 #PE1.2 == [PE1.1] step
153 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
157 def FunctionWrapper(f):
158 '''Set name attribute.'''
160 raise ValueError('Function %s must have doc string.' % f.__name__)
161 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
165 def SimpleFunctionWrapper(f):
167 Wrap functions that take and return just a stack.
171 @rename_code_object(f.__name__)
172 def inner(stack, expression, dictionary):
173 return f(stack), expression, dictionary
177 def BinaryBuiltinWrapper(f):
179 Wrap functions that take two arguments and return a single result.
183 @rename_code_object(f.__name__)
184 def inner(stack, expression, dictionary):
185 (a, (b, stack)) = stack
187 return (result, stack), expression, dictionary
191 def UnaryBuiltinWrapper(f):
193 Wrap functions that take one argument and return a single result.
197 @rename_code_object(f.__name__)
198 def inner(stack, expression, dictionary):
201 return (result, stack), expression, dictionary
205 class DefinitionWrapper(object):
207 Provide implementation of defined functions, and some helper methods.
210 def __init__(self, name, body_text, doc=None):
211 self.name = self.__name__ = name
212 self.body = text_to_expression(body_text)
213 self._body = tuple(iter_stack(self.body))
214 self.__doc__ = doc or body_text
216 def __call__(self, stack, expression, dictionary):
217 expression = list_to_stack(self._body, expression)
218 return stack, expression, dictionary
221 def parse_definition(class_, defi):
223 Given some text describing a Joy function definition parse it and
224 return a DefinitionWrapper.
226 name, proper, body_text = (n.strip() for n in defi.partition('=='))
228 raise ValueError('Definition %r failed' % (defi,))
229 return class_(name, body_text)
232 def add_definitions(class_, defs, dictionary):
234 Scan multi-line string defs for definitions and add them to the
237 for definition in _text_to_defs(defs):
238 class_.add_def(definition, dictionary)
241 def add_def(class_, definition, dictionary):
243 Add the definition to the dictionary.
245 F = class_.parse_definition(definition)
246 dictionary[F.name] = F
249 def _text_to_defs(text):
250 return (line.strip() for line in text.splitlines() if '==' in line)
259 @SimpleFunctionWrapper
261 '''Parse the string on the stack to a Joy expression.'''
263 expression = text_to_expression(text)
264 return expression, stack
268 @SimpleFunctionWrapper
276 ((head, tail), stack) = stack
281 @SimpleFunctionWrapper
289 ((head, tail), stack) = stack
294 @SimpleFunctionWrapper
299 getitem == drop first
301 Expects an integer and a quote on the stack and returns the item at the
302 nth position in the quote counting from 0.
306 -------------------------
310 n, (Q, stack) = stack
311 return pick(Q, n), stack
315 @SimpleFunctionWrapper
322 Expects an integer and a quote on the stack and returns the quote with
323 n items removed off the top.
327 ----------------------
331 n, (Q, stack) = stack
342 @SimpleFunctionWrapper
345 Expects an integer and a quote on the stack and returns the quote with
346 just the top n items in reverse order (because that's easier and you can
347 use reverse if needed.)
351 ----------------------
355 n, (Q, stack) = stack
368 @SimpleFunctionWrapper
371 Use a Boolean value to select one of two items.
375 ----------------------
380 ---------------------
383 Currently Python semantics are used to evaluate the "truthiness" of the
384 Boolean value (so empty string, zero, etc. are counted as false, etc.)
386 (if_, (then, (else_, stack))) = stack
387 return then if if_ else else_, stack
391 @SimpleFunctionWrapper
394 Use a Boolean value to select one of two items from a sequence.
398 ------------------------
403 -----------------------
406 The sequence can contain more than two items but not fewer.
407 Currently Python semantics are used to evaluate the "truthiness" of the
408 Boolean value (so empty string, zero, etc. are counted as false, etc.)
410 (flag, (choices, stack)) = stack
411 (else_, (then, _)) = choices
412 return then if flag else else_, stack
416 @SimpleFunctionWrapper
418 '''Given a list find the maximum.'''
420 return max(iter_stack(tos)), stack
424 @SimpleFunctionWrapper
426 '''Given a list find the minimum.'''
428 return min(iter_stack(tos)), stack
432 @SimpleFunctionWrapper
434 '''Given a quoted sequence of numbers return the sum.
436 sum == 0 swap [+] step
439 return sum(iter_stack(tos)), stack
443 @SimpleFunctionWrapper
446 Expects an item on the stack and a quote under it and removes that item
447 from the the quote. The item is only removed once.
451 ------------------------
455 (tos, (second, stack)) = S
456 l = list(iter_stack(second))
458 return list_to_stack(l), stack
462 @SimpleFunctionWrapper
464 '''Given a list remove duplicate items.'''
466 I = list(iter_stack(tos))
467 list_to_stack(sorted(set(I), key=I.index))
468 return list_to_stack(sorted(set(I), key=I.index)), stack
472 @SimpleFunctionWrapper
474 '''Given a list return it sorted.'''
476 return list_to_stack(sorted(iter_stack(tos))), stack
480 @SimpleFunctionWrapper
483 The cons operator expects a list on top of the stack and the potential
484 member below. The effect is to add the potential member into the
487 (tos, (second, stack)) = S
488 return (second, tos), stack
492 @SimpleFunctionWrapper
495 Inverse of cons, removes an item from the top of the list on the stack
496 and places it under the remaining list.
500 return tos, (item, stack)
504 @SimpleFunctionWrapper
506 '''Clear everything from the stack.
517 @SimpleFunctionWrapper
519 '''Duplicate the top item on the stack.'''
521 return tos, (tos, stack)
525 @SimpleFunctionWrapper
528 Copy the second item down on the stack to the top of the stack.
541 @SimpleFunctionWrapper
544 Copy the item at TOS under the second item of the stack.
552 (tos, (second, stack)) = S
553 return tos, (second, (tos, stack))
557 @SimpleFunctionWrapper
559 '''Swap the top two items on stack.'''
560 (tos, (second, stack)) = S
561 return second, (tos, stack)
565 @SimpleFunctionWrapper
568 old_stack, stack = stack
569 return stack, old_stack
573 @SimpleFunctionWrapper
576 The stack operator pushes onto the stack a list containing all the
577 elements of the stack.
583 @SimpleFunctionWrapper
586 The unstack operator expects a list on top of the stack and makes that
587 the stack discarding the rest of the stack.
593 @SimpleFunctionWrapper
595 '''Pop and discard the top item from the stack.'''
600 @SimpleFunctionWrapper
602 '''Pop and discard the second item from the stack.'''
603 (tos, (_, stack)) = stack
608 @SimpleFunctionWrapper
610 '''Pop and discard the third item from the stack.'''
611 (tos, (second, (_, stack))) = stack
612 return tos, (second, stack)
616 @SimpleFunctionWrapper
618 '''Pop and discard the first and second items from the stack.'''
623 @SimpleFunctionWrapper
625 '''Duplicate the second item on the stack.'''
626 (tos, (second, stack)) = S
627 return tos, (second, (second, stack))
631 @SimpleFunctionWrapper
633 '''Reverse the list on the top of the stack.
636 reverse == [] swap shunt
640 for term in iter_stack(tos):
646 @SimpleFunctionWrapper
648 '''Concatinate the two lists on the top of the stack.'''
649 (tos, (second, stack)) = S
650 for term in reversed(list(iter_stack(second))):
656 @SimpleFunctionWrapper
658 '''Like concat but reverses the top list into the second.
661 shunt == [swons] step
664 (tos, (second, stack)) = stack
667 second = term, second
672 @SimpleFunctionWrapper
675 Replace the two lists on the top of the stack with a list of the pairs
676 from each list. The smallest list sets the length of the result list.
678 (tos, (second, stack)) = S
681 for a, b in zip(iter_stack(tos), iter_stack(second))
683 return list_to_stack(accumulator), stack
687 @SimpleFunctionWrapper
691 return tos + 1, stack
695 @SimpleFunctionWrapper
699 return tos - 1, stack
703 @SimpleFunctionWrapper
714 a, (b, stack) = stack
720 return int(math.floor(n))
722 floor.__doc__ = math.floor.__doc__
726 @SimpleFunctionWrapper
729 divmod(x, y) -> (quotient, remainder)
731 Return the tuple (x//y, x%y). Invariant: div*y + mod == x.
740 Return the square root of the number a.
741 Negative numbers return complex roots.
746 assert a < 0, repr(a)
747 r = math.sqrt(-a) * 1j
752 @SimpleFunctionWrapper
762 (a, (b, (c, stack))) = S
763 return b, (c, (a, stack))
767 @SimpleFunctionWrapper
777 (a, (b, (c, stack))) = S
778 return c, (a, (b, stack))
783 # if isinstance(text, str):
784 # return run(text, stack)
789 @SimpleFunctionWrapper
791 '''The identity function.'''
796 @SimpleFunctionWrapper
798 '''True if the form on TOS is void otherwise False.'''
800 return _void(form), stack
804 return any(not _void(i) for i in iter_stack(form))
815 def words(stack, expression, dictionary):
816 '''Print all the words in alphabetical order.'''
817 print(' '.join(sorted(dictionary)))
818 return stack, expression, dictionary
823 def sharing(stack, expression, dictionary):
824 '''Print redistribution information.'''
825 print("You may convey verbatim copies of the Program's source code as"
826 ' you receive it, in any medium, provided that you conspicuously'
827 ' and appropriately publish on each copy an appropriate copyright'
828 ' notice; keep intact all notices stating that this License and'
829 ' any non-permissive terms added in accord with section 7 apply'
830 ' to the code; keep intact all notices of the absence of any'
831 ' warranty; and give all recipients a copy of this License along'
833 ' You should have received a copy of the GNU General Public License'
834 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
835 return stack, expression, dictionary
840 def warranty(stack, expression, dictionary):
841 '''Print warranty information.'''
842 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
843 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
844 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
845 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
846 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
847 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
848 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
849 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
850 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
851 return stack, expression, dictionary
854 # def simple_manual(stack):
856 # Print words and help for each word.
858 # for name, f in sorted(FUNCTIONS.items()):
860 # boxline = '+%s+' % ('-' * (len(name) + 2))
863 # '| %s |' % (name,),
865 # d if d else ' ...',
875 def help_(S, expression, dictionary):
876 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
877 ((symbol, _), stack) = S
878 word = dictionary[symbol]
880 return stack, expression, dictionary
888 # Several combinators depend on other words in their definitions,
889 # we use symbols to prevent hard-coding these, so in theory, you
890 # could change the word in the dictionary to use different semantics.
891 S_choice = Symbol('choice')
892 S_first = Symbol('first')
893 S_getitem = Symbol('getitem')
894 S_genrec = Symbol('genrec')
895 S_loop = Symbol('loop')
897 S_ifte = Symbol('ifte')
898 S_infra = Symbol('infra')
899 S_step = Symbol('step')
900 S_times = Symbol('times')
901 S_swaack = Symbol('swaack')
902 S_truthy = Symbol('truthy')
907 def i(stack, expression, dictionary):
909 The i combinator expects a quoted program on the stack and unpacks it
910 onto the pending expression for evaluation.
919 return stack, pushback(quote, expression), dictionary
924 def x(stack, expression, dictionary):
930 ... [Q] x = ... [Q] dup i
931 ... [Q] x = ... [Q] [Q] i
932 ... [Q] x = ... [Q] Q
936 return stack, pushback(quote, expression), dictionary
941 def b(stack, expression, dictionary):
947 ... [P] [Q] b == ... [P] i [Q] i
948 ... [P] [Q] b == ... P Q
951 q, (p, (stack)) = stack
952 return stack, pushback(p, pushback(q, expression)), dictionary
957 def dupdip(stack, expression, dictionary):
961 [F] dupdip == dup [F] dip
971 return stack, pushback(F, (a, expression)), dictionary
976 def infra(stack, expression, dictionary):
978 Accept a quoted program and a list on the stack and run the program
979 with the list as its stack.
982 ... [a b c] [Q] . infra
983 -----------------------------
984 c b a . Q [...] swaack
987 (quote, (aggregate, stack)) = stack
988 return aggregate, pushback(quote, (stack, (S_swaack, expression))), dictionary
993 def genrec(stack, expression, dictionary):
995 General Recursion Combinator.
998 [if] [then] [rec1] [rec2] genrec
999 ---------------------------------------------------------------------
1000 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
1002 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
1003 "The genrec combinator takes four program parameters in addition to
1004 whatever data parameters it needs. Fourth from the top is an if-part,
1005 followed by a then-part. If the if-part yields true, then the then-part
1006 is executed and the combinator terminates. The other two parameters are
1007 the rec1-part and the rec2-part. If the if-part yields false, the
1008 rec1-part is executed. Following that the four program parameters and
1009 the combinator are again pushed onto the stack bundled up in a quoted
1010 form. Then the rec2-part is executed, where it will find the bundled
1011 form. Typically it will then execute the bundled form, either with i or
1012 with app2, or some other combinator."
1014 The way to design one of these is to fix your base case [then] and the
1015 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
1016 a quotation of the whole function.
1018 For example, given a (general recursive) function 'F':
1021 F == [I] [T] [R1] [R2] genrec
1023 If the [I] if-part fails you must derive R1 and R2 from:
1028 Just set the stack arguments in front, and figure out what R1 and R2
1029 have to do to apply the quoted [F] in the proper way. In effect, the
1030 genrec combinator turns into an ifte combinator with a quoted copy of
1031 the original definition in the else-part:
1034 F == [I] [T] [R1] [R2] genrec
1035 == [I] [T] [R1 [F] R2] ifte
1037 Primitive recursive functions are those where R2 == i.
1040 P == [I] [T] [R] primrec
1041 == [I] [T] [R [P] i] ifte
1042 == [I] [T] [R P] ifte
1045 (rec2, (rec1, stack)) = stack
1046 (then, (if_, _)) = stack
1047 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
1048 else_ = pushback(rec1, (F, rec2))
1049 return (else_, stack), (S_ifte, expression), dictionary
1054 def map_(S, expression, dictionary):
1056 Run the quoted program on TOS on the items in the list under it, push a
1057 new list with the results (in place of the program and original list.
1059 # (quote, (aggregate, stack)) = S
1060 # results = list_to_stack([
1061 # joy((term, stack), quote, dictionary)[0][0]
1062 # for term in iter_stack(aggregate)
1064 # return (results, stack), expression, dictionary
1065 (quote, (aggregate, stack)) = S
1067 return (aggregate, stack), expression, dictionary
1069 for term in iter_stack(aggregate):
1071 batch = (s, (quote, (S_infra, (S_first, batch))))
1072 stack = (batch, ((), stack))
1073 return stack, (S_infra, expression), dictionary
1076 #def cleave(S, expression, dictionary):
1078 # The cleave combinator expects two quotations, and below that an item X.
1079 # It first executes [P], with X on top, and saves the top result element.
1080 # Then it executes [Q], again with X, and saves the top result.
1081 # Finally it restores the stack to what it was below X and pushes the two
1082 # results P(X) and Q(X).
1084 # (Q, (P, (x, stack))) = S
1085 # p = joy((x, stack), P, dictionary)[0][0]
1086 # q = joy((x, stack), Q, dictionary)[0][0]
1087 # return (q, (p, stack)), expression, dictionary
1092 def branch(stack, expression, dictionary):
1094 Use a Boolean value to select one of two quoted programs to run.
1098 branch == roll< choice i
1102 False [F] [T] branch
1103 --------------------------
1107 -------------------------
1111 (then, (else_, (flag, stack))) = stack
1112 return stack, pushback(then if flag else else_, expression), dictionary
1117 def ifte(stack, expression, dictionary):
1119 If-Then-Else Combinator
1122 ... [if] [then] [else] ifte
1123 ---------------------------------------------------
1124 ... [[else] [then]] [...] [if] infra select i
1129 ... [if] [then] [else] ifte
1130 -------------------------------------------------------
1131 ... [else] [then] [...] [if] infra first choice i
1134 Has the effect of grabbing a copy of the stack on which to run the
1135 if-part using infra.
1137 (else_, (then, (if_, stack))) = stack
1138 expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1139 stack = (if_, (stack, (then, (else_, stack))))
1140 return stack, expression, dictionary
1145 def dip(stack, expression, dictionary):
1147 The dip combinator expects a quoted program on the stack and below it
1148 some item, it hoists the item into the expression and runs the program
1149 on the rest of the stack.
1157 (quote, (x, stack)) = stack
1158 expression = (x, expression)
1159 return stack, pushback(quote, expression), dictionary
1164 def dipd(S, expression, dictionary):
1166 Like dip but expects two items.
1170 ---------------------
1174 (quote, (x, (y, stack))) = S
1175 expression = (y, (x, expression))
1176 return stack, pushback(quote, expression), dictionary
1181 def dipdd(S, expression, dictionary):
1183 Like dip but expects three items.
1187 -----------------------
1191 (quote, (x, (y, (z, stack)))) = S
1192 expression = (z, (y, (x, expression)))
1193 return stack, pushback(quote, expression), dictionary
1198 def app1(S, expression, dictionary):
1200 Given a quoted program on TOS and anything as the second stack item run
1201 the program and replace the two args with the first result of the
1206 -----------------------------------
1207 ... [x ...] [Q] . infra first
1209 (quote, (x, stack)) = S
1210 stack = (quote, ((x, stack), stack))
1211 expression = (S_infra, (S_first, expression))
1212 return stack, expression, dictionary
1217 def app2(S, expression, dictionary):
1218 '''Like app1 with two items.
1222 -----------------------------------
1223 ... [y ...] [Q] . infra first
1224 [x ...] [Q] infra first
1227 (quote, (x, (y, stack))) = S
1228 expression = (S_infra, (S_first,
1229 ((x, stack), (quote, (S_infra, (S_first,
1231 stack = (quote, ((y, stack), stack))
1232 return stack, expression, dictionary
1237 def app3(S, expression, dictionary):
1238 '''Like app1 with three items.
1241 ... z y x [Q] . app3
1242 -----------------------------------
1243 ... [z ...] [Q] . infra first
1244 [y ...] [Q] infra first
1245 [x ...] [Q] infra first
1248 (quote, (x, (y, (z, stack)))) = S
1249 expression = (S_infra, (S_first,
1250 ((y, stack), (quote, (S_infra, (S_first,
1251 ((x, stack), (quote, (S_infra, (S_first,
1252 expression))))))))))
1253 stack = (quote, ((z, stack), stack))
1254 return stack, expression, dictionary
1259 def step(S, expression, dictionary):
1261 Run a quoted program on each item in a sequence.
1265 -----------------------
1270 ------------------------
1274 ... [a b c] [Q] . step
1275 ----------------------------------------
1276 ... a . Q [b c] [Q] step
1278 The step combinator executes the quotation on each member of the list
1279 on top of the stack.
1281 (quote, (aggregate, stack)) = S
1283 return stack, expression, dictionary
1284 head, tail = aggregate
1285 stack = quote, (head, stack)
1287 expression = tail, (quote, (S_step, expression))
1288 expression = S_i, expression
1289 return stack, expression, dictionary
1294 def times(stack, expression, dictionary):
1296 times == [-- dip] cons [swap] infra [0 >] swap while pop
1300 --------------------- w/ n <= 0
1305 ---------------------------------
1310 --------------------------------- w/ n > 1
1311 ... . Q (n - 1) [Q] times
1314 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1315 (quote, (n, stack)) = stack
1317 return stack, expression, dictionary
1320 expression = n, (quote, (S_times, expression))
1321 expression = pushback(quote, expression)
1322 return stack, expression, dictionary
1325 # The current definition above works like this:
1328 # --------------------------------------
1329 # [P] nullary [Q [P] nullary] loop
1331 # while == [pop i not] [popop] [dudipd] primrec
1333 #def while_(S, expression, dictionary):
1334 # '''[if] [body] while'''
1335 # (body, (if_, stack)) = S
1336 # while joy(stack, if_, dictionary)[0][0]:
1337 # stack = joy(stack, body, dictionary)[0]
1338 # return stack, expression, dictionary
1343 def loop(stack, expression, dictionary):
1345 Basic loop combinator.
1349 -----------------------
1353 ------------------------
1357 quote, (flag, stack) = stack
1359 expression = pushback(quote, (quote, (S_loop, expression)))
1360 return stack, expression, dictionary
1363 #def nullary(S, expression, dictionary):
1365 # Run the program on TOS and return its first result without consuming
1366 # any of the stack (except the program on TOS.)
1368 # (quote, stack) = S
1369 # result = joy(stack, quote, dictionary)
1370 # return (result[0][0], stack), expression, dictionary
1373 #def unary(S, expression, dictionary):
1374 # (quote, stack) = S
1375 # _, return_stack = stack
1376 # result = joy(stack, quote, dictionary)[0]
1377 # return (result[0], return_stack), expression, dictionary
1380 #def binary(S, expression, dictionary):
1381 # (quote, stack) = S
1382 # _, (_, return_stack) = stack
1383 # result = joy(stack, quote, dictionary)[0]
1384 # return (result[0], return_stack), expression, dictionary
1387 #def ternary(S, expression, dictionary):
1388 # (quote, stack) = S
1389 # _, (_, (_, return_stack)) = stack
1390 # result = joy(stack, quote, dictionary)[0]
1391 # return (result[0], return_stack), expression, dictionary
1394 # FunctionWrapper(binary),
1395 # FunctionWrapper(cleave),
1396 # FunctionWrapper(nullary),
1397 # FunctionWrapper(ternary),
1398 # FunctionWrapper(unary),
1399 # FunctionWrapper(while_),
1403 BinaryBuiltinWrapper(operator.add),
1404 BinaryBuiltinWrapper(operator.and_),
1405 BinaryBuiltinWrapper(operator.div),
1406 BinaryBuiltinWrapper(operator.eq),
1407 BinaryBuiltinWrapper(operator.floordiv),
1408 BinaryBuiltinWrapper(operator.ge),
1409 BinaryBuiltinWrapper(operator.gt),
1410 BinaryBuiltinWrapper(operator.le),
1411 BinaryBuiltinWrapper(operator.lshift),
1412 BinaryBuiltinWrapper(operator.lt),
1413 BinaryBuiltinWrapper(operator.mod),
1414 BinaryBuiltinWrapper(operator.mul),
1415 BinaryBuiltinWrapper(operator.ne),
1416 BinaryBuiltinWrapper(operator.or_),
1417 BinaryBuiltinWrapper(operator.pow),
1418 BinaryBuiltinWrapper(operator.rshift),
1419 BinaryBuiltinWrapper(operator.sub),
1420 BinaryBuiltinWrapper(operator.truediv),
1421 BinaryBuiltinWrapper(operator.xor),
1423 UnaryBuiltinWrapper(abs),
1424 UnaryBuiltinWrapper(bool),
1425 UnaryBuiltinWrapper(floor),
1426 UnaryBuiltinWrapper(operator.neg),
1427 UnaryBuiltinWrapper(operator.not_),
1428 UnaryBuiltinWrapper(sqrt),
1431 del F # Otherwise Sphinx autodoc will pick it up.
1434 add_aliases(_dictionary, ALIASES)
1437 DefinitionWrapper.add_definitions(definitions, _dictionary)