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 # Boolean predicates like "or" fail here. :(
227 ## if ( not isinstance(a, int)
228 ## or not isinstance(b, int)
229 ## or isinstance(a, bool) # Because bools are ints in Python.
230 ## or isinstance(b, bool)
232 ## raise NotAnIntError
234 return (result, stack), expression, dictionary
238 def UnaryBuiltinWrapper(f):
240 Wrap functions that take one argument and return a single result.
244 def inner(stack, expression, dictionary):
247 return (result, stack), expression, dictionary
251 class DefinitionWrapper(object):
253 Provide implementation of defined functions, and some helper methods.
256 def __init__(self, name, body_text, doc=None):
257 self.name = self.__name__ = name
258 self.body = text_to_expression(body_text)
259 self._body = tuple(iter_stack(self.body))
260 self.__doc__ = doc or body_text
261 self._compiled = None
263 def __call__(self, stack, expression, dictionary):
265 return self._compiled(stack, expression, dictionary) # pylint: disable=E1102
266 expression = list_to_stack(self._body, expression)
267 return stack, expression, dictionary
270 def parse_definition(class_, defi):
272 Given some text describing a Joy function definition parse it and
273 return a DefinitionWrapper.
275 # At some point I decided that the definitions file should NOT
276 # use '==' to separate the name from the body. But somehow the
277 # xerblin\gui\default_joy_home\definitions.txt file didn't get
278 # the memo. Nor did the load_definitions() method.
279 # So I think the simplest way forward at the moment will be to
280 # edit this function to expect '=='.
282 name, part, body = defi.partition('==')
284 return class_(name.strip(), body.strip())
285 raise ValueError("No '==' in definition text %r" % (defi,))
287 # return class_(*(n.strip() for n in defi.split(None, 1)))
290 def add_definitions(class_, defs, dictionary):
292 Scan multi-line string defs for definitions and add them to the
295 for definition in _text_to_defs(defs):
296 class_.add_def(definition, dictionary)
299 def add_def(class_, definition, dictionary, fail_fails=False):
301 Add the definition to the dictionary.
303 F = class_.parse_definition(definition)
304 dictionary[F.name] = F
307 def load_definitions(class_, filename, dictionary):
308 with open(filename) as f:
309 lines = [line for line in f if '==' in line]
311 class_.add_def(line, dictionary)
314 def _text_to_defs(text):
317 for line in text.splitlines()
319 and not line.startswith('#')
331 def inscribe_(stack, expression, dictionary):
333 Create a new Joy function definition in the Joy dictionary. A
334 definition is given as a string with a name followed by a double
335 equal sign then one or more Joy functions, the body. for example:
339 If you want the definition to persist over restarts, enter it into
340 the definitions.txt resource.
342 definition, stack = stack
343 DefinitionWrapper.add_def(definition, dictionary, fail_fails=True)
344 return stack, expression, dictionary
348 @SimpleFunctionWrapper
350 '''Parse the string on the stack to a Joy expression.'''
352 expression = text_to_expression(text)
353 return expression, stack
357 # @SimpleFunctionWrapper
359 # '''Attempt to infer the stack effect of a Joy expression.'''
361 # effects = infer_expression(E)
362 # e = list_to_stack([(fi, (fo, ())) for fi, fo in effects])
367 @SimpleFunctionWrapper
372 getitem == drop first
374 Expects an integer and a quote on the stack and returns the item at the
375 nth position in the quote counting from 0.
379 -------------------------
383 n, (Q, stack) = stack
384 return pick(Q, n), stack
388 @SimpleFunctionWrapper
395 Expects an integer and a quote on the stack and returns the quote with
396 n items removed off the top.
400 ----------------------
404 n, (Q, stack) = stack
415 @SimpleFunctionWrapper
418 Expects an integer and a quote on the stack and returns the quote with
419 just the top n items in reverse order (because that's easier and you can
420 use reverse if needed.)
424 ----------------------
428 n, (Q, stack) = stack
442 def gcd2(stack, expression, dictionary):
443 '''Compiled GCD function.'''
444 (v1, (v2, stack)) = stack
449 (v1, (v2, stack)) = (v3, (v1, stack))
450 return (v2, stack), expression, dictionary
454 @SimpleFunctionWrapper
457 Use a Boolean value to select one of two items.
461 ----------------------
466 ---------------------
469 Currently Python semantics are used to evaluate the "truthiness" of the
470 Boolean value (so empty string, zero, etc. are counted as false, etc.)
472 (if_, (then, (else_, stack))) = stack
473 return then if if_ else else_, stack
477 @SimpleFunctionWrapper
480 Use a Boolean value to select one of two items from a sequence.
484 ------------------------
489 -----------------------
492 The sequence can contain more than two items but not fewer.
493 Currently Python semantics are used to evaluate the "truthiness" of the
494 Boolean value (so empty string, zero, etc. are counted as false, etc.)
496 (flag, (choices, stack)) = stack
497 (else_, (then, _)) = choices
498 return then if flag else else_, stack
502 @SimpleFunctionWrapper
504 '''Given a list find the maximum.'''
506 return max(iter_stack(tos)), stack
510 @SimpleFunctionWrapper
512 '''Given a list find the minimum.'''
514 return min(iter_stack(tos)), stack
518 @SimpleFunctionWrapper
521 Given a quoted sequence of numbers return the sum.
524 sum == 0 swap [+] step
528 return sum(iter_stack(tos)), stack
532 @SimpleFunctionWrapper
535 Expects an item on the stack and a quote under it and removes that item
536 from the the quote. The item is only removed once.
540 ------------------------
544 (tos, (second, stack)) = S
545 l = list(iter_stack(second))
547 return list_to_stack(l), stack
551 @SimpleFunctionWrapper
553 '''Given a list remove duplicate items.'''
555 I = list(iter_stack(tos))
556 return list_to_stack(sorted(set(I), key=I.index)), stack
560 @SimpleFunctionWrapper
562 '''Given a list return it sorted.'''
564 return list_to_stack(sorted(iter_stack(tos))), stack
568 @SimpleFunctionWrapper
570 '''Clear everything from the stack.
573 clear == stack [pop stack] loop
583 @SimpleFunctionWrapper
584 def disenstacken(stack):
586 The disenstacken operator expects a list on top of the stack and makes that
587 the stack discarding the rest of the stack.
593 @SimpleFunctionWrapper
596 Reverse the list on the top of the stack.
599 reverse == [] swap shunt
603 for term in iter_stack(tos):
609 @SimpleFunctionWrapper
612 Concatinate the two lists on the top of the stack.
615 [a b c] [d e f] concat
616 ----------------------------
620 (tos, (second, stack)) = S
621 return concat(second, tos), stack
625 @SimpleFunctionWrapper
628 Like concat but reverses the top list into the second.
631 shunt == [swons] step == reverse swap concat
633 [a b c] [d e f] shunt
634 ---------------------------
638 (tos, (second, stack)) = stack
641 second = term, second
646 @SimpleFunctionWrapper
649 Replace the two lists on the top of the stack with a list of the pairs
650 from each list. The smallest list sets the length of the result list.
652 (tos, (second, stack)) = S
655 for a, b in zip(iter_stack(tos), iter_stack(second))
657 return list_to_stack(accumulator), stack
661 @SimpleFunctionWrapper
665 return tos + 1, stack
669 @SimpleFunctionWrapper
673 return tos - 1, stack
677 @SimpleFunctionWrapper
688 a, (b, stack) = stack
694 return int(math.floor(n))
696 floor.__doc__ = math.floor.__doc__
700 @SimpleFunctionWrapper
703 divmod(x, y) -> (quotient, remainder)
705 Return the tuple (x//y, x%y). Invariant: q * y + r == x.
714 Return the square root of the number a.
715 Negative numbers return complex roots.
720 assert a < 0, repr(a)
721 r = math.sqrt(-a) * 1j
727 # if isinstance(text, str):
728 # return run(text, stack)
733 @SimpleFunctionWrapper
735 '''The identity function.'''
740 @SimpleFunctionWrapper
742 '''True if the form on TOS is void otherwise False.'''
744 return _void(form), stack
748 return any(not _void(i) for i in iter_stack(form))
759 def words(stack, expression, dictionary):
760 '''Print all the words in alphabetical order.'''
761 print(' '.join(sorted(dictionary)))
762 return stack, expression, dictionary
767 def sharing(stack, expression, dictionary):
768 '''Print redistribution information.'''
769 print("You may convey verbatim copies of the Program's source code as"
770 ' you receive it, in any medium, provided that you conspicuously'
771 ' and appropriately publish on each copy an appropriate copyright'
772 ' notice; keep intact all notices stating that this License and'
773 ' any non-permissive terms added in accord with section 7 apply'
774 ' to the code; keep intact all notices of the absence of any'
775 ' warranty; and give all recipients a copy of this License along'
777 ' You should have received a copy of the GNU General Public License'
778 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
779 return stack, expression, dictionary
784 def warranty(stack, expression, dictionary):
785 '''Print warranty information.'''
786 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
787 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
788 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
789 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
790 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
791 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
792 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
793 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
794 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
795 return stack, expression, dictionary
798 # def simple_manual(stack):
800 # Print words and help for each word.
802 # for name, f in sorted(FUNCTIONS.items()):
804 # boxline = '+%s+' % ('-' * (len(name) + 2))
807 # '| %s |' % (name,),
809 # d if d else ' ...',
819 def help_(S, expression, dictionary):
820 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
821 ((symbol, _), stack) = S
822 word = dictionary[symbol]
823 print(HELP_TEMPLATE % (symbol, getdoc(word), symbol))
824 return stack, expression, dictionary
832 # Several combinators depend on other words in their definitions,
833 # we use symbols to prevent hard-coding these, so in theory, you
834 # could change the word in the dictionary to use different semantics.
835 S_choice = Symbol('choice')
836 S_first = Symbol('first')
837 S_genrec = Symbol('genrec')
838 S_getitem = Symbol('getitem')
840 S_ifte = Symbol('ifte')
841 S_infra = Symbol('infra')
842 S_loop = Symbol('loop')
843 S_pop = Symbol('pop')
844 S_primrec = Symbol('primrec')
845 S_step = Symbol('step')
846 S_swaack = Symbol('swaack')
847 S_times = Symbol('times')
852 def i(stack, expression, dictionary):
854 The i combinator expects a quoted program on the stack and unpacks it
855 onto the pending expression for evaluation.
866 raise StackUnderflowError('Not enough values on stack.')
867 return stack, concat(quote, expression), dictionary
872 def x(stack, expression, dictionary):
878 ... [Q] x = ... [Q] dup i
879 ... [Q] x = ... [Q] [Q] i
880 ... [Q] x = ... [Q] Q
884 return stack, concat(quote, expression), dictionary
889 def b(stack, expression, dictionary):
895 ... [P] [Q] b == ... [P] i [Q] i
896 ... [P] [Q] b == ... P Q
899 q, (p, (stack)) = stack
900 return stack, concat(p, concat(q, expression)), dictionary
905 def dupdip(stack, expression, dictionary):
909 [F] dupdip == dup [F] dip
919 return stack, concat(F, (a, expression)), dictionary
924 def infra(stack, expression, dictionary):
926 Accept a quoted program and a list on the stack and run the program
927 with the list as its stack. Does not affect the rest of the stack.
930 ... [a b c] [Q] . infra
931 -----------------------------
932 c b a . Q [...] swaack
935 (quote, (aggregate, stack)) = stack
936 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
941 def genrec(stack, expression, dictionary):
943 General Recursion Combinator.
946 [if] [then] [rec1] [rec2] genrec
947 ---------------------------------------------------------------------
948 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
950 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
951 "The genrec combinator takes four program parameters in addition to
952 whatever data parameters it needs. Fourth from the top is an if-part,
953 followed by a then-part. If the if-part yields true, then the then-part
954 is executed and the combinator terminates. The other two parameters are
955 the rec1-part and the rec2-part. If the if-part yields false, the
956 rec1-part is executed. Following that the four program parameters and
957 the combinator are again pushed onto the stack bundled up in a quoted
958 form. Then the rec2-part is executed, where it will find the bundled
959 form. Typically it will then execute the bundled form, either with i or
960 with app2, or some other combinator."
962 The way to design one of these is to fix your base case [then] and the
963 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
964 a quotation of the whole function.
966 For example, given a (general recursive) function 'F':
969 F == [I] [T] [R1] [R2] genrec
971 If the [I] if-part fails you must derive R1 and R2 from:
976 Just set the stack arguments in front, and figure out what R1 and R2
977 have to do to apply the quoted [F] in the proper way. In effect, the
978 genrec combinator turns into an ifte combinator with a quoted copy of
979 the original definition in the else-part:
982 F == [I] [T] [R1] [R2] genrec
983 == [I] [T] [R1 [F] R2] ifte
985 Primitive recursive functions are those where R2 == i.
988 P == [I] [T] [R] tailrec
989 == [I] [T] [R [P] i] ifte
990 == [I] [T] [R P] ifte
993 (rec2, (rec1, stack)) = stack
994 (then, (if_, _)) = stack
995 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
996 else_ = concat(rec1, (F, rec2))
997 return (else_, stack), (S_ifte, expression), dictionary
1002 def map_(S, expression, dictionary):
1004 Run the quoted program on TOS on the items in the list under it, push a
1005 new list with the results in place of the program and original list.
1007 # (quote, (aggregate, stack)) = S
1008 # results = list_to_stack([
1009 # joy((term, stack), quote, dictionary)[0][0]
1010 # for term in iter_stack(aggregate)
1012 # return (results, stack), expression, dictionary
1013 (quote, (aggregate, stack)) = S
1015 return (aggregate, stack), expression, dictionary
1017 for term in iter_stack(aggregate):
1019 batch = (s, (quote, (S_infra, (S_first, batch))))
1020 stack = (batch, ((), stack))
1021 return stack, (S_infra, expression), dictionary
1026 def primrec(stack, expression, dictionary):
1028 From the "Overview of the language JOY":
1030 > The primrec combinator expects two quoted programs in addition to a
1031 data parameter. For an integer data parameter it works like this: If
1032 the data parameter is zero, then the first quotation has to produce
1033 the value to be returned. If the data parameter is positive then the
1034 second has to combine the data parameter with the result of applying
1035 the function to its predecessor.::
1039 > Then primrec tests whether the top element on the stack (initially
1040 the 5) is equal to zero. If it is, it pops it off and executes one of
1041 the quotations, the [1] which leaves 1 on the stack as the result.
1042 Otherwise it pushes a decremented copy of the top element and
1043 recurses. On the way back from the recursion it uses the other
1044 quotation, [*], to multiply what is now a factorial on top of the
1045 stack by the second element on the stack.::
1047 n [Base] [Recur] primrec
1049 0 [Base] [Recur] primrec
1050 ------------------------------
1053 n [Base] [Recur] primrec
1054 ------------------------------------------ n > 0
1055 n (n-1) [Base] [Recur] primrec Recur
1058 recur, (base, (n, stack)) = stack
1060 expression = concat(base, expression)
1062 expression = S_primrec, concat(recur, expression)
1063 stack = recur, (base, (n - 1, (n, stack)))
1064 return stack, expression, dictionary
1067 #def cleave(S, expression, dictionary):
1069 # The cleave combinator expects two quotations, and below that an item X.
1070 # It first executes [P], with X on top, and saves the top result element.
1071 # Then it executes [Q], again with X, and saves the top result.
1072 # Finally it restores the stack to what it was below X and pushes the two
1073 # results P(X) and Q(X).
1075 # (Q, (P, (x, stack))) = S
1076 # p = joy((x, stack), P, dictionary)[0][0]
1077 # q = joy((x, stack), Q, dictionary)[0][0]
1078 # return (q, (p, stack)), expression, dictionary
1083 def branch(stack, expression, dictionary):
1085 Use a Boolean value to select one of two quoted programs to run.
1089 branch == roll< choice i
1093 False [F] [T] branch
1094 --------------------------
1098 -------------------------
1102 (then, (else_, (flag, stack))) = stack
1103 return stack, concat(then if flag else else_, expression), dictionary
1108 ##def ifte(stack, expression, dictionary):
1110 ## If-Then-Else Combinator
1113 ## ... [if] [then] [else] ifte
1114 ## ---------------------------------------------------
1115 ## ... [[else] [then]] [...] [if] infra select i
1120 ## ... [if] [then] [else] ifte
1121 ## -------------------------------------------------------
1122 ## ... [else] [then] [...] [if] infra first choice i
1125 ## Has the effect of grabbing a copy of the stack on which to run the
1126 ## if-part using infra.
1128 ## (else_, (then, (if_, stack))) = stack
1129 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1130 ## stack = (if_, (stack, (then, (else_, stack))))
1131 ## return stack, expression, dictionary
1136 def cond(stack, expression, dictionary):
1138 This combinator works like a case statement. It expects a single quote
1139 on the stack that must contain zero or more condition quotes and a
1140 default quote. Each condition clause should contain a quoted predicate
1141 followed by the function expression to run if that predicate returns
1142 true. If no predicates return true the default function runs.
1144 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1146 [[[B0] T0] [[B1] T1] [D]] cond
1147 -----------------------------------------
1148 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1151 conditions, stack = stack
1153 expression = _cond(conditions, expression)
1155 # Attempt to preload the args to first ifte.
1156 (P, (T, (E, expression))) = expression
1158 # If, for any reason, the argument to cond should happen to contain
1159 # only the default clause then this optimization will fail.
1162 stack = (E, (T, (P, stack)))
1163 return stack, expression, dictionary
1166 def _cond(conditions, expression):
1167 (clause, rest) = conditions
1168 if not rest: # clause is [D]
1171 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1176 def dip(stack, expression, dictionary):
1178 The dip combinator expects a quoted program on the stack and below it
1179 some item, it hoists the item into the expression and runs the program
1180 on the rest of the stack.
1189 (quote, (x, stack)) = stack
1191 raise StackUnderflowError('Not enough values on stack.')
1192 expression = (x, expression)
1193 return stack, concat(quote, expression), dictionary
1198 def dipd(S, expression, dictionary):
1200 Like dip but expects two items.
1204 ---------------------
1208 (quote, (x, (y, stack))) = S
1209 expression = (y, (x, expression))
1210 return stack, concat(quote, expression), dictionary
1215 def dipdd(S, expression, dictionary):
1217 Like dip but expects three items.
1221 -----------------------
1225 (quote, (x, (y, (z, stack)))) = S
1226 expression = (z, (y, (x, expression)))
1227 return stack, concat(quote, expression), dictionary
1232 def app1(S, expression, dictionary):
1234 Given a quoted program on TOS and anything as the second stack item run
1235 the program and replace the two args with the first result of the
1240 -----------------------------------
1241 ... [x ...] [Q] . infra first
1244 (quote, (x, stack)) = S
1245 stack = (quote, ((x, stack), stack))
1246 expression = (S_infra, (S_first, expression))
1247 return stack, expression, dictionary
1252 def app2(S, expression, dictionary):
1253 '''Like app1 with two items.
1257 -----------------------------------
1258 ... [y ...] [Q] . infra first
1259 [x ...] [Q] infra first
1262 (quote, (x, (y, stack))) = S
1263 expression = (S_infra, (S_first,
1264 ((x, stack), (quote, (S_infra, (S_first,
1266 stack = (quote, ((y, stack), stack))
1267 return stack, expression, dictionary
1272 def app3(S, expression, dictionary):
1273 '''Like app1 with three items.
1276 ... z y x [Q] . app3
1277 -----------------------------------
1278 ... [z ...] [Q] . infra first
1279 [y ...] [Q] infra first
1280 [x ...] [Q] infra first
1283 (quote, (x, (y, (z, stack)))) = S
1284 expression = (S_infra, (S_first,
1285 ((y, stack), (quote, (S_infra, (S_first,
1286 ((x, stack), (quote, (S_infra, (S_first,
1287 expression))))))))))
1288 stack = (quote, ((z, stack), stack))
1289 return stack, expression, dictionary
1294 def step(S, expression, dictionary):
1296 Run a quoted program on each item in a sequence.
1300 -----------------------
1305 ------------------------
1309 ... [a b c] [Q] . step
1310 ----------------------------------------
1311 ... a . Q [b c] [Q] step
1313 The step combinator executes the quotation on each member of the list
1314 on top of the stack.
1316 (quote, (aggregate, stack)) = S
1318 return stack, expression, dictionary
1319 head, tail = aggregate
1320 stack = quote, (head, stack)
1322 expression = tail, (quote, (S_step, expression))
1323 expression = S_i, expression
1324 return stack, expression, dictionary
1329 def times(stack, expression, dictionary):
1331 times == [-- dip] cons [swap] infra [0 >] swap while pop
1335 --------------------- w/ n <= 0
1340 -----------------------
1345 ------------------------------------- w/ n > 1
1346 ... . Q (n - 1) [Q] times
1349 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1350 (quote, (n, stack)) = stack
1352 return stack, expression, dictionary
1355 expression = n, (quote, (S_times, expression))
1356 expression = concat(quote, expression)
1357 return stack, expression, dictionary
1360 # The current definition above works like this:
1363 # --------------------------------------
1364 # [P] nullary [Q [P] nullary] loop
1366 # while == [pop i not] [popop] [dudipd] tailrec
1368 #def while_(S, expression, dictionary):
1369 # '''[if] [body] while'''
1370 # (body, (if_, stack)) = S
1371 # while joy(stack, if_, dictionary)[0][0]:
1372 # stack = joy(stack, body, dictionary)[0]
1373 # return stack, expression, dictionary
1378 def loop(stack, expression, dictionary):
1380 Basic loop combinator.
1384 -----------------------
1388 ------------------------
1393 quote, stack = stack
1395 raise StackUnderflowError('Not enough values on stack.')
1396 if not isinstance(quote, tuple):
1397 raise NotAListError('Loop body not a list.')
1399 (flag, stack) = stack
1401 raise StackUnderflowError('Not enough values on stack.')
1403 expression = concat(quote, (quote, (S_loop, expression)))
1404 return stack, expression, dictionary
1409 def cmp_(stack, expression, dictionary):
1411 cmp takes two values and three quoted programs on the stack and runs
1412 one of the three depending on the results of comparing the two values:
1416 ------------------------- a > b
1420 ------------------------- a = b
1424 ------------------------- a < b
1427 L, (E, (G, (b, (a, stack)))) = stack
1428 expression = concat(G if a > b else L if a < b else E, expression)
1429 return stack, expression, dictionary
1432 # FunctionWrapper(cleave),
1433 # FunctionWrapper(while_),
1438 #divmod_ = pm = __(n2, n1), __(n4, n3)
1440 BinaryBuiltinWrapper(operator.eq),
1441 BinaryBuiltinWrapper(operator.ge),
1442 BinaryBuiltinWrapper(operator.gt),
1443 BinaryBuiltinWrapper(operator.le),
1444 BinaryBuiltinWrapper(operator.lt),
1445 BinaryBuiltinWrapper(operator.ne),
1447 BinaryBuiltinWrapper(operator.xor),
1448 BinaryBuiltinWrapper(operator.lshift),
1449 BinaryBuiltinWrapper(operator.rshift),
1451 BinaryBuiltinWrapper(operator.and_),
1452 BinaryBuiltinWrapper(operator.or_),
1454 BinaryBuiltinWrapper(operator.add),
1455 BinaryBuiltinWrapper(operator.floordiv),
1456 BinaryBuiltinWrapper(operator.mod),
1457 BinaryBuiltinWrapper(operator.mul),
1458 BinaryBuiltinWrapper(operator.pow),
1459 BinaryBuiltinWrapper(operator.sub),
1460 ## BinaryBuiltinWrapper(operator.truediv),
1462 UnaryBuiltinWrapper(bool),
1463 UnaryBuiltinWrapper(operator.not_),
1465 UnaryBuiltinWrapper(abs),
1466 UnaryBuiltinWrapper(operator.neg),
1467 UnaryBuiltinWrapper(sqrt),
1469 UnaryBuiltinWrapper(floor),
1470 UnaryBuiltinWrapper(round),
1473 del F # Otherwise Sphinx autodoc will pick it up.
1476 for name, primitive in getmembers(genlib, isfunction):
1477 inscribe(SimpleFunctionWrapper(primitive))
1480 add_aliases(_dictionary, ALIASES)
1483 DefinitionWrapper.add_definitions(definitions, _dictionary)