1 # -*- coding: utf-8 -*-
3 # Copyright © 2014-2020 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, getmembers, isfunction
27 from functools import wraps
28 from itertools import count
31 from .parser import text_to_expression, Symbol
32 from .utils import generated_library as genlib
33 from .utils.stack import (
52 # This is the main dict we're building.
56 def inscribe(function):
57 '''A decorator to inscribe functions into the default dictionary.'''
58 _dictionary[function.name] = function
63 '''Return a dictionary of Joy functions for use with joy().'''
64 return _dictionary.copy()
72 ('floordiv', ['/floor', '//']),
73 ('truediv', ['/', 'div']),
74 ('mod', ['%', 'rem', 'remainder', 'modulus']),
77 ('getitem', ['pick', 'at']),
88 ('rolldown', ['roll<']),
89 ('rollup', ['roll>']),
95 def add_aliases(D, A):
97 Given a dict and a iterable of (name, [alias, ...]) pairs, create
98 additional entries in the dict mapping each alias to the named function
99 if it's in the dict. Aliases for functions not in the dict are ignored.
101 for name, aliases in A:
106 for alias in aliases:
112 *fraction [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
113 *fraction0 concat [[swap] dip * [*] dip] infra
114 anamorphism [pop []] swap [dip swons] genrec
115 average [sum 1.0 *] [size] cleave /
116 binary nullary [popop] dip
117 cleave fork [popd] dip
118 codireco cons dip rest cons
119 dinfrirst dip infra first
120 unstack ? [uncons ?] loop pop
121 down_to_zero [0 >] [dup --] while
123 enstacken stack [clear] dip
124 flatten [] swap [concat] step
126 gcd 1 [tuck modulus dup 0 >] loop pop
127 ifte [nullary not] dipd branch
129 least_fraction dup [gcd] infra [div] concat map
130 make_generator [codireco] ccons
131 nullary [stack] dinfrirst
135 product 1 swap [*] step
137 range [0 <=] [1 - dup] anamorphism
138 range_to_zero unit [down_to_zero] infra
140 size 0 swap [pop ++] step
142 step_zero 0 roll> step
145 ternary unary [popop] dip
148 while swap [nullary] cons dup dipd concat loop
152 # ifte == [nullary] dipd swap branch
153 # genrec == [[genrec] cons cons cons cons] nullary swons concat ifte
155 # Another definition for while. FWIW
156 # while == over [[i] dip nullary] ccons [nullary] dip loop
160 ##second == rest first
161 ##third == rest rest first
165 ##z-down == [] swap uncons swap
166 ##z-up == swons swap shunt
167 ##z-right == [swons] cons dip uncons swap
168 ##z-left == swons [uncons swap] dip swap
171 ##divisor == popop 2 *
173 ##radical == swap dup * rollup * 4 * - sqrt
176 ##q0 == [[divisor] [minusb] [radical]] pam
177 ##q1 == [[root1] [root2]] pam
178 ##quadratic == [q0] ternary i [q1] ternary
182 ##PE1.1 == + dup [+] dip
183 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
184 ##PE1.3 == 14811 swap [PE1.2] times pop
185 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
187 #PE1.2 == [PE1.1] step
188 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
192 def FunctionWrapper(f):
193 '''Set name attribute.'''
195 raise ValueError('Function %s must have doc string.' % f.__name__)
196 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
200 def SimpleFunctionWrapper(f):
202 Wrap functions that take and return just a stack.
206 def inner(stack, expression, dictionary):
207 return f(stack), expression, dictionary
211 def BinaryBuiltinWrapper(f):
213 Wrap functions that take two arguments and return a single result.
217 def inner(stack, expression, dictionary):
218 (a, (b, stack)) = stack
220 return (result, stack), expression, dictionary
224 def UnaryBuiltinWrapper(f):
226 Wrap functions that take one argument and return a single result.
230 def inner(stack, expression, dictionary):
233 return (result, stack), expression, dictionary
237 class DefinitionWrapper(object):
239 Provide implementation of defined functions, and some helper methods.
242 def __init__(self, name, body_text, doc=None):
243 self.name = self.__name__ = name
244 self.body = text_to_expression(body_text)
245 self._body = tuple(iter_stack(self.body))
246 self.__doc__ = doc or body_text
247 self._compiled = None
249 def __call__(self, stack, expression, dictionary):
251 return self._compiled(stack, expression, dictionary) # pylint: disable=E1102
252 expression = list_to_stack(self._body, expression)
253 return stack, expression, dictionary
256 def parse_definition(class_, defi):
258 Given some text describing a Joy function definition parse it and
259 return a DefinitionWrapper.
261 return class_(*(n.strip() for n in defi.split(None, 1)))
264 def add_definitions(class_, defs, dictionary):
266 Scan multi-line string defs for definitions and add them to the
269 for definition in _text_to_defs(defs):
270 class_.add_def(definition, dictionary)
273 def add_def(class_, definition, dictionary, fail_fails=False):
275 Add the definition to the dictionary.
277 F = class_.parse_definition(definition)
278 dictionary[F.name] = F
281 def load_definitions(class_, filename, dictionary):
282 with open(filename) as f:
283 lines = [line for line in f if '==' in line]
285 class_.add_def(line, dictionary)
288 def _text_to_defs(text):
291 for line in text.splitlines()
292 if line and not line.startswith('#')
303 def inscribe_(stack, expression, dictionary):
305 Create a new Joy function definition in the Joy dictionary. A
306 definition is given as a string with a name followed by a double
307 equal sign then one or more Joy functions, the body. for example:
311 If you want the definition to persist over restarts, enter it into
312 the definitions.txt resource.
314 definition, stack = stack
315 DefinitionWrapper.add_def(definition, dictionary, fail_fails=True)
316 return stack, expression, dictionary
320 @SimpleFunctionWrapper
322 '''Parse the string on the stack to a Joy expression.'''
324 expression = text_to_expression(text)
325 return expression, stack
329 # @SimpleFunctionWrapper
331 # '''Attempt to infer the stack effect of a Joy expression.'''
333 # effects = infer_expression(E)
334 # e = list_to_stack([(fi, (fo, ())) for fi, fo in effects])
339 @SimpleFunctionWrapper
344 getitem == drop first
346 Expects an integer and a quote on the stack and returns the item at the
347 nth position in the quote counting from 0.
351 -------------------------
355 n, (Q, stack) = stack
356 return pick(Q, n), stack
360 @SimpleFunctionWrapper
367 Expects an integer and a quote on the stack and returns the quote with
368 n items removed off the top.
372 ----------------------
376 n, (Q, stack) = stack
387 @SimpleFunctionWrapper
390 Expects an integer and a quote on the stack and returns the quote with
391 just the top n items in reverse order (because that's easier and you can
392 use reverse if needed.)
396 ----------------------
400 n, (Q, stack) = stack
413 @SimpleFunctionWrapper
416 Use a Boolean value to select one of two items.
420 ----------------------
425 ---------------------
428 Currently Python semantics are used to evaluate the "truthiness" of the
429 Boolean value (so empty string, zero, etc. are counted as false, etc.)
431 (if_, (then, (else_, stack))) = stack
432 return then if if_ else else_, stack
436 @SimpleFunctionWrapper
439 Use a Boolean value to select one of two items from a sequence.
443 ------------------------
448 -----------------------
451 The sequence can contain more than two items but not fewer.
452 Currently Python semantics are used to evaluate the "truthiness" of the
453 Boolean value (so empty string, zero, etc. are counted as false, etc.)
455 (flag, (choices, stack)) = stack
456 (else_, (then, _)) = choices
457 return then if flag else else_, stack
461 @SimpleFunctionWrapper
463 '''Given a list find the maximum.'''
465 return max(iter_stack(tos)), stack
469 @SimpleFunctionWrapper
471 '''Given a list find the minimum.'''
473 return min(iter_stack(tos)), stack
477 @SimpleFunctionWrapper
480 Given a quoted sequence of numbers return the sum.
483 sum == 0 swap [+] step
487 return sum(iter_stack(tos)), stack
491 @SimpleFunctionWrapper
494 Expects an item on the stack and a quote under it and removes that item
495 from the the quote. The item is only removed once.
499 ------------------------
503 (tos, (second, stack)) = S
504 l = list(iter_stack(second))
506 return list_to_stack(l), stack
510 @SimpleFunctionWrapper
512 '''Given a list remove duplicate items.'''
514 I = list(iter_stack(tos))
515 return list_to_stack(sorted(set(I), key=I.index)), stack
519 @SimpleFunctionWrapper
521 '''Given a list return it sorted.'''
523 return list_to_stack(sorted(iter_stack(tos))), stack
527 @SimpleFunctionWrapper
529 '''Clear everything from the stack.
532 clear == stack [pop stack] loop
542 @SimpleFunctionWrapper
543 def disenstacken(stack):
545 The disenstacken operator expects a list on top of the stack and makes that
546 the stack discarding the rest of the stack.
552 @SimpleFunctionWrapper
555 Reverse the list on the top of the stack.
558 reverse == [] swap shunt
562 for term in iter_stack(tos):
568 @SimpleFunctionWrapper
571 Concatinate the two lists on the top of the stack.
574 [a b c] [d e f] concat
575 ----------------------------
579 (tos, (second, stack)) = S
580 return concat(second, tos), stack
584 @SimpleFunctionWrapper
587 Like concat but reverses the top list into the second.
590 shunt == [swons] step == reverse swap concat
592 [a b c] [d e f] shunt
593 ---------------------------
597 (tos, (second, stack)) = stack
600 second = term, second
605 @SimpleFunctionWrapper
608 Replace the two lists on the top of the stack with a list of the pairs
609 from each list. The smallest list sets the length of the result list.
611 (tos, (second, stack)) = S
614 for a, b in zip(iter_stack(tos), iter_stack(second))
616 return list_to_stack(accumulator), stack
620 @SimpleFunctionWrapper
624 return tos + 1, stack
628 @SimpleFunctionWrapper
632 return tos - 1, stack
636 @SimpleFunctionWrapper
647 a, (b, stack) = stack
653 return int(math.floor(n))
655 floor.__doc__ = math.floor.__doc__
659 @SimpleFunctionWrapper
662 divmod(x, y) -> (quotient, remainder)
664 Return the tuple (x//y, x%y). Invariant: div*y + mod == x.
673 Return the square root of the number a.
674 Negative numbers return complex roots.
679 assert a < 0, repr(a)
680 r = math.sqrt(-a) * 1j
686 # if isinstance(text, str):
687 # return run(text, stack)
692 @SimpleFunctionWrapper
694 '''The identity function.'''
699 @SimpleFunctionWrapper
701 '''True if the form on TOS is void otherwise False.'''
703 return _void(form), stack
707 return any(not _void(i) for i in iter_stack(form))
718 def words(stack, expression, dictionary):
719 '''Print all the words in alphabetical order.'''
720 print(' '.join(sorted(dictionary)))
721 return stack, expression, dictionary
726 def sharing(stack, expression, dictionary):
727 '''Print redistribution information.'''
728 print("You may convey verbatim copies of the Program's source code as"
729 ' you receive it, in any medium, provided that you conspicuously'
730 ' and appropriately publish on each copy an appropriate copyright'
731 ' notice; keep intact all notices stating that this License and'
732 ' any non-permissive terms added in accord with section 7 apply'
733 ' to the code; keep intact all notices of the absence of any'
734 ' warranty; and give all recipients a copy of this License along'
736 ' You should have received a copy of the GNU General Public License'
737 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
738 return stack, expression, dictionary
743 def warranty(stack, expression, dictionary):
744 '''Print warranty information.'''
745 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
746 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
747 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
748 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
749 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
750 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
751 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
752 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
753 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
754 return stack, expression, dictionary
757 # def simple_manual(stack):
759 # Print words and help for each word.
761 # for name, f in sorted(FUNCTIONS.items()):
763 # boxline = '+%s+' % ('-' * (len(name) + 2))
766 # '| %s |' % (name,),
768 # d if d else ' ...',
778 def help_(S, expression, dictionary):
779 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
780 ((symbol, _), stack) = S
781 word = dictionary[symbol]
782 print(HELP_TEMPLATE % (symbol, getdoc(word), symbol))
783 return stack, expression, dictionary
791 # Several combinators depend on other words in their definitions,
792 # we use symbols to prevent hard-coding these, so in theory, you
793 # could change the word in the dictionary to use different semantics.
794 S_choice = Symbol('choice')
795 S_first = Symbol('first')
796 S_genrec = Symbol('genrec')
797 S_getitem = Symbol('getitem')
799 S_ifte = Symbol('ifte')
800 S_infra = Symbol('infra')
801 S_loop = Symbol('loop')
802 S_pop = Symbol('pop')
803 S_primrec = Symbol('primrec')
804 S_step = Symbol('step')
805 S_swaack = Symbol('swaack')
806 S_times = Symbol('times')
811 def i(stack, expression, dictionary):
813 The i combinator expects a quoted program on the stack and unpacks it
814 onto the pending expression for evaluation.
823 return stack, concat(quote, expression), dictionary
828 def x(stack, expression, dictionary):
834 ... [Q] x = ... [Q] dup i
835 ... [Q] x = ... [Q] [Q] i
836 ... [Q] x = ... [Q] Q
840 return stack, concat(quote, expression), dictionary
845 def b(stack, expression, dictionary):
851 ... [P] [Q] b == ... [P] i [Q] i
852 ... [P] [Q] b == ... P Q
855 q, (p, (stack)) = stack
856 return stack, concat(p, concat(q, expression)), dictionary
861 def dupdip(stack, expression, dictionary):
865 [F] dupdip == dup [F] dip
875 return stack, concat(F, (a, expression)), dictionary
880 def infra(stack, expression, dictionary):
882 Accept a quoted program and a list on the stack and run the program
883 with the list as its stack. Does not affect the rest of the stack.
886 ... [a b c] [Q] . infra
887 -----------------------------
888 c b a . Q [...] swaack
891 (quote, (aggregate, stack)) = stack
892 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
897 def genrec(stack, expression, dictionary):
899 General Recursion Combinator.
902 [if] [then] [rec1] [rec2] genrec
903 ---------------------------------------------------------------------
904 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
906 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
907 "The genrec combinator takes four program parameters in addition to
908 whatever data parameters it needs. Fourth from the top is an if-part,
909 followed by a then-part. If the if-part yields true, then the then-part
910 is executed and the combinator terminates. The other two parameters are
911 the rec1-part and the rec2-part. If the if-part yields false, the
912 rec1-part is executed. Following that the four program parameters and
913 the combinator are again pushed onto the stack bundled up in a quoted
914 form. Then the rec2-part is executed, where it will find the bundled
915 form. Typically it will then execute the bundled form, either with i or
916 with app2, or some other combinator."
918 The way to design one of these is to fix your base case [then] and the
919 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
920 a quotation of the whole function.
922 For example, given a (general recursive) function 'F':
925 F == [I] [T] [R1] [R2] genrec
927 If the [I] if-part fails you must derive R1 and R2 from:
932 Just set the stack arguments in front, and figure out what R1 and R2
933 have to do to apply the quoted [F] in the proper way. In effect, the
934 genrec combinator turns into an ifte combinator with a quoted copy of
935 the original definition in the else-part:
938 F == [I] [T] [R1] [R2] genrec
939 == [I] [T] [R1 [F] R2] ifte
941 Primitive recursive functions are those where R2 == i.
944 P == [I] [T] [R] tailrec
945 == [I] [T] [R [P] i] ifte
946 == [I] [T] [R P] ifte
949 (rec2, (rec1, stack)) = stack
950 (then, (if_, _)) = stack
951 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
952 else_ = concat(rec1, (F, rec2))
953 return (else_, stack), (S_ifte, expression), dictionary
958 def map_(S, expression, dictionary):
960 Run the quoted program on TOS on the items in the list under it, push a
961 new list with the results in place of the program and original list.
963 # (quote, (aggregate, stack)) = S
964 # results = list_to_stack([
965 # joy((term, stack), quote, dictionary)[0][0]
966 # for term in iter_stack(aggregate)
968 # return (results, stack), expression, dictionary
969 (quote, (aggregate, stack)) = S
971 return (aggregate, stack), expression, dictionary
973 for term in iter_stack(aggregate):
975 batch = (s, (quote, (S_infra, (S_first, batch))))
976 stack = (batch, ((), stack))
977 return stack, (S_infra, expression), dictionary
982 def primrec(stack, expression, dictionary):
984 From the "Overview of the language JOY":
986 > The primrec combinator expects two quoted programs in addition to a
987 data parameter. For an integer data parameter it works like this: If
988 the data parameter is zero, then the first quotation has to produce
989 the value to be returned. If the data parameter is positive then the
990 second has to combine the data parameter with the result of applying
991 the function to its predecessor.::
995 > Then primrec tests whether the top element on the stack (initially
996 the 5) is equal to zero. If it is, it pops it off and executes one of
997 the quotations, the [1] which leaves 1 on the stack as the result.
998 Otherwise it pushes a decremented copy of the top element and
999 recurses. On the way back from the recursion it uses the other
1000 quotation, [*], to multiply what is now a factorial on top of the
1001 stack by the second element on the stack.::
1003 n [Base] [Recur] primrec
1005 0 [Base] [Recur] primrec
1006 ------------------------------
1009 n [Base] [Recur] primrec
1010 ------------------------------------------ n > 0
1011 n (n-1) [Base] [Recur] primrec Recur
1014 recur, (base, (n, stack)) = stack
1016 expression = concat(base, expression)
1018 expression = S_primrec, concat(recur, expression)
1019 stack = recur, (base, (n - 1, (n, stack)))
1020 return stack, expression, dictionary
1023 #def cleave(S, expression, dictionary):
1025 # The cleave combinator expects two quotations, and below that an item X.
1026 # It first executes [P], with X on top, and saves the top result element.
1027 # Then it executes [Q], again with X, and saves the top result.
1028 # Finally it restores the stack to what it was below X and pushes the two
1029 # results P(X) and Q(X).
1031 # (Q, (P, (x, stack))) = S
1032 # p = joy((x, stack), P, dictionary)[0][0]
1033 # q = joy((x, stack), Q, dictionary)[0][0]
1034 # return (q, (p, stack)), expression, dictionary
1039 def branch(stack, expression, dictionary):
1041 Use a Boolean value to select one of two quoted programs to run.
1045 branch == roll< choice i
1049 False [F] [T] branch
1050 --------------------------
1054 -------------------------
1058 (then, (else_, (flag, stack))) = stack
1059 return stack, concat(then if flag else else_, expression), dictionary
1064 ##def ifte(stack, expression, dictionary):
1066 ## If-Then-Else Combinator
1069 ## ... [if] [then] [else] ifte
1070 ## ---------------------------------------------------
1071 ## ... [[else] [then]] [...] [if] infra select i
1076 ## ... [if] [then] [else] ifte
1077 ## -------------------------------------------------------
1078 ## ... [else] [then] [...] [if] infra first choice i
1081 ## Has the effect of grabbing a copy of the stack on which to run the
1082 ## if-part using infra.
1084 ## (else_, (then, (if_, stack))) = stack
1085 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1086 ## stack = (if_, (stack, (then, (else_, stack))))
1087 ## return stack, expression, dictionary
1092 def cond(stack, expression, dictionary):
1094 This combinator works like a case statement. It expects a single quote
1095 on the stack that must contain zero or more condition quotes and a
1096 default quote. Each condition clause should contain a quoted predicate
1097 followed by the function expression to run if that predicate returns
1098 true. If no predicates return true the default function runs.
1100 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1102 [[[B0] T0] [[B1] T1] [D]] cond
1103 -----------------------------------------
1104 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1107 conditions, stack = stack
1109 expression = _cond(conditions, expression)
1111 # Attempt to preload the args to first ifte.
1112 (P, (T, (E, expression))) = expression
1114 # If, for any reason, the argument to cond should happen to contain
1115 # only the default clause then this optimization will fail.
1118 stack = (E, (T, (P, stack)))
1119 return stack, expression, dictionary
1122 def _cond(conditions, expression):
1123 (clause, rest) = conditions
1124 if not rest: # clause is [D]
1127 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1132 def dip(stack, expression, dictionary):
1134 The dip combinator expects a quoted program on the stack and below it
1135 some item, it hoists the item into the expression and runs the program
1136 on the rest of the stack.
1144 (quote, (x, stack)) = stack
1145 expression = (x, expression)
1146 return stack, concat(quote, expression), dictionary
1151 def dipd(S, expression, dictionary):
1153 Like dip but expects two items.
1157 ---------------------
1161 (quote, (x, (y, stack))) = S
1162 expression = (y, (x, expression))
1163 return stack, concat(quote, expression), dictionary
1168 def dipdd(S, expression, dictionary):
1170 Like dip but expects three items.
1174 -----------------------
1178 (quote, (x, (y, (z, stack)))) = S
1179 expression = (z, (y, (x, expression)))
1180 return stack, concat(quote, expression), dictionary
1185 def app1(S, expression, dictionary):
1187 Given a quoted program on TOS and anything as the second stack item run
1188 the program and replace the two args with the first result of the
1193 -----------------------------------
1194 ... [x ...] [Q] . infra first
1197 (quote, (x, stack)) = S
1198 stack = (quote, ((x, stack), stack))
1199 expression = (S_infra, (S_first, expression))
1200 return stack, expression, dictionary
1205 def app2(S, expression, dictionary):
1206 '''Like app1 with two items.
1210 -----------------------------------
1211 ... [y ...] [Q] . infra first
1212 [x ...] [Q] infra first
1215 (quote, (x, (y, stack))) = S
1216 expression = (S_infra, (S_first,
1217 ((x, stack), (quote, (S_infra, (S_first,
1219 stack = (quote, ((y, stack), stack))
1220 return stack, expression, dictionary
1225 def app3(S, expression, dictionary):
1226 '''Like app1 with three items.
1229 ... z y x [Q] . app3
1230 -----------------------------------
1231 ... [z ...] [Q] . infra first
1232 [y ...] [Q] infra first
1233 [x ...] [Q] infra first
1236 (quote, (x, (y, (z, stack)))) = S
1237 expression = (S_infra, (S_first,
1238 ((y, stack), (quote, (S_infra, (S_first,
1239 ((x, stack), (quote, (S_infra, (S_first,
1240 expression))))))))))
1241 stack = (quote, ((z, stack), stack))
1242 return stack, expression, dictionary
1247 def step(S, expression, dictionary):
1249 Run a quoted program on each item in a sequence.
1253 -----------------------
1258 ------------------------
1262 ... [a b c] [Q] . step
1263 ----------------------------------------
1264 ... a . Q [b c] [Q] step
1266 The step combinator executes the quotation on each member of the list
1267 on top of the stack.
1269 (quote, (aggregate, stack)) = S
1271 return stack, expression, dictionary
1272 head, tail = aggregate
1273 stack = quote, (head, stack)
1275 expression = tail, (quote, (S_step, expression))
1276 expression = S_i, expression
1277 return stack, expression, dictionary
1282 def times(stack, expression, dictionary):
1284 times == [-- dip] cons [swap] infra [0 >] swap while pop
1288 --------------------- w/ n <= 0
1293 -----------------------
1298 ------------------------------------- w/ n > 1
1299 ... . Q (n - 1) [Q] times
1302 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1303 (quote, (n, stack)) = stack
1305 return stack, expression, dictionary
1308 expression = n, (quote, (S_times, expression))
1309 expression = concat(quote, expression)
1310 return stack, expression, dictionary
1313 # The current definition above works like this:
1316 # --------------------------------------
1317 # [P] nullary [Q [P] nullary] loop
1319 # while == [pop i not] [popop] [dudipd] tailrec
1321 #def while_(S, expression, dictionary):
1322 # '''[if] [body] while'''
1323 # (body, (if_, stack)) = S
1324 # while joy(stack, if_, dictionary)[0][0]:
1325 # stack = joy(stack, body, dictionary)[0]
1326 # return stack, expression, dictionary
1331 def loop(stack, expression, dictionary):
1333 Basic loop combinator.
1337 -----------------------
1341 ------------------------
1345 quote, (flag, stack) = stack
1347 expression = concat(quote, (quote, (S_loop, expression)))
1348 return stack, expression, dictionary
1353 def cmp_(stack, expression, dictionary):
1355 cmp takes two values and three quoted programs on the stack and runs
1356 one of the three depending on the results of comparing the two values:
1360 ------------------------- a > b
1364 ------------------------- a = b
1368 ------------------------- a < b
1371 L, (E, (G, (b, (a, stack)))) = stack
1372 expression = concat(G if a > b else L if a < b else E, expression)
1373 return stack, expression, dictionary
1376 # FunctionWrapper(cleave),
1377 # FunctionWrapper(while_),
1382 #divmod_ = pm = __(n2, n1), __(n4, n3)
1384 BinaryBuiltinWrapper(operator.eq),
1385 BinaryBuiltinWrapper(operator.ge),
1386 BinaryBuiltinWrapper(operator.gt),
1387 BinaryBuiltinWrapper(operator.le),
1388 BinaryBuiltinWrapper(operator.lt),
1389 BinaryBuiltinWrapper(operator.ne),
1391 BinaryBuiltinWrapper(operator.xor),
1392 BinaryBuiltinWrapper(operator.lshift),
1393 BinaryBuiltinWrapper(operator.rshift),
1395 BinaryBuiltinWrapper(operator.and_),
1396 BinaryBuiltinWrapper(operator.or_),
1398 BinaryBuiltinWrapper(operator.add),
1399 BinaryBuiltinWrapper(operator.floordiv),
1400 BinaryBuiltinWrapper(operator.mod),
1401 BinaryBuiltinWrapper(operator.mul),
1402 BinaryBuiltinWrapper(operator.pow),
1403 BinaryBuiltinWrapper(operator.sub),
1404 BinaryBuiltinWrapper(operator.truediv),
1406 UnaryBuiltinWrapper(bool),
1407 UnaryBuiltinWrapper(operator.not_),
1409 UnaryBuiltinWrapper(abs),
1410 UnaryBuiltinWrapper(operator.neg),
1411 UnaryBuiltinWrapper(sqrt),
1413 UnaryBuiltinWrapper(floor),
1414 UnaryBuiltinWrapper(round),
1417 del F # Otherwise Sphinx autodoc will pick it up.
1420 for name, primitive in getmembers(genlib, isfunction):
1421 inscribe(SimpleFunctionWrapper(primitive))
1424 add_aliases(_dictionary, ALIASES)
1427 DefinitionWrapper.add_definitions(definitions, _dictionary)