1 # -*- coding: utf-8 -*-
3 # Copyright © 2014, 2015, 2017, 2018 Simon Forman
5 # This file is part of Thun
7 # Thun is free software: you can redistribute it and/or modify
8 # it under the terms of the GNU General Public License as published by
9 # the Free Software Foundation, either version 3 of the License, or
10 # (at your option) any later version.
12 # Thun is distributed in the hope that it will be useful,
13 # but WITHOUT ANY WARRANTY; without even the implied warranty of
14 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 # GNU General Public License for more details.
17 # You should have received a copy of the GNU General Public License
18 # along with Thun. If not see <http://www.gnu.org/licenses/>.
21 This module contains the Joy function infrastructure and a library of
22 functions. Its main export is a Python function initialize() that
23 returns a dictionary of Joy functions suitable for use with the joy()
26 from inspect import getdoc
27 from functools import wraps
28 from itertools import count
29 from inspect import getmembers, isfunction
32 from .parser import text_to_expression, Symbol
33 from .utils.stack import expression_to_string, list_to_stack, iter_stack, pick, concat
34 from .utils.brutal_hackery import rename_code_object
36 from .utils import generated_library as genlib
37 from .utils.types import (
57 poly_combinator_effect,
61 _SYM_NUMS = count().next
62 _COMB_NUMS = count().next
66 A = a0, a1, a2, a3, a4, a5, a6, a7, a8, a9 = map(AnyJoyType, _R)
67 B = b0, b1, b2, b3, b4, b5, b6, b7, b8, b9 = map(BooleanJoyType, _R)
68 N = n0, n1, n2, n3, n4, n5, n6, n7, n8, n9 = map(NumberJoyType, _R)
69 S = s0, s1, s2, s3, s4, s5, s6, s7, s8, s9 = map(StackJoyType, _R)
70 F = f0, f1, f2, f3, f4, f5, f6, f7, f8, f9 = map(FloatJoyType, _R)
71 I = i0, i1, i2, i3, i4, i5, i6, i7, i8, i9 = map(IntJoyType, _R)
72 T = t0, t1, t2, t3, t4, t5, t6, t7, t8, t9 = map(TextJoyType, _R)
76 As = map(AnyStarJoyType, _R)
77 Ns = map(NumberStarJoyType, _R)
78 Ss = map(StackStarJoyType, _R)
81 sec0 = stack_effect(t1)()
82 sec1 = stack_effect(s0, i1)(s1)
83 sec2 = stack_effect(s0, i1)(a1)
84 sec_binary_cmp = stack_effect(n1, n2)(b1)
85 sec_binary_ints = stack_effect(i1, i2)(i3)
86 sec_binary_logic = stack_effect(b1, b2)(b3)
87 sec_binary_math = stack_effect(n1, n2)(n3)
88 sec_unary_logic = stack_effect(a1)(b1)
89 sec_unary_math = stack_effect(n1)(n2)
90 sec_Ns_math = stack_effect((Ns[1], s1),)(n0)
95 def inscribe(function):
96 '''A decorator to inscribe functions into the default dictionary.'''
97 _dictionary[function.name] = function
102 '''Return a dictionary of Joy functions for use with joy().'''
103 return _dictionary.copy()
109 ('bool', ['truthy']),
111 ('floordiv', ['/floor', '//']),
112 ('floor', ['round']),
114 ('mod', ['%', 'rem', 'remainder', 'modulus']),
117 ('getitem', ['pick', 'at']),
122 ('ne', ['<>', '!=']),
128 ('rolldown', ['roll<']),
129 ('rollup', ['roll>']),
135 def add_aliases(D, A):
137 Given a dict and a iterable of (name, [alias, ...]) pairs, create
138 additional entries in the dict mapping each alias to the named function
139 if it's in the dict. Aliases for functions not in the dict are ignored.
141 for name, aliases in A:
146 for alias in aliases:
152 Return a dict of named stack effects.
154 "Yin" functions are those that only rearrange items in stacks and
155 can be defined completely by their stack effects. This means they
156 can be auto-compiled.
158 cons = ef(a1, s0)((a1, s0))
159 ccons = compose(cons, cons)
161 dupd = ef(a2, a1)(a2, a2, a1)
162 dupdd = ef(a3, a2, a1)(a3, a3, a2, a1)
163 first = ef((a1, s1),)(a1,)
164 over = ef(a2, a1)(a2, a1, a2)
166 popd = ef(a2, a1,)(a1)
167 popdd = ef(a3, a2, a1,)(a2, a1,)
168 popop = ef(a2, a1,)()
169 popopd = ef(a3, a2, a1,)(a1)
170 popopdd = ef(a4, a3, a2, a1,)(a2, a1)
171 rest = ef((a1, s0),)(s0,)
172 rolldown = ef(a1, a2, a3)(a2, a3, a1)
173 rollup = ef(a1, a2, a3)(a3, a1, a2)
174 rrest = compose(rest, rest)
175 second = compose(rest, first)
177 swaack = (s1, s0), (s0, s1)
178 swap = ef(a1, a2)(a2, a1)
179 swons = compose(swap, cons)
180 third = compose(rest, second)
181 tuck = ef(a2, a1)(a1, a2, a1)
182 uncons = ef((a1, s0),)(a1, s0)
183 unswons = compose(uncons, swap)
184 stuncons = compose(stack, uncons)
185 stununcons = compose(stack, uncons, uncons)
186 unit = ef(a1)((a1, ()))
188 first_two = compose(uncons, uncons, pop)
189 fourth = compose(rest, third)
191 _Tree_add_Ee = compose(pop, swap, rolldown, rrest, ccons)
192 _Tree_get_E = compose(popop, second)
193 _Tree_delete_clear_stuff = compose(rollup, popop, rest)
194 _Tree_delete_R0 = compose(over, first, swap, dup)
197 name.rstrip('_'): stack_effect
198 for name, stack_effect in locals().iteritems()
204 product == 1 swap [*] step
205 flatten == [] swap [concat] step
208 enstacken == stack [clear] dip
209 disenstacken == ? [uncons ?] loop pop
211 dinfrirst == dip infra first
212 nullary == [stack] dinfrirst
213 unary == nullary popd
214 binary == nullary [popop] dip
215 ternary == unary [popop] dip
219 size == 0 swap [pop ++] step
221 cleave == fork [popd] dip
222 average == [sum 1.0 *] [size] cleave /
223 gcd == 1 [tuck modulus dup 0 >] loop pop
224 least_fraction == dup [gcd] infra [div] concat map
225 *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
226 *fraction0 == concat [[swap] dip * [*] dip] infra
227 down_to_zero == [0 >] [dup --] while
228 range_to_zero == unit [down_to_zero] infra
229 anamorphism == [pop []] swap [dip swons] genrec
230 range == [0 <=] [1 - dup] anamorphism
231 while == swap [nullary] cons dup dipd concat loop
233 primrec == [i] genrec
234 step_zero == 0 roll> step
235 codireco == cons dip rest cons
236 make_generator == [codireco] ccons
237 ifte == [nullary not] dipd branch
240 # ifte == [nullary] dipd swap branch
241 # genrec == [[genrec] cons cons cons cons] nullary swons concat ifte
243 # Another definition for while. FWIW
244 # while == over [[i] dip nullary] ccons [nullary] dip loop
248 ##second == rest first
249 ##third == rest rest first
251 ##swoncat == swap concat
254 ##z-down == [] swap uncons swap
255 ##z-up == swons swap shunt
256 ##z-right == [swons] cons dip uncons swap
257 ##z-left == swons [uncons swap] dip swap
260 ##divisor == popop 2 *
262 ##radical == swap dup * rollup * 4 * - sqrt
265 ##q0 == [[divisor] [minusb] [radical]] pam
266 ##q1 == [[root1] [root2]] pam
267 ##quadratic == [q0] ternary i [q1] ternary
271 ##PE1.1 == + dup [+] dip
272 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
273 ##PE1.3 == 14811 swap [PE1.2] times pop
274 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
276 #PE1.2 == [PE1.1] step
277 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
281 def FunctionWrapper(f):
282 '''Set name attribute.'''
284 raise ValueError('Function %s must have doc string.' % f.__name__)
285 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
289 def SimpleFunctionWrapper(f):
291 Wrap functions that take and return just a stack.
295 @rename_code_object(f.__name__)
296 def inner(stack, expression, dictionary):
297 return f(stack), expression, dictionary
301 def BinaryBuiltinWrapper(f):
303 Wrap functions that take two arguments and return a single result.
307 @rename_code_object(f.__name__)
308 def inner(stack, expression, dictionary):
309 (a, (b, stack)) = stack
311 return (result, stack), expression, dictionary
315 def UnaryBuiltinWrapper(f):
317 Wrap functions that take one argument and return a single result.
321 @rename_code_object(f.__name__)
322 def inner(stack, expression, dictionary):
325 return (result, stack), expression, dictionary
329 class DefinitionWrapper(object):
331 Provide implementation of defined functions, and some helper methods.
334 def __init__(self, name, body_text, doc=None):
335 self.name = self.__name__ = name
336 self.body = text_to_expression(body_text)
337 self._body = tuple(iter_stack(self.body))
338 self.__doc__ = doc or body_text
339 self._compiled = None
341 def __call__(self, stack, expression, dictionary):
343 return self._compiled(stack, expression, dictionary)
344 expression = list_to_stack(self._body, expression)
345 return stack, expression, dictionary
348 def parse_definition(class_, defi):
350 Given some text describing a Joy function definition parse it and
351 return a DefinitionWrapper.
353 name, proper, body_text = (n.strip() for n in defi.partition('=='))
355 raise ValueError('Definition %r failed' % (defi,))
356 return class_(name, body_text)
359 def add_definitions(class_, defs, dictionary):
361 Scan multi-line string defs for definitions and add them to the
364 for definition in _text_to_defs(defs):
365 class_.add_def(definition, dictionary)
368 def add_def(class_, definition, dictionary):
370 Add the definition to the dictionary.
372 F = class_.parse_definition(definition)
375 secs = infer(*F._body)
378 print F.name, '==', expression_to_string(F.body), ' --failed to infer stack effect.'
380 FUNCTIONS[F.name] = SymbolJoyType(F.name, secs, _SYM_NUMS())
381 dictionary[F.name] = F
384 def _text_to_defs(text):
385 return (line.strip() for line in text.splitlines() if '==' in line)
396 def inscribe_(stack, expression, dictionary):
398 Create a new Joy function definition in the Joy dictionary. A
399 definition is given as a string with a name followed by a double
400 equal sign then one or more Joy functions, the body. for example:
404 If you want the definition to persist over restarts, enter it into
405 the definitions.txt resource.
407 definition, stack = stack
408 DefinitionWrapper.add_def(definition, dictionary)
409 return stack, expression, dictionary
413 @SimpleFunctionWrapper
415 '''Parse the string on the stack to a Joy expression.'''
417 expression = text_to_expression(text)
418 return expression, stack
423 @SimpleFunctionWrapper
428 getitem == drop first
430 Expects an integer and a quote on the stack and returns the item at the
431 nth position in the quote counting from 0.
435 -------------------------
439 n, (Q, stack) = stack
440 return pick(Q, n), stack
445 @SimpleFunctionWrapper
452 Expects an integer and a quote on the stack and returns the quote with
453 n items removed off the top.
457 ----------------------
461 n, (Q, stack) = stack
473 @SimpleFunctionWrapper
476 Expects an integer and a quote on the stack and returns the quote with
477 just the top n items in reverse order (because that's easier and you can
478 use reverse if needed.)
482 ----------------------
486 n, (Q, stack) = stack
499 @SimpleFunctionWrapper
502 Use a Boolean value to select one of two items.
506 ----------------------
511 ---------------------
514 Currently Python semantics are used to evaluate the "truthiness" of the
515 Boolean value (so empty string, zero, etc. are counted as false, etc.)
517 (if_, (then, (else_, stack))) = stack
518 return then if if_ else else_, stack
522 @SimpleFunctionWrapper
525 Use a Boolean value to select one of two items from a sequence.
529 ------------------------
534 -----------------------
537 The sequence can contain more than two items but not fewer.
538 Currently Python semantics are used to evaluate the "truthiness" of the
539 Boolean value (so empty string, zero, etc. are counted as false, etc.)
541 (flag, (choices, stack)) = stack
542 (else_, (then, _)) = choices
543 return then if flag else else_, stack
548 @SimpleFunctionWrapper
550 '''Given a list find the maximum.'''
552 return max(iter_stack(tos)), stack
557 @SimpleFunctionWrapper
559 '''Given a list find the minimum.'''
561 return min(iter_stack(tos)), stack
566 @SimpleFunctionWrapper
568 '''Given a quoted sequence of numbers return the sum.
570 sum == 0 swap [+] step
573 return sum(iter_stack(tos)), stack
577 @SimpleFunctionWrapper
580 Expects an item on the stack and a quote under it and removes that item
581 from the the quote. The item is only removed once.
585 ------------------------
589 (tos, (second, stack)) = S
590 l = list(iter_stack(second))
592 return list_to_stack(l), stack
596 @SimpleFunctionWrapper
598 '''Given a list remove duplicate items.'''
600 I = list(iter_stack(tos))
601 list_to_stack(sorted(set(I), key=I.index))
602 return list_to_stack(sorted(set(I), key=I.index)), stack
606 @SimpleFunctionWrapper
608 '''Given a list return it sorted.'''
610 return list_to_stack(sorted(iter_stack(tos))), stack
613 _functions['clear'] = s0, s1
615 @SimpleFunctionWrapper
617 '''Clear everything from the stack.
620 clear == stack [pop stack] loop
630 @SimpleFunctionWrapper
633 The unstack operator expects a list on top of the stack and makes that
634 the stack discarding the rest of the stack.
640 @SimpleFunctionWrapper
642 '''Reverse the list on the top of the stack.
645 reverse == [] swap shunt
649 for term in iter_stack(tos):
655 @SimpleFunctionWrapper
657 '''Concatinate the two lists on the top of the stack.
660 [a b c] [d e f] concat
661 ----------------------------
665 (tos, (second, stack)) = S
666 return concat(second, tos), stack
670 @SimpleFunctionWrapper
672 '''Like concat but reverses the top list into the second.
675 shunt == [swons] step == reverse swap concat
677 [a b c] [d e f] shunt
678 ---------------------------
682 (tos, (second, stack)) = stack
685 second = term, second
690 @SimpleFunctionWrapper
693 Replace the two lists on the top of the stack with a list of the pairs
694 from each list. The smallest list sets the length of the result list.
696 (tos, (second, stack)) = S
699 for a, b in zip(iter_stack(tos), iter_stack(second))
701 return list_to_stack(accumulator), stack
705 @SimpleFunctionWrapper
709 return tos + 1, stack
713 @SimpleFunctionWrapper
717 return tos - 1, stack
721 @SimpleFunctionWrapper
732 a, (b, stack) = stack
738 return int(math.floor(n))
740 floor.__doc__ = math.floor.__doc__
744 @SimpleFunctionWrapper
747 divmod(x, y) -> (quotient, remainder)
749 Return the tuple (x//y, x%y). Invariant: div*y + mod == x.
758 Return the square root of the number a.
759 Negative numbers return complex roots.
764 assert a < 0, repr(a)
765 r = math.sqrt(-a) * 1j
771 # if isinstance(text, str):
772 # return run(text, stack)
777 @SimpleFunctionWrapper
779 '''The identity function.'''
784 @SimpleFunctionWrapper
786 '''True if the form on TOS is void otherwise False.'''
788 return _void(form), stack
792 return any(not _void(i) for i in iter_stack(form))
803 def words(stack, expression, dictionary):
804 '''Print all the words in alphabetical order.'''
805 print(' '.join(sorted(dictionary)))
806 return stack, expression, dictionary
811 def sharing(stack, expression, dictionary):
812 '''Print redistribution information.'''
813 print("You may convey verbatim copies of the Program's source code as"
814 ' you receive it, in any medium, provided that you conspicuously'
815 ' and appropriately publish on each copy an appropriate copyright'
816 ' notice; keep intact all notices stating that this License and'
817 ' any non-permissive terms added in accord with section 7 apply'
818 ' to the code; keep intact all notices of the absence of any'
819 ' warranty; and give all recipients a copy of this License along'
821 ' You should have received a copy of the GNU General Public License'
822 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
823 return stack, expression, dictionary
828 def warranty(stack, expression, dictionary):
829 '''Print warranty information.'''
830 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
831 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
832 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
833 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
834 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
835 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
836 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
837 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
838 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
839 return stack, expression, dictionary
842 # def simple_manual(stack):
844 # Print words and help for each word.
846 # for name, f in sorted(FUNCTIONS.items()):
848 # boxline = '+%s+' % ('-' * (len(name) + 2))
851 # '| %s |' % (name,),
853 # d if d else ' ...',
863 def help_(S, expression, dictionary):
864 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
865 ((symbol, _), stack) = S
866 word = dictionary[symbol]
868 return stack, expression, dictionary
876 # Several combinators depend on other words in their definitions,
877 # we use symbols to prevent hard-coding these, so in theory, you
878 # could change the word in the dictionary to use different semantics.
879 S_choice = Symbol('choice')
880 S_first = Symbol('first')
881 S_getitem = Symbol('getitem')
882 S_genrec = Symbol('genrec')
883 S_loop = Symbol('loop')
885 S_ifte = Symbol('ifte')
886 S_infra = Symbol('infra')
887 S_step = Symbol('step')
888 S_times = Symbol('times')
889 S_swaack = Symbol('swaack')
890 S_truthy = Symbol('truthy')
894 @combinator_effect(_COMB_NUMS(), s1)
896 def i(stack, expression, dictionary):
898 The i combinator expects a quoted program on the stack and unpacks it
899 onto the pending expression for evaluation.
908 return stack, concat(quote, expression), dictionary
912 @combinator_effect(_COMB_NUMS(), s1)
914 def x(stack, expression, dictionary):
920 ... [Q] x = ... [Q] dup i
921 ... [Q] x = ... [Q] [Q] i
922 ... [Q] x = ... [Q] Q
926 return stack, concat(quote, expression), dictionary
930 @combinator_effect(_COMB_NUMS(), s7, s6)
932 def b(stack, expression, dictionary):
938 ... [P] [Q] b == ... [P] i [Q] i
939 ... [P] [Q] b == ... P Q
942 q, (p, (stack)) = stack
943 return stack, concat(p, concat(q, expression)), dictionary
947 @combinator_effect(_COMB_NUMS(), a1, s1)
949 def dupdip(stack, expression, dictionary):
953 [F] dupdip == dup [F] dip
963 return stack, concat(F, (a, expression)), dictionary
967 @combinator_effect(_COMB_NUMS(), s7, s6)
969 def infra(stack, expression, dictionary):
971 Accept a quoted program and a list on the stack and run the program
972 with the list as its stack.
975 ... [a b c] [Q] . infra
976 -----------------------------
977 c b a . Q [...] swaack
980 (quote, (aggregate, stack)) = stack
981 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
985 @combinator_effect(_COMB_NUMS(), s7, s6, s5, s4)
987 def genrec(stack, expression, dictionary):
989 General Recursion Combinator.
992 [if] [then] [rec1] [rec2] genrec
993 ---------------------------------------------------------------------
994 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
996 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
997 "The genrec combinator takes four program parameters in addition to
998 whatever data parameters it needs. Fourth from the top is an if-part,
999 followed by a then-part. If the if-part yields true, then the then-part
1000 is executed and the combinator terminates. The other two parameters are
1001 the rec1-part and the rec2-part. If the if-part yields false, the
1002 rec1-part is executed. Following that the four program parameters and
1003 the combinator are again pushed onto the stack bundled up in a quoted
1004 form. Then the rec2-part is executed, where it will find the bundled
1005 form. Typically it will then execute the bundled form, either with i or
1006 with app2, or some other combinator."
1008 The way to design one of these is to fix your base case [then] and the
1009 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
1010 a quotation of the whole function.
1012 For example, given a (general recursive) function 'F':
1015 F == [I] [T] [R1] [R2] genrec
1017 If the [I] if-part fails you must derive R1 and R2 from:
1022 Just set the stack arguments in front, and figure out what R1 and R2
1023 have to do to apply the quoted [F] in the proper way. In effect, the
1024 genrec combinator turns into an ifte combinator with a quoted copy of
1025 the original definition in the else-part:
1028 F == [I] [T] [R1] [R2] genrec
1029 == [I] [T] [R1 [F] R2] ifte
1031 Primitive recursive functions are those where R2 == i.
1034 P == [I] [T] [R] primrec
1035 == [I] [T] [R [P] i] ifte
1036 == [I] [T] [R P] ifte
1039 (rec2, (rec1, stack)) = stack
1040 (then, (if_, _)) = stack
1041 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
1042 else_ = concat(rec1, (F, rec2))
1043 return (else_, stack), (S_ifte, expression), dictionary
1047 @combinator_effect(_COMB_NUMS(), s7, s6)
1049 def map_(S, expression, dictionary):
1051 Run the quoted program on TOS on the items in the list under it, push a
1052 new list with the results (in place of the program and original list.
1054 # (quote, (aggregate, stack)) = S
1055 # results = list_to_stack([
1056 # joy((term, stack), quote, dictionary)[0][0]
1057 # for term in iter_stack(aggregate)
1059 # return (results, stack), expression, dictionary
1060 (quote, (aggregate, stack)) = S
1062 return (aggregate, stack), expression, dictionary
1064 for term in iter_stack(aggregate):
1066 batch = (s, (quote, (S_infra, (S_first, batch))))
1067 stack = (batch, ((), stack))
1068 return stack, (S_infra, expression), dictionary
1071 #def cleave(S, expression, dictionary):
1073 # The cleave combinator expects two quotations, and below that an item X.
1074 # It first executes [P], with X on top, and saves the top result element.
1075 # Then it executes [Q], again with X, and saves the top result.
1076 # Finally it restores the stack to what it was below X and pushes the two
1077 # results P(X) and Q(X).
1079 # (Q, (P, (x, stack))) = S
1080 # p = joy((x, stack), P, dictionary)[0][0]
1081 # q = joy((x, stack), Q, dictionary)[0][0]
1082 # return (q, (p, stack)), expression, dictionary
1085 def branch_true(stack, expression, dictionary):
1086 (then, (else_, (flag, stack))) = stack
1087 return stack, concat(then, expression), dictionary
1090 def branch_false(stack, expression, dictionary):
1091 (then, (else_, (flag, stack))) = stack
1092 return stack, concat(else_, expression), dictionary
1096 @poly_combinator_effect(_COMB_NUMS(), [branch_true, branch_false], b1, s7, s6)
1098 def branch(stack, expression, dictionary):
1100 Use a Boolean value to select one of two quoted programs to run.
1104 branch == roll< choice i
1108 False [F] [T] branch
1109 --------------------------
1113 -------------------------
1117 (then, (else_, (flag, stack))) = stack
1118 return stack, concat(then if flag else else_, expression), dictionary
1121 #FUNCTIONS['branch'] = CombinatorJoyType('branch', [branch_true, branch_false], 100)
1126 ##def ifte(stack, expression, dictionary):
1128 ## If-Then-Else Combinator
1131 ## ... [if] [then] [else] ifte
1132 ## ---------------------------------------------------
1133 ## ... [[else] [then]] [...] [if] infra select i
1138 ## ... [if] [then] [else] ifte
1139 ## -------------------------------------------------------
1140 ## ... [else] [then] [...] [if] infra first choice i
1143 ## Has the effect of grabbing a copy of the stack on which to run the
1144 ## if-part using infra.
1146 ## (else_, (then, (if_, stack))) = stack
1147 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1148 ## stack = (if_, (stack, (then, (else_, stack))))
1149 ## return stack, expression, dictionary
1154 def cond(stack, expression, dictionary):
1156 This combinator works like a case statement. It expects a single quote
1157 on the stack that must contain zero or more condition quotes and a
1158 default quote. Each condition clause should contain a quoted predicate
1159 followed by the function expression to run if that predicate returns
1160 true. If no predicates return true the default function runs.
1162 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1164 [[[B0] T0] [[B1] T1] [D]] cond
1165 -----------------------------------------
1166 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1169 conditions, stack = stack
1171 expression = _cond(conditions, expression)
1173 # Attempt to preload the args to first ifte.
1174 (P, (T, (E, expression))) = expression
1176 # If, for any reason, the argument to cond should happen to contain
1177 # only the default clause then this optimization will fail.
1180 stack = (E, (T, (P, stack)))
1181 return stack, expression, dictionary
1184 def _cond(conditions, expression):
1185 (clause, rest) = conditions
1186 if not rest: # clause is [D]
1189 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1193 @combinator_effect(_COMB_NUMS(), a1, s1)
1195 def dip(stack, expression, dictionary):
1197 The dip combinator expects a quoted program on the stack and below it
1198 some item, it hoists the item into the expression and runs the program
1199 on the rest of the stack.
1207 (quote, (x, stack)) = stack
1208 expression = (x, expression)
1209 return stack, concat(quote, expression), dictionary
1213 @combinator_effect(_COMB_NUMS(), a2, a1, s1)
1215 def dipd(S, expression, dictionary):
1217 Like dip but expects two items.
1221 ---------------------
1225 (quote, (x, (y, stack))) = S
1226 expression = (y, (x, expression))
1227 return stack, concat(quote, expression), dictionary
1231 @combinator_effect(_COMB_NUMS(), a3, a2, a1, s1)
1233 def dipdd(S, expression, dictionary):
1235 Like dip but expects three items.
1239 -----------------------
1243 (quote, (x, (y, (z, stack)))) = S
1244 expression = (z, (y, (x, expression)))
1245 return stack, concat(quote, expression), dictionary
1249 @combinator_effect(_COMB_NUMS(), a1, s1)
1251 def app1(S, expression, dictionary):
1253 Given a quoted program on TOS and anything as the second stack item run
1254 the program and replace the two args with the first result of the
1259 -----------------------------------
1260 ... [x ...] [Q] . infra first
1262 (quote, (x, stack)) = S
1263 stack = (quote, ((x, stack), stack))
1264 expression = (S_infra, (S_first, expression))
1265 return stack, expression, dictionary
1269 @combinator_effect(_COMB_NUMS(), a2, a1, s1)
1271 def app2(S, expression, dictionary):
1272 '''Like app1 with two items.
1276 -----------------------------------
1277 ... [y ...] [Q] . infra first
1278 [x ...] [Q] infra first
1281 (quote, (x, (y, stack))) = S
1282 expression = (S_infra, (S_first,
1283 ((x, stack), (quote, (S_infra, (S_first,
1285 stack = (quote, ((y, stack), stack))
1286 return stack, expression, dictionary
1290 @combinator_effect(_COMB_NUMS(), a3, a2, a1, s1)
1292 def app3(S, expression, dictionary):
1293 '''Like app1 with three items.
1296 ... z y x [Q] . app3
1297 -----------------------------------
1298 ... [z ...] [Q] . infra first
1299 [y ...] [Q] infra first
1300 [x ...] [Q] infra first
1303 (quote, (x, (y, (z, stack)))) = S
1304 expression = (S_infra, (S_first,
1305 ((y, stack), (quote, (S_infra, (S_first,
1306 ((x, stack), (quote, (S_infra, (S_first,
1307 expression))))))))))
1308 stack = (quote, ((z, stack), stack))
1309 return stack, expression, dictionary
1313 @combinator_effect(_COMB_NUMS(), s7, s6)
1315 def step(S, expression, dictionary):
1317 Run a quoted program on each item in a sequence.
1321 -----------------------
1326 ------------------------
1330 ... [a b c] [Q] . step
1331 ----------------------------------------
1332 ... a . Q [b c] [Q] step
1334 The step combinator executes the quotation on each member of the list
1335 on top of the stack.
1337 (quote, (aggregate, stack)) = S
1339 return stack, expression, dictionary
1340 head, tail = aggregate
1341 stack = quote, (head, stack)
1343 expression = tail, (quote, (S_step, expression))
1344 expression = S_i, expression
1345 return stack, expression, dictionary
1349 @combinator_effect(_COMB_NUMS(), i1, s6)
1351 def times(stack, expression, dictionary):
1353 times == [-- dip] cons [swap] infra [0 >] swap while pop
1357 --------------------- w/ n <= 0
1362 ---------------------------------
1367 --------------------------------- w/ n > 1
1368 ... . Q (n - 1) [Q] times
1371 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1372 (quote, (n, stack)) = stack
1374 return stack, expression, dictionary
1377 expression = n, (quote, (S_times, expression))
1378 expression = concat(quote, expression)
1379 return stack, expression, dictionary
1382 # The current definition above works like this:
1385 # --------------------------------------
1386 # [P] nullary [Q [P] nullary] loop
1388 # while == [pop i not] [popop] [dudipd] primrec
1390 #def while_(S, expression, dictionary):
1391 # '''[if] [body] while'''
1392 # (body, (if_, stack)) = S
1393 # while joy(stack, if_, dictionary)[0][0]:
1394 # stack = joy(stack, body, dictionary)[0]
1395 # return stack, expression, dictionary
1399 @combinator_effect(_COMB_NUMS(), b1, s6)
1401 def loop(stack, expression, dictionary):
1403 Basic loop combinator.
1407 -----------------------
1411 ------------------------
1415 quote, (flag, stack) = stack
1417 expression = concat(quote, (quote, (S_loop, expression)))
1418 return stack, expression, dictionary
1422 @combinator_effect(_COMB_NUMS(), a1, a2, s6, s7, s8)
1424 def cmp_(stack, expression, dictionary):
1426 cmp takes two values and three quoted programs on the stack and runs
1427 one of the three depending on the results of comparing the two values:
1431 ------------------------- a > b
1435 ------------------------- a = b
1439 ------------------------- a < b
1442 L, (E, (G, (b, (a, stack)))) = stack
1443 expression = concat(G if a > b else L if a < b else E, expression)
1444 return stack, expression, dictionary
1447 # FunctionWrapper(cleave),
1448 # FunctionWrapper(while_),
1453 #divmod_ = pm = __(n2, n1), __(n4, n3)
1455 sec_binary_cmp(BinaryBuiltinWrapper(operator.eq)),
1456 sec_binary_cmp(BinaryBuiltinWrapper(operator.ge)),
1457 sec_binary_cmp(BinaryBuiltinWrapper(operator.gt)),
1458 sec_binary_cmp(BinaryBuiltinWrapper(operator.le)),
1459 sec_binary_cmp(BinaryBuiltinWrapper(operator.lt)),
1460 sec_binary_cmp(BinaryBuiltinWrapper(operator.ne)),
1462 sec_binary_ints(BinaryBuiltinWrapper(operator.xor)),
1463 sec_binary_ints(BinaryBuiltinWrapper(operator.lshift)),
1464 sec_binary_ints(BinaryBuiltinWrapper(operator.rshift)),
1466 sec_binary_logic(BinaryBuiltinWrapper(operator.and_)),
1467 sec_binary_logic(BinaryBuiltinWrapper(operator.or_)),
1469 sec_binary_math(BinaryBuiltinWrapper(operator.add)),
1470 sec_binary_math(BinaryBuiltinWrapper(operator.floordiv)),
1471 sec_binary_math(BinaryBuiltinWrapper(operator.mod)),
1472 sec_binary_math(BinaryBuiltinWrapper(operator.mul)),
1473 sec_binary_math(BinaryBuiltinWrapper(operator.pow)),
1474 sec_binary_math(BinaryBuiltinWrapper(operator.sub)),
1475 sec_binary_math(BinaryBuiltinWrapper(operator.truediv)),
1477 sec_unary_logic(UnaryBuiltinWrapper(bool)),
1478 sec_unary_logic(UnaryBuiltinWrapper(operator.not_)),
1480 sec_unary_math(UnaryBuiltinWrapper(abs)),
1481 sec_unary_math(UnaryBuiltinWrapper(operator.neg)),
1482 sec_unary_math(UnaryBuiltinWrapper(sqrt)),
1484 stack_effect(n1)(i1)(UnaryBuiltinWrapper(floor)),
1487 del F # Otherwise Sphinx autodoc will pick it up.
1490 YIN_STACK_EFFECTS = yin_functions()
1492 # Load the auto-generated primitives into the dictionary.
1493 _functions.update(YIN_STACK_EFFECTS)
1496 # eh = compose(dup, bool)
1497 # sqr = compose(dup, mul)
1498 # of = compose(swap, at)
1500 # ''' in dict(compose=compose), _functions
1503 (name, SymbolJoyType(name, [_functions[name]], _SYM_NUMS()))
1504 for name in sorted(_functions)
1506 for name, primitive in getmembers(genlib, isfunction):
1507 inscribe(SimpleFunctionWrapper(primitive))
1510 add_aliases(_dictionary, ALIASES)
1511 add_aliases(_functions, ALIASES)
1512 add_aliases(FUNCTIONS, ALIASES)
1515 DefinitionWrapper.add_definitions(definitions, _dictionary)
1517 #sec_Ns_math(_dictionary['product'])