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 logging import getLogger
28 _log = getLogger(__name__)
29 _log.info('Loading library.')
31 from inspect import getdoc
32 from functools import wraps
33 from itertools import count
34 from inspect import getmembers, isfunction
37 from .parser import text_to_expression, Symbol
38 from .utils.stack import expression_to_string, list_to_stack, iter_stack, pick, concat
39 from .utils.brutal_hackery import rename_code_object
41 from .utils import generated_library as genlib
42 from .utils.types import (
64 poly_combinator_effect,
65 doc_from_stack_effect,
69 _SYM_NUMS = count().next
70 _COMB_NUMS = count().next
74 A = a0, a1, a2, a3, a4, a5, a6, a7, a8, a9 = map(AnyJoyType, _R)
75 B = b0, b1, b2, b3, b4, b5, b6, b7, b8, b9 = map(BooleanJoyType, _R)
76 N = n0, n1, n2, n3, n4, n5, n6, n7, n8, n9 = map(NumberJoyType, _R)
77 S = s0, s1, s2, s3, s4, s5, s6, s7, s8, s9 = map(StackJoyType, _R)
78 F = f0, f1, f2, f3, f4, f5, f6, f7, f8, f9 = map(FloatJoyType, _R)
79 I = i0, i1, i2, i3, i4, i5, i6, i7, i8, i9 = map(IntJoyType, _R)
80 T = t0, t1, t2, t3, t4, t5, t6, t7, t8, t9 = map(TextJoyType, _R)
84 As = map(AnyStarJoyType, _R)
85 Ns = map(NumberStarJoyType, _R)
86 Ss = map(StackStarJoyType, _R)
89 sec0 = stack_effect(t1)()
90 sec1 = stack_effect(s0, i1)(s1)
91 sec2 = stack_effect(s0, i1)(a1)
92 sec_binary_cmp = stack_effect(n1, n2)(b1)
93 sec_binary_ints = stack_effect(i1, i2)(i3)
94 sec_binary_logic = stack_effect(b1, b2)(b3)
95 sec_binary_math = stack_effect(n1, n2)(n3)
96 sec_unary_logic = stack_effect(a1)(b1)
97 sec_unary_math = stack_effect(n1)(n2)
98 sec_Ns_math = stack_effect((Ns[1], s1),)(n0)
103 def inscribe(function):
104 '''A decorator to inscribe functions into the default dictionary.'''
105 _dictionary[function.name] = function
110 '''Return a dictionary of Joy functions for use with joy().'''
111 return _dictionary.copy()
117 ('bool', ['truthy']),
119 ('floordiv', ['/floor', '//']),
120 ('floor', ['round']),
122 ('mod', ['%', 'rem', 'remainder', 'modulus']),
125 ('getitem', ['pick', 'at']),
130 ('ne', ['<>', '!=']),
136 ('rolldown', ['roll<']),
137 ('rollup', ['roll>']),
143 def add_aliases(D, A):
145 Given a dict and a iterable of (name, [alias, ...]) pairs, create
146 additional entries in the dict mapping each alias to the named function
147 if it's in the dict. Aliases for functions not in the dict are ignored.
149 for name, aliases in A:
154 for alias in aliases:
160 Return a dict of named stack effects.
162 "Yin" functions are those that only rearrange items in stacks and
163 can be defined completely by their stack effects. This means they
164 can be auto-compiled.
166 # pylint: disable=unused-variable
167 cons = ef(a1, s0)((a1, s0))
168 ccons = compose(cons, cons)
170 dupd = ef(a2, a1)(a2, a2, a1)
171 dupdd = ef(a3, a2, a1)(a3, a3, a2, a1)
172 first = ef((a1, s1),)(a1,)
173 over = ef(a2, a1)(a2, a1, a2)
175 popd = ef(a2, a1,)(a1)
176 popdd = ef(a3, a2, a1,)(a2, a1,)
177 popop = ef(a2, a1,)()
178 popopd = ef(a3, a2, a1,)(a1)
179 popopdd = ef(a4, a3, a2, a1,)(a2, a1)
180 rest = ef((a1, s0),)(s0,)
181 rolldown = ef(a1, a2, a3)(a2, a3, a1)
182 rollup = ef(a1, a2, a3)(a3, a1, a2)
183 rrest = compose(rest, rest)
184 second = compose(rest, first)
186 swaack = (s1, s0), (s0, s1)
187 swap = ef(a1, a2)(a2, a1)
188 swons = compose(swap, cons)
189 third = compose(rest, second)
190 tuck = ef(a2, a1)(a1, a2, a1)
191 uncons = ef((a1, s0),)(a1, s0)
192 unswons = compose(uncons, swap)
193 stuncons = compose(stack, uncons)
194 stununcons = compose(stack, uncons, uncons)
195 unit = ef(a1)((a1, ()))
197 first_two = compose(uncons, uncons, pop)
198 fourth = compose(rest, third)
200 _Tree_add_Ee = compose(pop, swap, rolldown, rrest, ccons)
201 _Tree_get_E = compose(popop, second)
202 _Tree_delete_clear_stuff = compose(rollup, popop, rest)
203 _Tree_delete_R0 = compose(over, first, swap, dup)
210 product == 1 swap [*] step
211 flatten == [] swap [concat] step
214 enstacken == stack [clear] dip
216 disenstacken == ? [uncons ?] loop pop
217 dinfrirst == dip infra first
218 nullary == [stack] dinfrirst
219 unary == nullary popd
220 binary == nullary [popop] dip
221 ternary == unary [popop] dip
225 size == 0 swap [pop ++] step
227 cleave == fork [popd] dip
228 average == [sum 1.0 *] [size] cleave /
229 gcd == 1 [tuck modulus dup 0 >] loop pop
230 least_fraction == dup [gcd] infra [div] concat map
231 *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
232 *fraction0 == concat [[swap] dip * [*] dip] infra
233 down_to_zero == [0 >] [dup --] while
234 range_to_zero == unit [down_to_zero] infra
235 anamorphism == [pop []] swap [dip swons] genrec
236 range == [0 <=] [1 - dup] anamorphism
237 while == swap [nullary] cons dup dipd concat loop
239 primrec == [i] genrec
240 step_zero == 0 roll> step
241 codireco == cons dip rest cons
242 make_generator == [codireco] ccons
243 ifte == [nullary not] dipd branch
247 # ifte == [nullary] dipd swap branch
248 # genrec == [[genrec] cons cons cons cons] nullary swons concat ifte
250 # Another definition for while. FWIW
251 # while == over [[i] dip nullary] ccons [nullary] dip loop
255 ##second == rest first
256 ##third == rest rest first
258 ##swoncat == swap concat
261 ##z-down == [] swap uncons swap
262 ##z-up == swons swap shunt
263 ##z-right == [swons] cons dip uncons swap
264 ##z-left == swons [uncons swap] dip swap
267 ##divisor == popop 2 *
269 ##radical == swap dup * rollup * 4 * - sqrt
272 ##q0 == [[divisor] [minusb] [radical]] pam
273 ##q1 == [[root1] [root2]] pam
274 ##quadratic == [q0] ternary i [q1] ternary
278 ##PE1.1 == + dup [+] dip
279 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
280 ##PE1.3 == 14811 swap [PE1.2] times pop
281 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
283 #PE1.2 == [PE1.1] step
284 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
288 def FunctionWrapper(f):
289 '''Set name attribute.'''
291 raise ValueError('Function %s must have doc string.' % f.__name__)
292 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
296 def SimpleFunctionWrapper(f):
298 Wrap functions that take and return just a stack.
302 @rename_code_object(f.__name__)
303 def inner(stack, expression, dictionary):
304 return f(stack), expression, dictionary
308 def BinaryBuiltinWrapper(f):
310 Wrap functions that take two arguments and return a single result.
314 @rename_code_object(f.__name__)
315 def inner(stack, expression, dictionary):
316 (a, (b, stack)) = stack
318 return (result, stack), expression, dictionary
322 def UnaryBuiltinWrapper(f):
324 Wrap functions that take one argument and return a single result.
328 @rename_code_object(f.__name__)
329 def inner(stack, expression, dictionary):
332 return (result, stack), expression, dictionary
336 class DefinitionWrapper(object):
338 Provide implementation of defined functions, and some helper methods.
341 def __init__(self, name, body_text, doc=None):
342 self.name = self.__name__ = name
343 self.body = text_to_expression(body_text)
344 self._body = tuple(iter_stack(self.body))
345 self.__doc__ = doc or body_text
346 self._compiled = None
348 def __call__(self, stack, expression, dictionary):
350 return self._compiled(stack, expression, dictionary) # pylint: disable=E1102
351 expression = list_to_stack(self._body, expression)
352 return stack, expression, dictionary
355 def parse_definition(class_, defi):
357 Given some text describing a Joy function definition parse it and
358 return a DefinitionWrapper.
360 name, proper, body_text = (n.strip() for n in defi.partition('=='))
362 raise ValueError('Definition %r failed' % (defi,))
363 return class_(name, body_text)
366 def add_definitions(class_, defs, dictionary):
368 Scan multi-line string defs for definitions and add them to the
371 for definition in _text_to_defs(defs):
372 class_.add_def(definition, dictionary)
375 def add_def(class_, definition, dictionary, fail_fails=False):
377 Add the definition to the dictionary.
379 F = class_.parse_definition(definition)
380 _log.info('Adding definition %s := %s', F.name, expression_to_string(F.body))
381 dictionary[F.name] = F
384 def load_definitions(class_, filename, dictionary):
385 with open(filename) as f:
386 lines = [line for line in f if '==' in line]
388 class_.add_def(line, dictionary)
391 def _text_to_defs(text):
392 return (line.strip() for line in text.splitlines() if '==' in line)
403 def inscribe_(stack, expression, dictionary):
405 Create a new Joy function definition in the Joy dictionary. A
406 definition is given as a string with a name followed by a double
407 equal sign then one or more Joy functions, the body. for example:
411 If you want the definition to persist over restarts, enter it into
412 the definitions.txt resource.
414 definition, stack = stack
415 DefinitionWrapper.add_def(definition, dictionary, fail_fails=True)
416 return stack, expression, dictionary
420 @SimpleFunctionWrapper
422 '''Parse the string on the stack to a Joy expression.'''
424 expression = text_to_expression(text)
425 return expression, stack
430 @SimpleFunctionWrapper
435 getitem == drop first
437 Expects an integer and a quote on the stack and returns the item at the
438 nth position in the quote counting from 0.
442 -------------------------
446 n, (Q, stack) = stack
447 return pick(Q, n), stack
452 @SimpleFunctionWrapper
459 Expects an integer and a quote on the stack and returns the quote with
460 n items removed off the top.
464 ----------------------
468 n, (Q, stack) = stack
480 @SimpleFunctionWrapper
483 Expects an integer and a quote on the stack and returns the quote with
484 just the top n items in reverse order (because that's easier and you can
485 use reverse if needed.)
489 ----------------------
493 n, (Q, stack) = stack
506 @SimpleFunctionWrapper
509 Use a Boolean value to select one of two items.
513 ----------------------
518 ---------------------
521 Currently Python semantics are used to evaluate the "truthiness" of the
522 Boolean value (so empty string, zero, etc. are counted as false, etc.)
524 (if_, (then, (else_, stack))) = stack
525 return then if if_ else else_, stack
529 @SimpleFunctionWrapper
532 Use a Boolean value to select one of two items from a sequence.
536 ------------------------
541 -----------------------
544 The sequence can contain more than two items but not fewer.
545 Currently Python semantics are used to evaluate the "truthiness" of the
546 Boolean value (so empty string, zero, etc. are counted as false, etc.)
548 (flag, (choices, stack)) = stack
549 (else_, (then, _)) = choices
550 return then if flag else else_, stack
555 @SimpleFunctionWrapper
557 '''Given a list find the maximum.'''
559 return max(iter_stack(tos)), stack
564 @SimpleFunctionWrapper
566 '''Given a list find the minimum.'''
568 return min(iter_stack(tos)), stack
573 @SimpleFunctionWrapper
575 '''Given a quoted sequence of numbers return the sum.
577 sum == 0 swap [+] step
580 return sum(iter_stack(tos)), stack
584 @SimpleFunctionWrapper
587 Expects an item on the stack and a quote under it and removes that item
588 from the the quote. The item is only removed once.
592 ------------------------
596 (tos, (second, stack)) = S
597 l = list(iter_stack(second))
599 return list_to_stack(l), stack
603 @SimpleFunctionWrapper
605 '''Given a list remove duplicate items.'''
607 I = list(iter_stack(tos))
608 list_to_stack(sorted(set(I), key=I.index))
609 return list_to_stack(sorted(set(I), key=I.index)), stack
613 @SimpleFunctionWrapper
615 '''Given a list return it sorted.'''
617 return list_to_stack(sorted(iter_stack(tos))), stack
620 _functions['clear'] = s0, s1
622 @SimpleFunctionWrapper
624 '''Clear everything from the stack.
627 clear == stack [pop stack] loop
637 @SimpleFunctionWrapper
640 The unstack operator expects a list on top of the stack and makes that
641 the stack discarding the rest of the stack.
647 @SimpleFunctionWrapper
649 '''Reverse the list on the top of the stack.
652 reverse == [] swap shunt
656 for term in iter_stack(tos):
662 @combinator_effect(_COMB_NUMS(), s7, s6)
663 @SimpleFunctionWrapper
665 '''Concatinate the two lists on the top of the stack.
668 [a b c] [d e f] concat
669 ----------------------------
673 (tos, (second, stack)) = S
674 return concat(second, tos), stack
678 @SimpleFunctionWrapper
680 '''Like concat but reverses the top list into the second.
683 shunt == [swons] step == reverse swap concat
685 [a b c] [d e f] shunt
686 ---------------------------
690 (tos, (second, stack)) = stack
693 second = term, second
698 @SimpleFunctionWrapper
701 Replace the two lists on the top of the stack with a list of the pairs
702 from each list. The smallest list sets the length of the result list.
704 (tos, (second, stack)) = S
707 for a, b in zip(iter_stack(tos), iter_stack(second))
709 return list_to_stack(accumulator), stack
714 @SimpleFunctionWrapper
718 return tos + 1, stack
723 @SimpleFunctionWrapper
727 return tos - 1, stack
731 @SimpleFunctionWrapper
742 a, (b, stack) = stack
748 return int(math.floor(n))
750 floor.__doc__ = math.floor.__doc__
754 @SimpleFunctionWrapper
757 divmod(x, y) -> (quotient, remainder)
759 Return the tuple (x//y, x%y). Invariant: div*y + mod == x.
768 Return the square root of the number a.
769 Negative numbers return complex roots.
774 assert a < 0, repr(a)
775 r = math.sqrt(-a) * 1j
781 # if isinstance(text, str):
782 # return run(text, stack)
787 @SimpleFunctionWrapper
789 '''The identity function.'''
794 @SimpleFunctionWrapper
796 '''True if the form on TOS is void otherwise False.'''
798 return _void(form), stack
802 return any(not _void(i) for i in iter_stack(form))
813 def words(stack, expression, dictionary):
814 '''Print all the words in alphabetical order.'''
815 print(' '.join(sorted(dictionary)))
816 return stack, expression, dictionary
821 def sharing(stack, expression, dictionary):
822 '''Print redistribution information.'''
823 print("You may convey verbatim copies of the Program's source code as"
824 ' you receive it, in any medium, provided that you conspicuously'
825 ' and appropriately publish on each copy an appropriate copyright'
826 ' notice; keep intact all notices stating that this License and'
827 ' any non-permissive terms added in accord with section 7 apply'
828 ' to the code; keep intact all notices of the absence of any'
829 ' warranty; and give all recipients a copy of this License along'
831 ' You should have received a copy of the GNU General Public License'
832 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
833 return stack, expression, dictionary
838 def warranty(stack, expression, dictionary):
839 '''Print warranty information.'''
840 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
841 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
842 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
843 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
844 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
845 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
846 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
847 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
848 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
849 return stack, expression, dictionary
852 # def simple_manual(stack):
854 # Print words and help for each word.
856 # for name, f in sorted(FUNCTIONS.items()):
858 # boxline = '+%s+' % ('-' * (len(name) + 2))
861 # '| %s |' % (name,),
863 # d if d else ' ...',
873 def help_(S, expression, dictionary):
874 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
875 ((symbol, _), stack) = S
876 word = dictionary[symbol]
878 return stack, expression, dictionary
886 # Several combinators depend on other words in their definitions,
887 # we use symbols to prevent hard-coding these, so in theory, you
888 # could change the word in the dictionary to use different semantics.
889 S_choice = Symbol('choice')
890 S_first = Symbol('first')
891 S_getitem = Symbol('getitem')
892 S_genrec = Symbol('genrec')
893 S_loop = Symbol('loop')
895 S_ifte = Symbol('ifte')
896 S_infra = Symbol('infra')
897 S_pop = Symbol('pop')
898 S_step = Symbol('step')
899 S_times = Symbol('times')
900 S_swaack = Symbol('swaack')
901 S_truthy = Symbol('truthy')
905 @combinator_effect(_COMB_NUMS(), s1)
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, concat(quote, expression), dictionary
923 @combinator_effect(_COMB_NUMS(), s1)
925 def x(stack, expression, dictionary):
931 ... [Q] x = ... [Q] dup i
932 ... [Q] x = ... [Q] [Q] i
933 ... [Q] x = ... [Q] Q
937 return stack, concat(quote, expression), dictionary
941 @combinator_effect(_COMB_NUMS(), s7, s6)
943 def b(stack, expression, dictionary):
949 ... [P] [Q] b == ... [P] i [Q] i
950 ... [P] [Q] b == ... P Q
953 q, (p, (stack)) = stack
954 return stack, concat(p, concat(q, expression)), dictionary
958 @combinator_effect(_COMB_NUMS(), a1, s1)
960 def dupdip(stack, expression, dictionary):
964 [F] dupdip == dup [F] dip
974 return stack, concat(F, (a, expression)), dictionary
978 @combinator_effect(_COMB_NUMS(), s7, s6)
980 def infra(stack, expression, dictionary):
982 Accept a quoted program and a list on the stack and run the program
983 with the list as its stack.
986 ... [a b c] [Q] . infra
987 -----------------------------
988 c b a . Q [...] swaack
991 (quote, (aggregate, stack)) = stack
992 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
996 #@combinator_effect(_COMB_NUMS(), s7, s6, s5, s4)
998 def genrec(stack, expression, dictionary):
1000 General Recursion Combinator.
1003 [if] [then] [rec1] [rec2] genrec
1004 ---------------------------------------------------------------------
1005 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
1007 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
1008 "The genrec combinator takes four program parameters in addition to
1009 whatever data parameters it needs. Fourth from the top is an if-part,
1010 followed by a then-part. If the if-part yields true, then the then-part
1011 is executed and the combinator terminates. The other two parameters are
1012 the rec1-part and the rec2-part. If the if-part yields false, the
1013 rec1-part is executed. Following that the four program parameters and
1014 the combinator are again pushed onto the stack bundled up in a quoted
1015 form. Then the rec2-part is executed, where it will find the bundled
1016 form. Typically it will then execute the bundled form, either with i or
1017 with app2, or some other combinator."
1019 The way to design one of these is to fix your base case [then] and the
1020 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
1021 a quotation of the whole function.
1023 For example, given a (general recursive) function 'F':
1026 F == [I] [T] [R1] [R2] genrec
1028 If the [I] if-part fails you must derive R1 and R2 from:
1033 Just set the stack arguments in front, and figure out what R1 and R2
1034 have to do to apply the quoted [F] in the proper way. In effect, the
1035 genrec combinator turns into an ifte combinator with a quoted copy of
1036 the original definition in the else-part:
1039 F == [I] [T] [R1] [R2] genrec
1040 == [I] [T] [R1 [F] R2] ifte
1042 Primitive recursive functions are those where R2 == i.
1045 P == [I] [T] [R] primrec
1046 == [I] [T] [R [P] i] ifte
1047 == [I] [T] [R P] ifte
1050 (rec2, (rec1, stack)) = stack
1051 (then, (if_, _)) = stack
1052 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
1053 else_ = concat(rec1, (F, rec2))
1054 return (else_, stack), (S_ifte, expression), dictionary
1058 @combinator_effect(_COMB_NUMS(), s7, s6)
1060 def map_(S, expression, dictionary):
1062 Run the quoted program on TOS on the items in the list under it, push a
1063 new list with the results (in place of the program and original list.
1065 # (quote, (aggregate, stack)) = S
1066 # results = list_to_stack([
1067 # joy((term, stack), quote, dictionary)[0][0]
1068 # for term in iter_stack(aggregate)
1070 # return (results, stack), expression, dictionary
1071 (quote, (aggregate, stack)) = S
1073 return (aggregate, stack), expression, dictionary
1075 for term in iter_stack(aggregate):
1077 batch = (s, (quote, (S_infra, (S_first, batch))))
1078 stack = (batch, ((), stack))
1079 return stack, (S_infra, expression), dictionary
1082 #def cleave(S, expression, dictionary):
1084 # The cleave combinator expects two quotations, and below that an item X.
1085 # It first executes [P], with X on top, and saves the top result element.
1086 # Then it executes [Q], again with X, and saves the top result.
1087 # Finally it restores the stack to what it was below X and pushes the two
1088 # results P(X) and Q(X).
1090 # (Q, (P, (x, stack))) = S
1091 # p = joy((x, stack), P, dictionary)[0][0]
1092 # q = joy((x, stack), Q, dictionary)[0][0]
1093 # return (q, (p, stack)), expression, dictionary
1096 def branch_true(stack, expression, dictionary):
1097 # pylint: disable=unused-variable
1098 (then, (else_, (flag, stack))) = stack
1099 return stack, concat(then, expression), dictionary
1102 def branch_false(stack, expression, dictionary):
1103 # pylint: disable=unused-variable
1104 (then, (else_, (flag, stack))) = stack
1105 return stack, concat(else_, expression), dictionary
1109 @poly_combinator_effect(_COMB_NUMS(), [branch_true, branch_false], b1, s7, s6)
1111 def branch(stack, expression, dictionary):
1113 Use a Boolean value to select one of two quoted programs to run.
1117 branch == roll< choice i
1121 False [F] [T] branch
1122 --------------------------
1126 -------------------------
1130 (then, (else_, (flag, stack))) = stack
1131 return stack, concat(then if flag else else_, expression), dictionary
1134 #FUNCTIONS['branch'] = CombinatorJoyType('branch', [branch_true, branch_false], 100)
1139 ##def ifte(stack, expression, dictionary):
1141 ## If-Then-Else Combinator
1144 ## ... [if] [then] [else] ifte
1145 ## ---------------------------------------------------
1146 ## ... [[else] [then]] [...] [if] infra select i
1151 ## ... [if] [then] [else] ifte
1152 ## -------------------------------------------------------
1153 ## ... [else] [then] [...] [if] infra first choice i
1156 ## Has the effect of grabbing a copy of the stack on which to run the
1157 ## if-part using infra.
1159 ## (else_, (then, (if_, stack))) = stack
1160 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1161 ## stack = (if_, (stack, (then, (else_, stack))))
1162 ## return stack, expression, dictionary
1167 def cond(stack, expression, dictionary):
1169 This combinator works like a case statement. It expects a single quote
1170 on the stack that must contain zero or more condition quotes and a
1171 default quote. Each condition clause should contain a quoted predicate
1172 followed by the function expression to run if that predicate returns
1173 true. If no predicates return true the default function runs.
1175 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1177 [[[B0] T0] [[B1] T1] [D]] cond
1178 -----------------------------------------
1179 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1182 conditions, stack = stack
1184 expression = _cond(conditions, expression)
1186 # Attempt to preload the args to first ifte.
1187 (P, (T, (E, expression))) = expression
1189 # If, for any reason, the argument to cond should happen to contain
1190 # only the default clause then this optimization will fail.
1193 stack = (E, (T, (P, stack)))
1194 return stack, expression, dictionary
1197 def _cond(conditions, expression):
1198 (clause, rest) = conditions
1199 if not rest: # clause is [D]
1202 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1206 @combinator_effect(_COMB_NUMS(), a1, s1)
1208 def dip(stack, expression, dictionary):
1210 The dip combinator expects a quoted program on the stack and below it
1211 some item, it hoists the item into the expression and runs the program
1212 on the rest of the stack.
1220 (quote, (x, stack)) = stack
1221 expression = (x, expression)
1222 return stack, concat(quote, expression), dictionary
1226 @combinator_effect(_COMB_NUMS(), a2, a1, s1)
1228 def dipd(S, expression, dictionary):
1230 Like dip but expects two items.
1234 ---------------------
1238 (quote, (x, (y, stack))) = S
1239 expression = (y, (x, expression))
1240 return stack, concat(quote, expression), dictionary
1244 @combinator_effect(_COMB_NUMS(), a3, a2, a1, s1)
1246 def dipdd(S, expression, dictionary):
1248 Like dip but expects three items.
1252 -----------------------
1256 (quote, (x, (y, (z, stack)))) = S
1257 expression = (z, (y, (x, expression)))
1258 return stack, concat(quote, expression), dictionary
1262 @combinator_effect(_COMB_NUMS(), a1, s1)
1264 def app1(S, expression, dictionary):
1266 Given a quoted program on TOS and anything as the second stack item run
1267 the program and replace the two args with the first result of the
1272 -----------------------------------
1273 ... [x ...] [Q] . infra first
1275 (quote, (x, stack)) = S
1276 stack = (quote, ((x, stack), stack))
1277 expression = (S_infra, (S_first, expression))
1278 return stack, expression, dictionary
1282 @combinator_effect(_COMB_NUMS(), a2, a1, s1)
1284 def app2(S, expression, dictionary):
1285 '''Like app1 with two items.
1289 -----------------------------------
1290 ... [y ...] [Q] . infra first
1291 [x ...] [Q] infra first
1294 (quote, (x, (y, stack))) = S
1295 expression = (S_infra, (S_first,
1296 ((x, stack), (quote, (S_infra, (S_first,
1298 stack = (quote, ((y, stack), stack))
1299 return stack, expression, dictionary
1303 @combinator_effect(_COMB_NUMS(), a3, a2, a1, s1)
1305 def app3(S, expression, dictionary):
1306 '''Like app1 with three items.
1309 ... z y x [Q] . app3
1310 -----------------------------------
1311 ... [z ...] [Q] . infra first
1312 [y ...] [Q] infra first
1313 [x ...] [Q] infra first
1316 (quote, (x, (y, (z, stack)))) = S
1317 expression = (S_infra, (S_first,
1318 ((y, stack), (quote, (S_infra, (S_first,
1319 ((x, stack), (quote, (S_infra, (S_first,
1320 expression))))))))))
1321 stack = (quote, ((z, stack), stack))
1322 return stack, expression, dictionary
1326 @combinator_effect(_COMB_NUMS(), s7, s6)
1328 def step(S, expression, dictionary):
1330 Run a quoted program on each item in a sequence.
1334 -----------------------
1339 ------------------------
1343 ... [a b c] [Q] . step
1344 ----------------------------------------
1345 ... a . Q [b c] [Q] step
1347 The step combinator executes the quotation on each member of the list
1348 on top of the stack.
1350 (quote, (aggregate, stack)) = S
1352 return stack, expression, dictionary
1353 head, tail = aggregate
1354 stack = quote, (head, stack)
1356 expression = tail, (quote, (S_step, expression))
1357 expression = S_i, expression
1358 return stack, expression, dictionary
1362 @combinator_effect(_COMB_NUMS(), i1, s6)
1364 def times(stack, expression, dictionary):
1366 times == [-- dip] cons [swap] infra [0 >] swap while pop
1370 --------------------- w/ n <= 0
1375 ---------------------------------
1380 --------------------------------- w/ n > 1
1381 ... . Q (n - 1) [Q] times
1384 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1385 (quote, (n, stack)) = stack
1387 return stack, expression, dictionary
1390 expression = n, (quote, (S_times, expression))
1391 expression = concat(quote, expression)
1392 return stack, expression, dictionary
1395 # The current definition above works like this:
1398 # --------------------------------------
1399 # [P] nullary [Q [P] nullary] loop
1401 # while == [pop i not] [popop] [dudipd] primrec
1403 #def while_(S, expression, dictionary):
1404 # '''[if] [body] while'''
1405 # (body, (if_, stack)) = S
1406 # while joy(stack, if_, dictionary)[0][0]:
1407 # stack = joy(stack, body, dictionary)[0]
1408 # return stack, expression, dictionary
1411 def loop_true(stack, expression, dictionary):
1412 quote, (flag, stack) = stack # pylint: disable=unused-variable
1413 return stack, concat(quote, (S_pop, expression)), dictionary
1415 def loop_two_true(stack, expression, dictionary):
1416 quote, (flag, stack) = stack # pylint: disable=unused-variable
1417 return stack, concat(quote, (S_pop, concat(quote, (S_pop, expression)))), dictionary
1419 def loop_false(stack, expression, dictionary):
1420 quote, (flag, stack) = stack # pylint: disable=unused-variable
1421 return stack, expression, dictionary
1425 @poly_combinator_effect(_COMB_NUMS(), [loop_two_true, loop_true, loop_false], b1, s6)
1427 def loop(stack, expression, dictionary):
1429 Basic loop combinator.
1433 -----------------------
1437 ------------------------
1441 quote, (flag, stack) = stack
1443 expression = concat(quote, (quote, (S_loop, expression)))
1444 return stack, expression, dictionary
1448 @combinator_effect(_COMB_NUMS(), a1, a2, s6, s7, s8)
1450 def cmp_(stack, expression, dictionary):
1452 cmp takes two values and three quoted programs on the stack and runs
1453 one of the three depending on the results of comparing the two values:
1457 ------------------------- a > b
1461 ------------------------- a = b
1465 ------------------------- a < b
1468 L, (E, (G, (b, (a, stack)))) = stack
1469 expression = concat(G if a > b else L if a < b else E, expression)
1470 return stack, expression, dictionary
1473 # FunctionWrapper(cleave),
1474 # FunctionWrapper(while_),
1479 #divmod_ = pm = __(n2, n1), __(n4, n3)
1481 sec_binary_cmp(BinaryBuiltinWrapper(operator.eq)),
1482 sec_binary_cmp(BinaryBuiltinWrapper(operator.ge)),
1483 sec_binary_cmp(BinaryBuiltinWrapper(operator.gt)),
1484 sec_binary_cmp(BinaryBuiltinWrapper(operator.le)),
1485 sec_binary_cmp(BinaryBuiltinWrapper(operator.lt)),
1486 sec_binary_cmp(BinaryBuiltinWrapper(operator.ne)),
1488 sec_binary_ints(BinaryBuiltinWrapper(operator.xor)),
1489 sec_binary_ints(BinaryBuiltinWrapper(operator.lshift)),
1490 sec_binary_ints(BinaryBuiltinWrapper(operator.rshift)),
1492 sec_binary_logic(BinaryBuiltinWrapper(operator.and_)),
1493 sec_binary_logic(BinaryBuiltinWrapper(operator.or_)),
1495 sec_binary_math(BinaryBuiltinWrapper(operator.add)),
1496 sec_binary_math(BinaryBuiltinWrapper(operator.floordiv)),
1497 sec_binary_math(BinaryBuiltinWrapper(operator.mod)),
1498 sec_binary_math(BinaryBuiltinWrapper(operator.mul)),
1499 sec_binary_math(BinaryBuiltinWrapper(operator.pow)),
1500 sec_binary_math(BinaryBuiltinWrapper(operator.sub)),
1501 sec_binary_math(BinaryBuiltinWrapper(operator.truediv)),
1503 sec_unary_logic(UnaryBuiltinWrapper(bool)),
1504 sec_unary_logic(UnaryBuiltinWrapper(operator.not_)),
1506 sec_unary_math(UnaryBuiltinWrapper(abs)),
1507 sec_unary_math(UnaryBuiltinWrapper(operator.neg)),
1508 sec_unary_math(UnaryBuiltinWrapper(sqrt)),
1510 stack_effect(n1)(i1)(UnaryBuiltinWrapper(floor)),
1513 del F # Otherwise Sphinx autodoc will pick it up.
1516 YIN_STACK_EFFECTS = yin_functions()
1518 # Load the auto-generated primitives into the dictionary.
1519 _functions.update(YIN_STACK_EFFECTS)
1522 # eh = compose(dup, bool)
1523 # sqr = compose(dup, mul)
1524 # of = compose(swap, at)
1526 # ''' in dict(compose=compose), _functions
1527 for name in sorted(_functions):
1528 sec = _functions[name]
1529 F = FUNCTIONS[name] = SymbolJoyType(name, [sec], _SYM_NUMS())
1530 if name in YIN_STACK_EFFECTS:
1531 _log.info('Setting stack effect for Yin function %s := %s', F.name, doc_from_stack_effect(*sec))
1533 for name, primitive in getmembers(genlib, isfunction):
1534 inscribe(SimpleFunctionWrapper(primitive))
1537 add_aliases(_dictionary, ALIASES)
1538 add_aliases(_functions, ALIASES)
1539 add_aliases(FUNCTIONS, ALIASES)
1542 DefinitionWrapper.add_definitions(definitions, _dictionary)
1545 EXPECTATIONS = dict(
1546 ifte=(s7, (s6, (s5, s4))),
1550 EXPECTATIONS['while'] = (s7, (s6, s5))
1561 C = _dictionary[name]
1562 expect = EXPECTATIONS.get(name)
1564 sec = doc_from_stack_effect(expect)
1565 _log.info('Setting stack EXPECT for combinator %s := %s', C.name, sec)
1567 _log.info('combinator %s', C.name)
1568 FUNCTIONS[name] = CombinatorJoyType(name, [C], _COMB_NUMS(), expect)
1572 of quoted enstacken ?
1573 unary binary ternary
1576 of_ = _dictionary[name]
1577 secs = infer_expression(of_.body)
1578 assert len(secs) == 1, repr(secs)
1580 'Setting stack effect for definition %s := %s',
1582 doc_from_stack_effect(*secs[0]),
1584 FUNCTIONS[name] = SymbolJoyType(name, infer_expression(of_.body), _SYM_NUMS())
1587 #sec_Ns_math(_dictionary['product'])
1589 ## product == 1 swap [*] step
1590 ## flatten == [] swap [concat] step
1591 ## disenstacken == ? [uncons ?] loop pop
1593 ## size == 0 swap [pop ++] step
1595 ## cleave == fork [popd] dip
1596 ## average == [sum 1.0 *] [size] cleave /
1597 ## gcd == 1 [tuck modulus dup 0 >] loop pop
1598 ## least_fraction == dup [gcd] infra [div] concat map
1599 ## *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
1600 ## *fraction0 == concat [[swap] dip * [*] dip] infra
1601 ## down_to_zero == [0 >] [dup --] while
1602 ## range_to_zero == unit [down_to_zero] infra
1603 ## anamorphism == [pop []] swap [dip swons] genrec
1604 ## range == [0 <=] [1 - dup] anamorphism
1605 ## while == swap [nullary] cons dup dipd concat loop
1606 ## dupdipd == dup dipd
1607 ## primrec == [i] genrec
1608 ## step_zero == 0 roll> step
1609 ## codireco == cons dip rest cons
1610 ## make_generator == [codireco] ccons
1611 ## ifte == [nullary not] dipd branch