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.errors import (
38 from .utils.stack import (
57 # This is the main dict we're building.
61 def inscribe(function):
62 '''A decorator to inscribe functions into the default dictionary.'''
63 _dictionary[function.name] = function
68 '''Return a dictionary of Joy functions for use with joy().'''
69 return _dictionary.copy()
77 ('floordiv', ['/floor', '//', '/', 'div']),
78 ('mod', ['%', 'rem', 'remainder', 'modulus']),
81 ('getitem', ['pick', 'at']),
92 ('rolldown', ['roll<']),
93 ('rollup', ['roll>']),
99 def add_aliases(D, A):
101 Given a dict and a iterable of (name, [alias, ...]) pairs, create
102 additional entries in the dict mapping each alias to the named function
103 if it's in the dict. Aliases for functions not in the dict are ignored.
105 for name, aliases in A:
110 for alias in aliases:
116 *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
117 *fraction0 == concat [[swap] dip * [*] dip] infra
118 anamorphism == [pop []] swap [dip swons] genrec
119 average == [sum 1.0 *] [size] cleave /
120 binary == nullary [popop] dip
121 cleave == fork [popd] dip
122 codireco == cons dip rest cons
123 dinfrirst == dip infra first
124 unstack == ? [uncons ?] loop pop
125 down_to_zero == [0 >] [dup --] while
127 enstacken == stack [clear] dip
128 flatten == [] swap [concat] step
130 gcd == 1 [tuck modulus dup 0 >] loop pop
131 ifte == [nullary not] dipd branch
133 least_fraction == dup [gcd] infra [div] concat map
134 make_generator == [codireco] ccons
135 nullary == [stack] dinfrirst
138 tailrec == [i] genrec
139 product == 1 swap [*] step
141 range == [0 <=] [1 - dup] anamorphism
142 range_to_zero == unit [down_to_zero] infra
144 size == 0 swap [pop ++] step
146 step_zero == 0 roll> step
147 swoncat == swap concat
148 tailrec == [i] genrec
149 ternary == unary [popop] dip
150 unary == nullary popd
152 while == swap [nullary] cons dup dipd concat loop
156 # ifte == [nullary] dipd swap branch
157 # genrec == [[genrec] cons cons cons cons] nullary swons concat ifte
159 # Another definition for while. FWIW
160 # while == over [[i] dip nullary] ccons [nullary] dip loop
164 ##second == rest first
165 ##third == rest rest first
169 ##z-down == [] swap uncons swap
170 ##z-up == swons swap shunt
171 ##z-right == [swons] cons dip uncons swap
172 ##z-left == swons [uncons swap] dip swap
175 ##divisor == popop 2 *
177 ##radical == swap dup * rollup * 4 * - sqrt
180 ##q0 == [[divisor] [minusb] [radical]] pam
181 ##q1 == [[root1] [root2]] pam
182 ##quadratic == [q0] ternary i [q1] ternary
186 ##PE1.1 == + dup [+] dip
187 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
188 ##PE1.3 == 14811 swap [PE1.2] times pop
189 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
191 #PE1.2 == [PE1.1] step
192 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
196 def FunctionWrapper(f):
197 '''Set name attribute.'''
199 raise ValueError('Function %s must have doc string.' % f.__name__)
200 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
204 def SimpleFunctionWrapper(f):
206 Wrap functions that take and return just a stack.
210 def inner(stack, expression, dictionary):
211 return f(stack), expression, dictionary
215 def BinaryBuiltinWrapper(f):
217 Wrap functions that take two arguments and return a single result.
221 def inner(stack, expression, dictionary):
223 (a, (b, stack)) = stack
225 raise StackUnderflowError('Not enough values on stack.')
226 if ( not isinstance(a, int)
227 or not isinstance(b, int)
228 or isinstance(a, bool) # Because bools are ints in Python.
229 or isinstance(b, bool)
233 return (result, stack), expression, dictionary
237 def UnaryBuiltinWrapper(f):
239 Wrap functions that take one argument and return a single result.
243 def inner(stack, expression, dictionary):
246 return (result, stack), expression, dictionary
250 class DefinitionWrapper(object):
252 Provide implementation of defined functions, and some helper methods.
255 def __init__(self, name, body_text, doc=None):
256 self.name = self.__name__ = name
257 self.body = text_to_expression(body_text)
258 self._body = tuple(iter_stack(self.body))
259 self.__doc__ = doc or body_text
260 self._compiled = None
262 def __call__(self, stack, expression, dictionary):
264 return self._compiled(stack, expression, dictionary) # pylint: disable=E1102
265 expression = list_to_stack(self._body, expression)
266 return stack, expression, dictionary
269 def parse_definition(class_, defi):
271 Given some text describing a Joy function definition parse it and
272 return a DefinitionWrapper.
274 # At some point I decided that the definitions file should NOT
275 # use '==' to separate the name from the body. But somehow the
276 # xerblin\gui\default_joy_home\definitions.txt file didn't get
277 # the memo. Nor did the load_definitions() method.
278 # So I think the simplest way forward at the moment will be to
279 # edit this function to expect '=='.
281 name, part, body = defi.partition('==')
283 return class_(name.strip(), body.strip())
284 raise ValueError("No '==' in definition text %r" % (defi,))
286 # return class_(*(n.strip() for n in defi.split(None, 1)))
289 def add_definitions(class_, defs, dictionary):
291 Scan multi-line string defs for definitions and add them to the
294 for definition in _text_to_defs(defs):
295 class_.add_def(definition, dictionary)
298 def add_def(class_, definition, dictionary, fail_fails=False):
300 Add the definition to the dictionary.
302 F = class_.parse_definition(definition)
303 dictionary[F.name] = F
306 def load_definitions(class_, filename, dictionary):
307 with open(filename) as f:
308 lines = [line for line in f if '==' in line]
310 class_.add_def(line, dictionary)
313 def _text_to_defs(text):
316 for line in text.splitlines()
318 and not line.startswith('#')
330 def inscribe_(stack, expression, dictionary):
332 Create a new Joy function definition in the Joy dictionary. A
333 definition is given as a string with a name followed by a double
334 equal sign then one or more Joy functions, the body. for example:
338 If you want the definition to persist over restarts, enter it into
339 the definitions.txt resource.
341 definition, stack = stack
342 DefinitionWrapper.add_def(definition, dictionary, fail_fails=True)
343 return stack, expression, dictionary
347 @SimpleFunctionWrapper
349 '''Parse the string on the stack to a Joy expression.'''
351 expression = text_to_expression(text)
352 return expression, stack
356 # @SimpleFunctionWrapper
358 # '''Attempt to infer the stack effect of a Joy expression.'''
360 # effects = infer_expression(E)
361 # e = list_to_stack([(fi, (fo, ())) for fi, fo in effects])
366 @SimpleFunctionWrapper
371 getitem == drop first
373 Expects an integer and a quote on the stack and returns the item at the
374 nth position in the quote counting from 0.
378 -------------------------
382 n, (Q, stack) = stack
383 return pick(Q, n), stack
387 @SimpleFunctionWrapper
394 Expects an integer and a quote on the stack and returns the quote with
395 n items removed off the top.
399 ----------------------
403 n, (Q, stack) = stack
414 @SimpleFunctionWrapper
417 Expects an integer and a quote on the stack and returns the quote with
418 just the top n items in reverse order (because that's easier and you can
419 use reverse if needed.)
423 ----------------------
427 n, (Q, stack) = stack
441 def gcd2(stack, expression, dictionary):
442 '''Compiled GCD function.'''
443 (v1, (v2, stack)) = stack
448 (v1, (v2, stack)) = (v3, (v1, stack))
449 return (v2, stack), expression, dictionary
453 @SimpleFunctionWrapper
456 Use a Boolean value to select one of two items.
460 ----------------------
465 ---------------------
468 Currently Python semantics are used to evaluate the "truthiness" of the
469 Boolean value (so empty string, zero, etc. are counted as false, etc.)
471 (if_, (then, (else_, stack))) = stack
472 return then if if_ else else_, stack
476 @SimpleFunctionWrapper
479 Use a Boolean value to select one of two items from a sequence.
483 ------------------------
488 -----------------------
491 The sequence can contain more than two items but not fewer.
492 Currently Python semantics are used to evaluate the "truthiness" of the
493 Boolean value (so empty string, zero, etc. are counted as false, etc.)
495 (flag, (choices, stack)) = stack
496 (else_, (then, _)) = choices
497 return then if flag else else_, stack
501 @SimpleFunctionWrapper
503 '''Given a list find the maximum.'''
505 return max(iter_stack(tos)), stack
509 @SimpleFunctionWrapper
511 '''Given a list find the minimum.'''
513 return min(iter_stack(tos)), stack
517 @SimpleFunctionWrapper
520 Given a quoted sequence of numbers return the sum.
523 sum == 0 swap [+] step
527 return sum(iter_stack(tos)), stack
531 @SimpleFunctionWrapper
534 Expects an item on the stack and a quote under it and removes that item
535 from the the quote. The item is only removed once.
539 ------------------------
543 (tos, (second, stack)) = S
544 l = list(iter_stack(second))
546 return list_to_stack(l), stack
550 @SimpleFunctionWrapper
552 '''Given a list remove duplicate items.'''
554 I = list(iter_stack(tos))
555 return list_to_stack(sorted(set(I), key=I.index)), stack
559 @SimpleFunctionWrapper
561 '''Given a list return it sorted.'''
563 return list_to_stack(sorted(iter_stack(tos))), stack
567 @SimpleFunctionWrapper
569 '''Clear everything from the stack.
572 clear == stack [pop stack] loop
582 @SimpleFunctionWrapper
583 def disenstacken(stack):
585 The disenstacken operator expects a list on top of the stack and makes that
586 the stack discarding the rest of the stack.
592 @SimpleFunctionWrapper
595 Reverse the list on the top of the stack.
598 reverse == [] swap shunt
602 for term in iter_stack(tos):
608 @SimpleFunctionWrapper
611 Concatinate the two lists on the top of the stack.
614 [a b c] [d e f] concat
615 ----------------------------
619 (tos, (second, stack)) = S
620 return concat(second, tos), stack
624 @SimpleFunctionWrapper
627 Like concat but reverses the top list into the second.
630 shunt == [swons] step == reverse swap concat
632 [a b c] [d e f] shunt
633 ---------------------------
637 (tos, (second, stack)) = stack
640 second = term, second
645 @SimpleFunctionWrapper
648 Replace the two lists on the top of the stack with a list of the pairs
649 from each list. The smallest list sets the length of the result list.
651 (tos, (second, stack)) = S
654 for a, b in zip(iter_stack(tos), iter_stack(second))
656 return list_to_stack(accumulator), stack
660 @SimpleFunctionWrapper
664 return tos + 1, stack
668 @SimpleFunctionWrapper
672 return tos - 1, stack
676 @SimpleFunctionWrapper
687 a, (b, stack) = stack
693 return int(math.floor(n))
695 floor.__doc__ = math.floor.__doc__
699 @SimpleFunctionWrapper
702 divmod(x, y) -> (quotient, remainder)
704 Return the tuple (x//y, x%y). Invariant: q * y + r == x.
713 Return the square root of the number a.
714 Negative numbers return complex roots.
719 assert a < 0, repr(a)
720 r = math.sqrt(-a) * 1j
726 # if isinstance(text, str):
727 # return run(text, stack)
732 @SimpleFunctionWrapper
734 '''The identity function.'''
739 @SimpleFunctionWrapper
741 '''True if the form on TOS is void otherwise False.'''
743 return _void(form), stack
747 return any(not _void(i) for i in iter_stack(form))
758 def words(stack, expression, dictionary):
759 '''Print all the words in alphabetical order.'''
760 print(' '.join(sorted(dictionary)))
761 return stack, expression, dictionary
766 def sharing(stack, expression, dictionary):
767 '''Print redistribution information.'''
768 print("You may convey verbatim copies of the Program's source code as"
769 ' you receive it, in any medium, provided that you conspicuously'
770 ' and appropriately publish on each copy an appropriate copyright'
771 ' notice; keep intact all notices stating that this License and'
772 ' any non-permissive terms added in accord with section 7 apply'
773 ' to the code; keep intact all notices of the absence of any'
774 ' warranty; and give all recipients a copy of this License along'
776 ' You should have received a copy of the GNU General Public License'
777 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
778 return stack, expression, dictionary
783 def warranty(stack, expression, dictionary):
784 '''Print warranty information.'''
785 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
786 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
787 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
788 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
789 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
790 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
791 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
792 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
793 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
794 return stack, expression, dictionary
797 # def simple_manual(stack):
799 # Print words and help for each word.
801 # for name, f in sorted(FUNCTIONS.items()):
803 # boxline = '+%s+' % ('-' * (len(name) + 2))
806 # '| %s |' % (name,),
808 # d if d else ' ...',
818 def help_(S, expression, dictionary):
819 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
820 ((symbol, _), stack) = S
821 word = dictionary[symbol]
822 print(HELP_TEMPLATE % (symbol, getdoc(word), symbol))
823 return stack, expression, dictionary
831 # Several combinators depend on other words in their definitions,
832 # we use symbols to prevent hard-coding these, so in theory, you
833 # could change the word in the dictionary to use different semantics.
834 S_choice = Symbol('choice')
835 S_first = Symbol('first')
836 S_genrec = Symbol('genrec')
837 S_getitem = Symbol('getitem')
839 S_ifte = Symbol('ifte')
840 S_infra = Symbol('infra')
841 S_loop = Symbol('loop')
842 S_pop = Symbol('pop')
843 S_primrec = Symbol('primrec')
844 S_step = Symbol('step')
845 S_swaack = Symbol('swaack')
846 S_times = Symbol('times')
851 def i(stack, expression, dictionary):
853 The i combinator expects a quoted program on the stack and unpacks it
854 onto the pending expression for evaluation.
865 raise StackUnderflowError('Not enough values on stack.')
866 return stack, concat(quote, expression), dictionary
871 def x(stack, expression, dictionary):
877 ... [Q] x = ... [Q] dup i
878 ... [Q] x = ... [Q] [Q] i
879 ... [Q] x = ... [Q] Q
883 return stack, concat(quote, expression), dictionary
888 def b(stack, expression, dictionary):
894 ... [P] [Q] b == ... [P] i [Q] i
895 ... [P] [Q] b == ... P Q
898 q, (p, (stack)) = stack
899 return stack, concat(p, concat(q, expression)), dictionary
904 def dupdip(stack, expression, dictionary):
908 [F] dupdip == dup [F] dip
918 return stack, concat(F, (a, expression)), dictionary
923 def infra(stack, expression, dictionary):
925 Accept a quoted program and a list on the stack and run the program
926 with the list as its stack. Does not affect the rest of the stack.
929 ... [a b c] [Q] . infra
930 -----------------------------
931 c b a . Q [...] swaack
934 (quote, (aggregate, stack)) = stack
935 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
940 def genrec(stack, expression, dictionary):
942 General Recursion Combinator.
945 [if] [then] [rec1] [rec2] genrec
946 ---------------------------------------------------------------------
947 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
949 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
950 "The genrec combinator takes four program parameters in addition to
951 whatever data parameters it needs. Fourth from the top is an if-part,
952 followed by a then-part. If the if-part yields true, then the then-part
953 is executed and the combinator terminates. The other two parameters are
954 the rec1-part and the rec2-part. If the if-part yields false, the
955 rec1-part is executed. Following that the four program parameters and
956 the combinator are again pushed onto the stack bundled up in a quoted
957 form. Then the rec2-part is executed, where it will find the bundled
958 form. Typically it will then execute the bundled form, either with i or
959 with app2, or some other combinator."
961 The way to design one of these is to fix your base case [then] and the
962 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
963 a quotation of the whole function.
965 For example, given a (general recursive) function 'F':
968 F == [I] [T] [R1] [R2] genrec
970 If the [I] if-part fails you must derive R1 and R2 from:
975 Just set the stack arguments in front, and figure out what R1 and R2
976 have to do to apply the quoted [F] in the proper way. In effect, the
977 genrec combinator turns into an ifte combinator with a quoted copy of
978 the original definition in the else-part:
981 F == [I] [T] [R1] [R2] genrec
982 == [I] [T] [R1 [F] R2] ifte
984 Primitive recursive functions are those where R2 == i.
987 P == [I] [T] [R] tailrec
988 == [I] [T] [R [P] i] ifte
989 == [I] [T] [R P] ifte
992 (rec2, (rec1, stack)) = stack
993 (then, (if_, _)) = stack
994 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
995 else_ = concat(rec1, (F, rec2))
996 return (else_, stack), (S_ifte, expression), dictionary
1001 def map_(S, expression, dictionary):
1003 Run the quoted program on TOS on the items in the list under it, push a
1004 new list with the results in place of the program and original list.
1006 # (quote, (aggregate, stack)) = S
1007 # results = list_to_stack([
1008 # joy((term, stack), quote, dictionary)[0][0]
1009 # for term in iter_stack(aggregate)
1011 # return (results, stack), expression, dictionary
1012 (quote, (aggregate, stack)) = S
1014 return (aggregate, stack), expression, dictionary
1016 for term in iter_stack(aggregate):
1018 batch = (s, (quote, (S_infra, (S_first, batch))))
1019 stack = (batch, ((), stack))
1020 return stack, (S_infra, expression), dictionary
1025 def primrec(stack, expression, dictionary):
1027 From the "Overview of the language JOY":
1029 > The primrec combinator expects two quoted programs in addition to a
1030 data parameter. For an integer data parameter it works like this: If
1031 the data parameter is zero, then the first quotation has to produce
1032 the value to be returned. If the data parameter is positive then the
1033 second has to combine the data parameter with the result of applying
1034 the function to its predecessor.::
1038 > Then primrec tests whether the top element on the stack (initially
1039 the 5) is equal to zero. If it is, it pops it off and executes one of
1040 the quotations, the [1] which leaves 1 on the stack as the result.
1041 Otherwise it pushes a decremented copy of the top element and
1042 recurses. On the way back from the recursion it uses the other
1043 quotation, [*], to multiply what is now a factorial on top of the
1044 stack by the second element on the stack.::
1046 n [Base] [Recur] primrec
1048 0 [Base] [Recur] primrec
1049 ------------------------------
1052 n [Base] [Recur] primrec
1053 ------------------------------------------ n > 0
1054 n (n-1) [Base] [Recur] primrec Recur
1057 recur, (base, (n, stack)) = stack
1059 expression = concat(base, expression)
1061 expression = S_primrec, concat(recur, expression)
1062 stack = recur, (base, (n - 1, (n, stack)))
1063 return stack, expression, dictionary
1066 #def cleave(S, expression, dictionary):
1068 # The cleave combinator expects two quotations, and below that an item X.
1069 # It first executes [P], with X on top, and saves the top result element.
1070 # Then it executes [Q], again with X, and saves the top result.
1071 # Finally it restores the stack to what it was below X and pushes the two
1072 # results P(X) and Q(X).
1074 # (Q, (P, (x, stack))) = S
1075 # p = joy((x, stack), P, dictionary)[0][0]
1076 # q = joy((x, stack), Q, dictionary)[0][0]
1077 # return (q, (p, stack)), expression, dictionary
1082 def branch(stack, expression, dictionary):
1084 Use a Boolean value to select one of two quoted programs to run.
1088 branch == roll< choice i
1092 False [F] [T] branch
1093 --------------------------
1097 -------------------------
1101 (then, (else_, (flag, stack))) = stack
1102 return stack, concat(then if flag else else_, expression), dictionary
1107 ##def ifte(stack, expression, dictionary):
1109 ## If-Then-Else Combinator
1112 ## ... [if] [then] [else] ifte
1113 ## ---------------------------------------------------
1114 ## ... [[else] [then]] [...] [if] infra select i
1119 ## ... [if] [then] [else] ifte
1120 ## -------------------------------------------------------
1121 ## ... [else] [then] [...] [if] infra first choice i
1124 ## Has the effect of grabbing a copy of the stack on which to run the
1125 ## if-part using infra.
1127 ## (else_, (then, (if_, stack))) = stack
1128 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1129 ## stack = (if_, (stack, (then, (else_, stack))))
1130 ## return stack, expression, dictionary
1135 def cond(stack, expression, dictionary):
1137 This combinator works like a case statement. It expects a single quote
1138 on the stack that must contain zero or more condition quotes and a
1139 default quote. Each condition clause should contain a quoted predicate
1140 followed by the function expression to run if that predicate returns
1141 true. If no predicates return true the default function runs.
1143 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1145 [[[B0] T0] [[B1] T1] [D]] cond
1146 -----------------------------------------
1147 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1150 conditions, stack = stack
1152 expression = _cond(conditions, expression)
1154 # Attempt to preload the args to first ifte.
1155 (P, (T, (E, expression))) = expression
1157 # If, for any reason, the argument to cond should happen to contain
1158 # only the default clause then this optimization will fail.
1161 stack = (E, (T, (P, stack)))
1162 return stack, expression, dictionary
1165 def _cond(conditions, expression):
1166 (clause, rest) = conditions
1167 if not rest: # clause is [D]
1170 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1175 def dip(stack, expression, dictionary):
1177 The dip combinator expects a quoted program on the stack and below it
1178 some item, it hoists the item into the expression and runs the program
1179 on the rest of the stack.
1188 (quote, (x, stack)) = stack
1190 raise StackUnderflowError('Not enough values on stack.')
1191 expression = (x, expression)
1192 return stack, concat(quote, expression), dictionary
1197 def dipd(S, expression, dictionary):
1199 Like dip but expects two items.
1203 ---------------------
1207 (quote, (x, (y, stack))) = S
1208 expression = (y, (x, expression))
1209 return stack, concat(quote, expression), dictionary
1214 def dipdd(S, expression, dictionary):
1216 Like dip but expects three items.
1220 -----------------------
1224 (quote, (x, (y, (z, stack)))) = S
1225 expression = (z, (y, (x, expression)))
1226 return stack, concat(quote, expression), dictionary
1231 def app1(S, expression, dictionary):
1233 Given a quoted program on TOS and anything as the second stack item run
1234 the program and replace the two args with the first result of the
1239 -----------------------------------
1240 ... [x ...] [Q] . infra first
1243 (quote, (x, stack)) = S
1244 stack = (quote, ((x, stack), stack))
1245 expression = (S_infra, (S_first, expression))
1246 return stack, expression, dictionary
1251 def app2(S, expression, dictionary):
1252 '''Like app1 with two items.
1256 -----------------------------------
1257 ... [y ...] [Q] . infra first
1258 [x ...] [Q] infra first
1261 (quote, (x, (y, stack))) = S
1262 expression = (S_infra, (S_first,
1263 ((x, stack), (quote, (S_infra, (S_first,
1265 stack = (quote, ((y, stack), stack))
1266 return stack, expression, dictionary
1271 def app3(S, expression, dictionary):
1272 '''Like app1 with three items.
1275 ... z y x [Q] . app3
1276 -----------------------------------
1277 ... [z ...] [Q] . infra first
1278 [y ...] [Q] infra first
1279 [x ...] [Q] infra first
1282 (quote, (x, (y, (z, stack)))) = S
1283 expression = (S_infra, (S_first,
1284 ((y, stack), (quote, (S_infra, (S_first,
1285 ((x, stack), (quote, (S_infra, (S_first,
1286 expression))))))))))
1287 stack = (quote, ((z, stack), stack))
1288 return stack, expression, dictionary
1293 def step(S, expression, dictionary):
1295 Run a quoted program on each item in a sequence.
1299 -----------------------
1304 ------------------------
1308 ... [a b c] [Q] . step
1309 ----------------------------------------
1310 ... a . Q [b c] [Q] step
1312 The step combinator executes the quotation on each member of the list
1313 on top of the stack.
1315 (quote, (aggregate, stack)) = S
1317 return stack, expression, dictionary
1318 head, tail = aggregate
1319 stack = quote, (head, stack)
1321 expression = tail, (quote, (S_step, expression))
1322 expression = S_i, expression
1323 return stack, expression, dictionary
1328 def times(stack, expression, dictionary):
1330 times == [-- dip] cons [swap] infra [0 >] swap while pop
1334 --------------------- w/ n <= 0
1339 -----------------------
1344 ------------------------------------- w/ n > 1
1345 ... . Q (n - 1) [Q] times
1348 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1349 (quote, (n, stack)) = stack
1351 return stack, expression, dictionary
1354 expression = n, (quote, (S_times, expression))
1355 expression = concat(quote, expression)
1356 return stack, expression, dictionary
1359 # The current definition above works like this:
1362 # --------------------------------------
1363 # [P] nullary [Q [P] nullary] loop
1365 # while == [pop i not] [popop] [dudipd] tailrec
1367 #def while_(S, expression, dictionary):
1368 # '''[if] [body] while'''
1369 # (body, (if_, stack)) = S
1370 # while joy(stack, if_, dictionary)[0][0]:
1371 # stack = joy(stack, body, dictionary)[0]
1372 # return stack, expression, dictionary
1377 def loop(stack, expression, dictionary):
1379 Basic loop combinator.
1383 -----------------------
1387 ------------------------
1392 quote, stack = stack
1394 raise StackUnderflowError('Not enough values on stack.')
1395 if not isinstance(quote, tuple):
1396 raise NotAListError('Loop body not a list.')
1398 (flag, stack) = stack
1400 raise StackUnderflowError('Not enough values on stack.')
1402 expression = concat(quote, (quote, (S_loop, expression)))
1403 return stack, expression, dictionary
1408 def cmp_(stack, expression, dictionary):
1410 cmp takes two values and three quoted programs on the stack and runs
1411 one of the three depending on the results of comparing the two values:
1415 ------------------------- a > b
1419 ------------------------- a = b
1423 ------------------------- a < b
1426 L, (E, (G, (b, (a, stack)))) = stack
1427 expression = concat(G if a > b else L if a < b else E, expression)
1428 return stack, expression, dictionary
1431 # FunctionWrapper(cleave),
1432 # FunctionWrapper(while_),
1437 #divmod_ = pm = __(n2, n1), __(n4, n3)
1439 BinaryBuiltinWrapper(operator.eq),
1440 BinaryBuiltinWrapper(operator.ge),
1441 BinaryBuiltinWrapper(operator.gt),
1442 BinaryBuiltinWrapper(operator.le),
1443 BinaryBuiltinWrapper(operator.lt),
1444 BinaryBuiltinWrapper(operator.ne),
1446 BinaryBuiltinWrapper(operator.xor),
1447 BinaryBuiltinWrapper(operator.lshift),
1448 BinaryBuiltinWrapper(operator.rshift),
1450 BinaryBuiltinWrapper(operator.and_),
1451 BinaryBuiltinWrapper(operator.or_),
1453 BinaryBuiltinWrapper(operator.add),
1454 BinaryBuiltinWrapper(operator.floordiv),
1455 BinaryBuiltinWrapper(operator.mod),
1456 BinaryBuiltinWrapper(operator.mul),
1457 BinaryBuiltinWrapper(operator.pow),
1458 BinaryBuiltinWrapper(operator.sub),
1459 ## BinaryBuiltinWrapper(operator.truediv),
1461 UnaryBuiltinWrapper(bool),
1462 UnaryBuiltinWrapper(operator.not_),
1464 UnaryBuiltinWrapper(abs),
1465 UnaryBuiltinWrapper(operator.neg),
1466 UnaryBuiltinWrapper(sqrt),
1468 UnaryBuiltinWrapper(floor),
1469 UnaryBuiltinWrapper(round),
1472 del F # Otherwise Sphinx autodoc will pick it up.
1475 for name, primitive in getmembers(genlib, isfunction):
1476 inscribe(SimpleFunctionWrapper(primitive))
1479 add_aliases(_dictionary, ALIASES)
1482 DefinitionWrapper.add_definitions(definitions, _dictionary)