From 36b770f0009eda5633c6248261e171b3664eac59 Mon Sep 17 00:00:00 2001 From: Simon Forman Date: Wed, 6 Jun 2018 13:07:31 -0700 Subject: [PATCH] Make hates spaces in file names. --- ... This Implementation of Joy in Python.html | 12620 ------------ ...This Implementation of Joy in Python.ipynb | 651 - ...0. This Implementation of Joy in Python.md | 410 - .... This Implementation of Joy in Python.rst | 535 - docs/1. Basic Use of Joy in a Notebook.html | 12079 ----------- docs/1. Basic Use of Joy in a Notebook.ipynb | 240 - docs/1. Basic Use of Joy in a Notebook.md | 137 - docs/1. Basic Use of Joy in a Notebook.rst | 154 - docs/2. Library Examples.html | 16523 ---------------- docs/2. Library Examples.ipynb | 2964 --- docs/2. Library Examples.md | 1395 -- docs/2. Library Examples.rst | 1761 -- docs/3. Developing a Program.html | 13283 ------------- docs/3. Developing a Program.ipynb | 1121 -- docs/3. Developing a Program.md | 694 - docs/3. Developing a Program.rst | 799 - docs/Advent of Code 2017 December 1st.html | 12432 ------------ docs/Advent of Code 2017 December 1st.ipynb | 455 - docs/Advent of Code 2017 December 1st.md | 228 - docs/Advent of Code 2017 December 1st.rst | 288 - docs/Advent of Code 2017 December 2nd.html | 12487 ------------ docs/Advent of Code 2017 December 2nd.ipynb | 554 - docs/Advent of Code 2017 December 2nd.md | 361 - docs/Advent of Code 2017 December 2nd.rst | 432 - docs/Advent of Code 2017 December 3rd.html | 13592 ------------- docs/Advent of Code 2017 December 3rd.ipynb | 1426 -- docs/Advent of Code 2017 December 3rd.md | 843 - docs/Advent of Code 2017 December 3rd.rst | 973 - .../Advent of Code 2017 December 3rd_29_0.png | Bin 677 -> 0 bytes .../Advent of Code 2017 December 3rd_35_1.png | Bin 566 -> 0 bytes .../Advent of Code 2017 December 3rd_36_1.png | Bin 977 -> 0 bytes .../Advent of Code 2017 December 3rd_42_0.png | Bin 655 -> 0 bytes .../Advent of Code 2017 December 3rd_43_0.png | Bin 665 -> 0 bytes .../Advent of Code 2017 December 3rd_45_0.png | Bin 758 -> 0 bytes .../Advent of Code 2017 December 3rd_49_1.png | Bin 566 -> 0 bytes .../Advent of Code 2017 December 3rd_52_1.png | Bin 566 -> 0 bytes .../Advent of Code 2017 December 3rd_56_0.png | Bin 453 -> 0 bytes .../Advent of Code 2017 December 3rd_59_0.png | Bin 239 -> 0 bytes .../Advent of Code 2017 December 3rd_60_0.png | Bin 337 -> 0 bytes .../Advent of Code 2017 December 3rd_61_0.png | Bin 447 -> 0 bytes .../Advent of Code 2017 December 3rd_62_1.png | Bin 784 -> 0 bytes docs/Advent of Code 2017 December 4th.html | 11939 ----------- docs/Advent of Code 2017 December 4th.ipynb | 139 - docs/Advent of Code 2017 December 4th.md | 64 - docs/Advent of Code 2017 December 4th.rst | 77 - docs/Advent of Code 2017 December 5th.html | 12207 ------------ docs/Advent of Code 2017 December 5th.ipynb | 380 - docs/Advent of Code 2017 December 5th.md | 244 - docs/Advent of Code 2017 December 5th.rst | 324 - docs/Advent of Code 2017 December 6th.html | 12415 ------------ docs/Advent of Code 2017 December 6th.ipynb | 457 - docs/Advent of Code 2017 December 6th.md | 267 - docs/Advent of Code 2017 December 6th.rst | 305 - docs/Document.md | 469 - docs/Generator Programs.html | 13245 ------------- docs/Generator Programs.ipynb | 1027 - docs/Generator Programs.md | 508 - docs/Generator Programs.rst | 639 - ...ara-morphisms - Recursion Combinators.html | 15184 -------------- ...ra-morphisms - Recursion Combinators.ipynb | 2987 --- ... Para-morphisms - Recursion Combinators.md | 2449 --- ...Para-morphisms - Recursion Combinators.rst | 2680 --- docs/Library Examples.pdf | Bin 198245 -> 0 bytes docs/README.md | 44 - 64 files changed, 187487 deletions(-) delete mode 100644 docs/0. This Implementation of Joy in Python.html delete mode 100644 docs/0. This Implementation of Joy in Python.ipynb delete mode 100644 docs/0. This Implementation of Joy in Python.md delete mode 100644 docs/0. This Implementation of Joy in Python.rst delete mode 100644 docs/1. Basic Use of Joy in a Notebook.html delete mode 100644 docs/1. Basic Use of Joy in a Notebook.ipynb delete mode 100644 docs/1. Basic Use of Joy in a Notebook.md delete mode 100644 docs/1. Basic Use of Joy in a Notebook.rst delete mode 100644 docs/2. Library Examples.html delete mode 100644 docs/2. Library Examples.ipynb delete mode 100644 docs/2. Library Examples.md delete mode 100644 docs/2. Library Examples.rst delete mode 100644 docs/3. Developing a Program.html delete mode 100644 docs/3. Developing a Program.ipynb delete mode 100644 docs/3. Developing a Program.md delete mode 100644 docs/3. Developing a Program.rst delete mode 100644 docs/Advent of Code 2017 December 1st.html delete mode 100644 docs/Advent of Code 2017 December 1st.ipynb delete mode 100644 docs/Advent of Code 2017 December 1st.md delete mode 100644 docs/Advent of Code 2017 December 1st.rst delete mode 100644 docs/Advent of Code 2017 December 2nd.html delete mode 100644 docs/Advent of Code 2017 December 2nd.ipynb delete mode 100644 docs/Advent of Code 2017 December 2nd.md delete mode 100644 docs/Advent of Code 2017 December 2nd.rst delete mode 100644 docs/Advent of Code 2017 December 3rd.html delete mode 100644 docs/Advent of Code 2017 December 3rd.ipynb delete mode 100644 docs/Advent of Code 2017 December 3rd.md delete mode 100644 docs/Advent of Code 2017 December 3rd.rst delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_29_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_35_1.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_36_1.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_42_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_43_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_45_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_49_1.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_52_1.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_56_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_59_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_60_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_61_0.png delete mode 100644 docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_62_1.png delete mode 100644 docs/Advent of Code 2017 December 4th.html delete mode 100644 docs/Advent of Code 2017 December 4th.ipynb delete mode 100644 docs/Advent of Code 2017 December 4th.md delete mode 100644 docs/Advent of Code 2017 December 4th.rst delete mode 100644 docs/Advent of Code 2017 December 5th.html delete mode 100644 docs/Advent of Code 2017 December 5th.ipynb delete mode 100644 docs/Advent of Code 2017 December 5th.md delete mode 100644 docs/Advent of Code 2017 December 5th.rst delete mode 100644 docs/Advent of Code 2017 December 6th.html delete mode 100644 docs/Advent of Code 2017 December 6th.ipynb delete mode 100644 docs/Advent of Code 2017 December 6th.md delete mode 100644 docs/Advent of Code 2017 December 6th.rst delete mode 100644 docs/Document.md delete mode 100644 docs/Generator Programs.html delete mode 100644 docs/Generator Programs.ipynb delete mode 100644 docs/Generator Programs.md delete mode 100644 docs/Generator Programs.rst delete mode 100644 docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.html delete mode 100644 docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.ipynb delete mode 100644 docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.md delete mode 100644 docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.rst delete mode 100644 docs/Library Examples.pdf delete mode 100644 docs/README.md diff --git a/docs/0. This Implementation of Joy in Python.html b/docs/0. This Implementation of Joy in Python.html deleted file mode 100644 index 6982023..0000000 --- a/docs/0. This Implementation of Joy in Python.html +++ /dev/null @@ -1,12620 +0,0 @@ - - - -0. This Implementation of Joy in Python - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Joypy

Joy in Python

This implementation is meant as a tool for exploring the programming model and method of Joy. Python seems like a great implementation language for Joy for several reasons.

-

We can lean on the Python immutable types for our basic semantics and types: ints, floats, strings, and tuples, which enforces functional purity. We get garbage collection for free. Compilation via Cython. Glue language with loads of libraries.

- -
-
-
-
-
-
-
-

Read-Eval-Print Loop (REPL)

The main way to interact with the Joy interpreter is through a simple REPL that you start by running the package:

- -
$ python -m joy
-Joypy - Copyright © 2017 Simon Forman
-This program comes with ABSOLUTELY NO WARRANTY; for details type "warranty".
-This is free software, and you are welcome to redistribute it
-under certain conditions; type "sharing" for details.
-Type "words" to see a list of all words, and "[<name>] help" to print the
-docs for a word.
-
-
- <-top
-
-joy? _
-
-
-

The <-top marker points to the top of the (initially empty) stack. You can enter Joy notation at the prompt and a trace of evaluation will be printed followed by the stack and prompt again:

- -
joy? 23 sqr 18 +
-       . 23 sqr 18 +
-    23 . sqr 18 +
-    23 . dup mul 18 +
- 23 23 . mul 18 +
-   529 . 18 +
-529 18 . +
-   547 . 
-
-547 <-top
-
-joy?
- -
-
-
-
-
-
-
-

Stacks (aka list, quote, sequence, etc.)

In Joy, in addition to the types Boolean, integer, float, and string, there is a single sequence type represented by enclosing a sequence of terms in brackets [...]. This sequence type is used to represent both the stack and the expression. It is a cons list made from Python tuples.

- -
-
-
-
-
-
In [1]:
-
-
-
import inspect
-import joy.utils.stack
-
-
-print inspect.getdoc(joy.utils.stack)
-
- -
-
-
- -
-
- - -
- -
- - -
-
§ Stack
-
-
-When talking about Joy we use the terms "stack", "list", "sequence" and
-"aggregate" to mean the same thing: a simple datatype that permits
-certain operations such as iterating and pushing and popping values from
-(at least) one end.
-
-We use the venerable two-tuple recursive form of sequences where the
-empty tuple () is the empty stack and (head, rest) gives the recursive
-form of a stack with one or more items on it.
-
-  ()
-  (1, ())
-  (2, (1, ()))
-  (3, (2, (1, ())))
-  ...
-
-And so on.
-
-
-We have two very simple functions to build up a stack from a Python
-iterable and also to iterate through a stack and yield its items
-one-by-one in order, and two functions to generate string representations
-of stacks:
-
-  list_to_stack()
-
-  iter_stack()
-
-  expression_to_string()  (prints left-to-right)
-
-  stack_to_string()  (prints right-to-left)
-
-
-A word about the stack data structure.
-
-Python has very nice "tuple packing and unpacking" in its syntax which
-means we can directly "unpack" the expected arguments to a Joy function.
-
-For example:
-
-  def dup(stack):
-    head, tail = stack
-    return head, (head, tail)
-
-We replace the argument "stack" by the expected structure of the stack,
-in this case "(head, tail)", and Python takes care of de-structuring the
-incoming argument and assigning values to the names.  Note that Python
-syntax doesn't require parentheses around tuples used in expressions
-where they would be redundant.
-
-
-
- -
-
- -
-
-
-
-
-

The utility functions maintain order.

The 0th item in the list will be on the top of the stack and vise versa.

- -
-
-
-
-
-
In [2]:
-
-
-
joy.utils.stack.list_to_stack([1, 2, 3])
-
- -
-
-
- -
-
- - -
- -
Out[2]:
- - - - -
-
(1, (2, (3, ())))
-
- -
- -
-
- -
-
-
-
In [3]:
-
-
-
list(joy.utils.stack.iter_stack((1, (2, (3, ())))))
-
- -
-
-
- -
-
- - -
- -
Out[3]:
- - - - -
-
[1, 2, 3]
-
- -
- -
-
- -
-
-
-
-
-

This requires reversing the sequence (or iterating backwards) otherwise:

- -
-
-
-
-
-
In [4]:
-
-
-
stack = ()
-
-for n in [1, 2, 3]:
-    stack = n, stack
-
-print stack
-print list(joy.utils.stack.iter_stack(stack))
-
- -
-
-
- -
-
- - -
- -
- - -
-
(3, (2, (1, ())))
-[3, 2, 1]
-
-
-
- -
-
- -
-
-
-
-
-

Purely Functional Datastructures.

Because Joy lists are made out of Python tuples they are immutable, so all Joy datastructures are purely functional.

- -
-
-
-
-
-
-
-

The joy() function.

An Interpreter

The joy() function is extrememly simple. It accepts a stack, an expression, and a dictionary, and it iterates through the expression putting values onto the stack and delegating execution to functions it looks up in the dictionary.

-

Each function is passed the stack, expression, and dictionary and returns them. Whatever the function returns becomes the new stack, expression, and dictionary. (The dictionary is passed to enable e.g. writing words that let you enter new words into the dictionary at runtime, which nothing does yet and may be a bad idea, and the help command.)

- -
-
-
-
-
-
In [5]:
-
-
-
import joy.joy
-
-print inspect.getsource(joy.joy.joy)
-
- -
-
-
- -
-
- - -
- -
- - -
-
def joy(stack, expression, dictionary, viewer=None):
-  '''
-  Evaluate the Joy expression on the stack.
-  '''
-  while expression:
-
-    if viewer: viewer(stack, expression)
-
-    term, expression = expression
-    if isinstance(term, Symbol):
-      term = dictionary[term]
-      stack, expression, dictionary = term(stack, expression, dictionary)
-    else:
-      stack = term, stack
-
-  if viewer: viewer(stack, expression)
-  return stack, expression, dictionary
-
-
-
-
- -
-
- -
-
-
-
-
-

View function

The joy() function accepts a "viewer" function which it calls on each iteration passing the current stack and expression just before evaluation. This can be used for tracing, breakpoints, retrying after exceptions, or interrupting an evaluation and saving to disk or sending over the network to resume later. The stack and expression together contain all the state of the computation at each step.

- -
-
-
-
-
-
-
-

The TracePrinter.

A viewer records each step of the evaluation of a Joy program. The TracePrinter has a facility for printing out a trace of the evaluation, one line per step. Each step is aligned to the current interpreter position, signified by a period separating the stack on the left from the pending expression ("continuation") on the right.

- -
-
-
-
-
-
-
-

Continuation-Passing Style

One day I thought, What happens if you rewrite Joy to use CSP? I made all the functions accept and return the expression as well as the stack and found that all the combinators could be rewritten to work by modifying the expression rather than making recursive calls to the joy() function.

- -
-
-
-
-
-
-
-

Parser

-
-
-
-
-
-
In [6]:
-
-
-
import joy.parser
-
-print inspect.getdoc(joy.parser)
-
- -
-
-
- -
-
- - -
- -
- - -
-
§ Converting text to a joy expression.
-
-This module exports a single function:
-
-  text_to_expression(text)
-
-As well as a single Symbol class and a single Exception type:
-
-  ParseError
-
-When supplied with a string this function returns a Python datastructure
-that represents the Joy datastructure described by the text expression.
-Any unbalanced square brackets will raise a ParseError.
-
-
-
- -
-
- -
-
-
-
-
-

The parser is extremely simple, the undocumented re.Scanner class does most of the tokenizing work and then you just build the tuple structure out of the tokens. There's no Abstract Syntax Tree or anything like that.

- -
-
-
-
-
-
In [7]:
-
-
-
print inspect.getsource(joy.parser._parse)
-
- -
-
-
- -
-
- - -
- -
- - -
-
def _parse(tokens):
-  '''
-  Return a stack/list expression of the tokens.
-  '''
-  frame = []
-  stack = []
-  for tok in tokens:
-    if tok == '[':
-      stack.append(frame)
-      frame = []
-      stack[-1].append(frame)
-    elif tok == ']':
-      try:
-        frame = stack.pop()
-      except IndexError:
-        raise ParseError('One or more extra closing brackets.')
-      frame[-1] = list_to_stack(frame[-1])
-    else:
-      frame.append(tok)
-  if stack:
-    raise ParseError('One or more unclosed brackets.')
-  return list_to_stack(frame)
-
-
-
-
- -
-
- -
-
-
-
-
-

That's pretty much all there is to it.

- -
-
-
-
-
-
In [8]:
-
-
-
joy.parser.text_to_expression('1 2 3 4 5')  # A simple sequence.
-
- -
-
-
- -
-
- - -
- -
Out[8]:
- - - - -
-
(1, (2, (3, (4, (5, ())))))
-
- -
- -
-
- -
-
-
-
In [9]:
-
-
-
joy.parser.text_to_expression('[1 2 3] 4 5')  # Three items, the first is a list with three items
-
- -
-
-
- -
-
- - -
- -
Out[9]:
- - - - -
-
((1, (2, (3, ()))), (4, (5, ())))
-
- -
- -
-
- -
-
-
-
In [10]:
-
-
-
joy.parser.text_to_expression('1 23 ["four" [-5.0] cons] 8888')  # A mixed bag. cons is
-                                                                 # a Symbol, no lookup at
-                                                                 # parse-time.  Haiku docs.
-
- -
-
-
- -
-
- - -
- -
Out[10]:
- - - - -
-
(1, (23, (('four', ((-5.0, ()), (cons, ()))), (8888, ()))))
-
- -
- -
-
- -
-
-
-
In [11]:
-
-
-
joy.parser.text_to_expression('[][][][][]')  # Five empty lists.
-
- -
-
-
- -
-
- - -
- -
Out[11]:
- - - - -
-
((), ((), ((), ((), ((), ())))))
-
- -
- -
-
- -
-
-
-
In [12]:
-
-
-
joy.parser.text_to_expression('[[[[[]]]]]')  # Five nested lists.
-
- -
-
-
- -
-
- - -
- -
Out[12]:
- - - - -
-
((((((), ()), ()), ()), ()), ())
-
- -
- -
-
- -
-
-
-
-
-

Library

The Joy library of functions (aka commands, or "words" after Forth usage) encapsulates all the actual functionality (no pun intended) of the Joy system. There are simple functions such as addition add (or +, the library module supports aliases), and combinators which provide control-flow and higher-order operations.

- -
-
-
-
-
-
In [13]:
-
-
-
import joy.library
-
-print ' '.join(sorted(joy.library.initialize()))
-
- -
-
-
- -
-
- - -
- -
- - -
-
!= % & * *fraction *fraction0 + ++ - -- / < << <= <> = > >= >> ? ^ add anamorphism and app1 app2 app3 average b binary branch choice clear cleave concat cons dinfrirst dip dipd dipdd disenstacken div down_to_zero dudipd dup dupd dupdip enstacken eq first flatten floordiv gcd ge genrec getitem gt help i id ifte infra le least_fraction loop lshift lt map min mod modulus mul ne neg not nullary or over pam parse pm pop popd popdd popop pow pred primrec product quoted range range_to_zero rem remainder remove rest reverse roll< roll> rolldown rollup rshift run second select sharing shunt size sqr sqrt stack step sub succ sum swaack swap swoncat swons ternary third times truediv truthy tuck unary uncons unit unquoted unstack void warranty while words x xor zip •
-
-
-
- -
-
- -
-
-
-
-
-

Many of the functions are defined in Python, like dip:

- -
-
-
-
-
-
In [14]:
-
-
-
print inspect.getsource(joy.library.dip)
-
- -
-
-
- -
-
- - -
- -
- - -
-
def dip(stack, expression, dictionary):
-  (quote, (x, stack)) = stack
-  expression = x, expression
-  return stack, pushback(quote, expression), dictionary
-
-
-
-
- -
-
- -
-
-
-
-
-

Some functions are defined in equations in terms of other functions. When the interpreter executes a definition function that function just pushes its body expression onto the pending expression (the continuation) and returns control to the interpreter.

- -
-
-
-
-
-
In [15]:
-
-
-
print joy.library.definitions
-
- -
-
-
- -
-
- - -
- -
- - -
-
second == rest first
-third == rest rest first
-product == 1 swap [*] step
-swons == swap cons
-swoncat == swap concat
-flatten == [] swap [concat] step
-unit == [] cons
-quoted == [unit] dip
-unquoted == [i] dip
-enstacken == stack [clear] dip
-disenstacken == ? [uncons ?] loop pop
-? == dup truthy
-dinfrirst == dip infra first
-nullary == [stack] dinfrirst
-unary == [stack [pop] dip] dinfrirst
-binary == [stack [popop] dip] dinfrirst
-ternary == [stack [popop pop] dip] dinfrirst
-pam == [i] map
-run == [] swap infra
-sqr == dup mul
-size == 0 swap [pop ++] step
-cleave == [i] app2 [popd] dip
-average == [sum 1.0 *] [size] cleave /
-gcd == 1 [tuck modulus dup 0 >] loop pop
-least_fraction == dup [gcd] infra [div] concat map
-*fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
-*fraction0 == concat [[swap] dip * [*] dip] infra
-down_to_zero == [0 >] [dup --] while
-range_to_zero == unit [down_to_zero] infra
-anamorphism == [pop []] swap [dip swons] genrec
-range == [0 <=] [1 - dup] anamorphism
-while == swap [nullary] cons dup dipd concat loop
-dudipd == dup dipd
-primrec == [i] genrec
-
-
-
-
- -
-
- -
-
-
-
-
-

Currently, there's no function to add new definitions to the dictionary from "within" Joy code itself. Adding new definitions remains a meta-interpreter action. You have to do it yourself, in Python, and wash your hands afterward.

-

It would be simple enough to define one, but it would open the door to name binding and break the idea that all state is captured in the stack and expression. There's an implicit standard dictionary that defines the actual semantics of the syntactic stack and expression datastructures (which only contain symbols, not the actual functions. Pickle some and see for yourself.)

-

"There should be only one."

Which brings me to talking about one of my hopes and dreams for this notation: "There should be only one." What I mean is that there should be one universal standard dictionary of commands, and all bespoke work done in a UI for purposes takes place by direct interaction and macros. There would be a Grand Refactoring biannually (two years, not six months, that's semi-annually) where any new definitions factored out of the usage and macros of the previous time, along with new algorithms and such, were entered into the dictionary and posted to e.g. IPFS.

-

Code should not burgeon wildly, as it does today. The variety of code should map more-or-less to the well-factored variety of human computably-solvable problems. There shouldn't be dozens of chat apps, JS frameworks, programming languages. It's a waste of time, a fractal "thundering herd" attack on human mentality.

-

Literary Code Library

If you read over the other notebooks you'll see that developing code in Joy is a lot like doing simple mathematics, and the descriptions of the code resemble math papers. The code also works the first time, no bugs. If you have any experience programming at all, you are probably skeptical, as I was, but it seems to work: deriving code mathematically seems to lead to fewer errors.

-

But my point now is that this great ratio of textual explanation to wind up with code that consists of a few equations and could fit on an index card is highly desirable. Less code has fewer errors. The structure of Joy engenders a kind of thinking that seems to be very effective for developing structured processes.

-

There seems to be an elegance and power to the notation.

- -
-
-
-
-
-
In [ ]:
-
-
-
  
-
- -
-
-
- -
-
-
- - - - - - diff --git a/docs/0. This Implementation of Joy in Python.ipynb b/docs/0. This Implementation of Joy in Python.ipynb deleted file mode 100644 index 8b3ce7e..0000000 --- a/docs/0. This Implementation of Joy in Python.ipynb +++ /dev/null @@ -1,651 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Joypy\n", - "\n", - "## Joy in Python\n", - "\n", - "This implementation is meant as a tool for exploring the programming model and method of Joy. Python seems like a great implementation language for Joy for several reasons.\n", - "\n", - "We can lean on the Python immutable types for our basic semantics and types: ints, floats, strings, and tuples, which enforces functional purity. We get garbage collection for free. Compilation via Cython. Glue language with loads of libraries." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### [Read-Eval-Print Loop (REPL)](https://en.wikipedia.org/wiki/Read%E2%80%93eval%E2%80%93print_loop)\n", - "The main way to interact with the Joy interpreter is through a simple [REPL](https://en.wikipedia.org/wiki/Read%E2%80%93eval%E2%80%93print_loop) that you start by running the package:\n", - "\n", - " $ python -m joy\n", - " Joypy - Copyright © 2017 Simon Forman\n", - " This program comes with ABSOLUTELY NO WARRANTY; for details type \"warranty\".\n", - " This is free software, and you are welcome to redistribute it\n", - " under certain conditions; type \"sharing\" for details.\n", - " Type \"words\" to see a list of all words, and \"[] help\" to print the\n", - " docs for a word.\n", - "\n", - "\n", - " <-top\n", - "\n", - " joy? _\n", - "\n", - "The `<-top` marker points to the top of the (initially empty) stack. You can enter Joy notation at the prompt and a [trace of evaluation](#The-TracePrinter.) will be printed followed by the stack and prompt again:\n", - "\n", - " joy? 23 sqr 18 +\n", - " . 23 sqr 18 +\n", - " 23 . sqr 18 +\n", - " 23 . dup mul 18 +\n", - " 23 23 . mul 18 +\n", - " 529 . 18 +\n", - " 529 18 . +\n", - " 547 . \n", - "\n", - " 547 <-top\n", - "\n", - " joy? \n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Stacks (aka list, quote, sequence, etc.)\n", - "\n", - "In Joy, in addition to the types Boolean, integer, float, and string, there is a single sequence type represented by enclosing a sequence of terms in brackets `[...]`. This sequence type is used to represent both the stack and the expression. It is a [cons list](https://en.wikipedia.org/wiki/Cons#Lists) made from Python tuples." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "§ Stack\n", - "\n", - "\n", - "When talking about Joy we use the terms \"stack\", \"list\", \"sequence\" and\n", - "\"aggregate\" to mean the same thing: a simple datatype that permits\n", - "certain operations such as iterating and pushing and popping values from\n", - "(at least) one end.\n", - "\n", - "We use the venerable two-tuple recursive form of sequences where the\n", - "empty tuple () is the empty stack and (head, rest) gives the recursive\n", - "form of a stack with one or more items on it.\n", - "\n", - " ()\n", - " (1, ())\n", - " (2, (1, ()))\n", - " (3, (2, (1, ())))\n", - " ...\n", - "\n", - "And so on.\n", - "\n", - "\n", - "We have two very simple functions to build up a stack from a Python\n", - "iterable and also to iterate through a stack and yield its items\n", - "one-by-one in order, and two functions to generate string representations\n", - "of stacks:\n", - "\n", - " list_to_stack()\n", - "\n", - " iter_stack()\n", - "\n", - " expression_to_string() (prints left-to-right)\n", - "\n", - " stack_to_string() (prints right-to-left)\n", - "\n", - "\n", - "A word about the stack data structure.\n", - "\n", - "Python has very nice \"tuple packing and unpacking\" in its syntax which\n", - "means we can directly \"unpack\" the expected arguments to a Joy function.\n", - "\n", - "For example:\n", - "\n", - " def dup(stack):\n", - " head, tail = stack\n", - " return head, (head, tail)\n", - "\n", - "We replace the argument \"stack\" by the expected structure of the stack,\n", - "in this case \"(head, tail)\", and Python takes care of de-structuring the\n", - "incoming argument and assigning values to the names. Note that Python\n", - "syntax doesn't require parentheses around tuples used in expressions\n", - "where they would be redundant.\n" - ] - } - ], - "source": [ - "import inspect\n", - "import joy.utils.stack\n", - "\n", - "\n", - "print inspect.getdoc(joy.utils.stack)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### The utility functions maintain order.\n", - "The 0th item in the list will be on the top of the stack and *vise versa*." - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "(1, (2, (3, ())))" - ] - }, - "execution_count": 2, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "joy.utils.stack.list_to_stack([1, 2, 3])" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "[1, 2, 3]" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "list(joy.utils.stack.iter_stack((1, (2, (3, ())))))" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "This requires reversing the sequence (or iterating backwards) otherwise:" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "(3, (2, (1, ())))\n", - "[3, 2, 1]\n" - ] - } - ], - "source": [ - "stack = ()\n", - "\n", - "for n in [1, 2, 3]:\n", - " stack = n, stack\n", - "\n", - "print stack\n", - "print list(joy.utils.stack.iter_stack(stack))" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Purely Functional Datastructures.\n", - "Because Joy lists are made out of Python tuples they are immutable, so all Joy datastructures are *[purely functional](https://en.wikipedia.org/wiki/Purely_functional_data_structure)*." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# The `joy()` function.\n", - "## An Interpreter\n", - "The `joy()` function is extrememly simple. It accepts a stack, an expression, and a dictionary, and it iterates through the expression putting values onto the stack and delegating execution to functions it looks up in the dictionary.\n", - "\n", - "Each function is passed the stack, expression, and dictionary and returns them. Whatever the function returns becomes the new stack, expression, and dictionary. (The dictionary is passed to enable e.g. writing words that let you enter new words into the dictionary at runtime, which nothing does yet and may be a bad idea, and the `help` command.)" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "def joy(stack, expression, dictionary, viewer=None):\n", - " '''\n", - " Evaluate the Joy expression on the stack.\n", - " '''\n", - " while expression:\n", - "\n", - " if viewer: viewer(stack, expression)\n", - "\n", - " term, expression = expression\n", - " if isinstance(term, Symbol):\n", - " term = dictionary[term]\n", - " stack, expression, dictionary = term(stack, expression, dictionary)\n", - " else:\n", - " stack = term, stack\n", - "\n", - " if viewer: viewer(stack, expression)\n", - " return stack, expression, dictionary\n", - "\n" - ] - } - ], - "source": [ - "import joy.joy\n", - "\n", - "print inspect.getsource(joy.joy.joy)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### View function\n", - "The `joy()` function accepts a \"viewer\" function which it calls on each iteration passing the current stack and expression just before evaluation. This can be used for tracing, breakpoints, retrying after exceptions, or interrupting an evaluation and saving to disk or sending over the network to resume later. The stack and expression together contain all the state of the computation at each step." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### The `TracePrinter`.\n", - "\n", - "A `viewer` records each step of the evaluation of a Joy program. The `TracePrinter` has a facility for printing out a trace of the evaluation, one line per step. Each step is aligned to the current interpreter position, signified by a period separating the stack on the left from the pending expression (\"continuation\") on the right." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### [Continuation-Passing Style](https://en.wikipedia.org/wiki/Continuation-passing_style)\n", - "One day I thought, What happens if you rewrite Joy to use [CSP](https://en.wikipedia.org/wiki/Continuation-passing_style)? I made all the functions accept and return the expression as well as the stack and found that all the combinators could be rewritten to work by modifying the expression rather than making recursive calls to the `joy()` function." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Parser" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "§ Converting text to a joy expression.\n", - "\n", - "This module exports a single function:\n", - "\n", - " text_to_expression(text)\n", - "\n", - "As well as a single Symbol class and a single Exception type:\n", - "\n", - " ParseError\n", - "\n", - "When supplied with a string this function returns a Python datastructure\n", - "that represents the Joy datastructure described by the text expression.\n", - "Any unbalanced square brackets will raise a ParseError.\n" - ] - } - ], - "source": [ - "import joy.parser\n", - "\n", - "print inspect.getdoc(joy.parser)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The parser is extremely simple, the undocumented `re.Scanner` class does most of the tokenizing work and then you just build the tuple structure out of the tokens. There's no Abstract Syntax Tree or anything like that." - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "def _parse(tokens):\n", - " '''\n", - " Return a stack/list expression of the tokens.\n", - " '''\n", - " frame = []\n", - " stack = []\n", - " for tok in tokens:\n", - " if tok == '[':\n", - " stack.append(frame)\n", - " frame = []\n", - " stack[-1].append(frame)\n", - " elif tok == ']':\n", - " try:\n", - " frame = stack.pop()\n", - " except IndexError:\n", - " raise ParseError('One or more extra closing brackets.')\n", - " frame[-1] = list_to_stack(frame[-1])\n", - " else:\n", - " frame.append(tok)\n", - " if stack:\n", - " raise ParseError('One or more unclosed brackets.')\n", - " return list_to_stack(frame)\n", - "\n" - ] - } - ], - "source": [ - "print inspect.getsource(joy.parser._parse)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "That's pretty much all there is to it." - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "(1, (2, (3, (4, (5, ())))))" - ] - }, - "execution_count": 8, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "joy.parser.text_to_expression('1 2 3 4 5') # A simple sequence." - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "((1, (2, (3, ()))), (4, (5, ())))" - ] - }, - "execution_count": 9, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "joy.parser.text_to_expression('[1 2 3] 4 5') # Three items, the first is a list with three items" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "(1, (23, (('four', ((-5.0, ()), (cons, ()))), (8888, ()))))" - ] - }, - "execution_count": 10, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "joy.parser.text_to_expression('1 23 [\"four\" [-5.0] cons] 8888') # A mixed bag. cons is\n", - " # a Symbol, no lookup at\n", - " # parse-time. Haiku docs." - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "((), ((), ((), ((), ((), ())))))" - ] - }, - "execution_count": 11, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "joy.parser.text_to_expression('[][][][][]') # Five empty lists." - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "((((((), ()), ()), ()), ()), ())" - ] - }, - "execution_count": 12, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "joy.parser.text_to_expression('[[[[[]]]]]') # Five nested lists." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Library\n", - "The Joy library of functions (aka commands, or \"words\" after Forth usage) encapsulates all the actual functionality (no pun intended) of the Joy system. There are simple functions such as addition `add` (or `+`, the library module supports aliases), and combinators which provide control-flow and higher-order operations." - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "!= % & * *fraction *fraction0 + ++ - -- / < << <= <> = > >= >> ? ^ add anamorphism and app1 app2 app3 average b binary branch choice clear cleave concat cons dinfrirst dip dipd dipdd disenstacken div down_to_zero dudipd dup dupd dupdip enstacken eq first flatten floordiv gcd ge genrec getitem gt help i id ifte infra le least_fraction loop lshift lt map min mod modulus mul ne neg not nullary or over pam parse pm pop popd popdd popop pow pred primrec product quoted range range_to_zero rem remainder remove rest reverse roll< roll> rolldown rollup rshift run second select sharing shunt size sqr sqrt stack step sub succ sum swaack swap swoncat swons ternary third times truediv truthy tuck unary uncons unit unquoted unstack void warranty while words x xor zip •\n" - ] - } - ], - "source": [ - "import joy.library\n", - "\n", - "print ' '.join(sorted(joy.library.initialize()))" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Many of the functions are defined in Python, like `dip`:" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "def dip(stack, expression, dictionary):\n", - " (quote, (x, stack)) = stack\n", - " expression = x, expression\n", - " return stack, pushback(quote, expression), dictionary\n", - "\n" - ] - } - ], - "source": [ - "print inspect.getsource(joy.library.dip)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Some functions are defined in equations in terms of other functions. When the interpreter executes a definition function that function just pushes its body expression onto the pending expression (the continuation) and returns control to the interpreter." - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "second == rest first\n", - "third == rest rest first\n", - "product == 1 swap [*] step\n", - "swons == swap cons\n", - "swoncat == swap concat\n", - "flatten == [] swap [concat] step\n", - "unit == [] cons\n", - "quoted == [unit] dip\n", - "unquoted == [i] dip\n", - "enstacken == stack [clear] dip\n", - "disenstacken == ? [uncons ?] loop pop\n", - "? == dup truthy\n", - "dinfrirst == dip infra first\n", - "nullary == [stack] dinfrirst\n", - "unary == [stack [pop] dip] dinfrirst\n", - "binary == [stack [popop] dip] dinfrirst\n", - "ternary == [stack [popop pop] dip] dinfrirst\n", - "pam == [i] map\n", - "run == [] swap infra\n", - "sqr == dup mul\n", - "size == 0 swap [pop ++] step\n", - "cleave == [i] app2 [popd] dip\n", - "average == [sum 1.0 *] [size] cleave /\n", - "gcd == 1 [tuck modulus dup 0 >] loop pop\n", - "least_fraction == dup [gcd] infra [div] concat map\n", - "*fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons\n", - "*fraction0 == concat [[swap] dip * [*] dip] infra\n", - "down_to_zero == [0 >] [dup --] while\n", - "range_to_zero == unit [down_to_zero] infra\n", - "anamorphism == [pop []] swap [dip swons] genrec\n", - "range == [0 <=] [1 - dup] anamorphism\n", - "while == swap [nullary] cons dup dipd concat loop\n", - "dudipd == dup dipd\n", - "primrec == [i] genrec\n", - "\n" - ] - } - ], - "source": [ - "print joy.library.definitions" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Currently, there's no function to add new definitions to the dictionary from \"within\" Joy code itself. Adding new definitions remains a meta-interpreter action. You have to do it yourself, in Python, and wash your hands afterward.\n", - "\n", - "It would be simple enough to define one, but it would open the door to *name binding* and break the idea that all state is captured in the stack and expression. There's an implicit *standard dictionary* that defines the actual semantics of the syntactic stack and expression datastructures (which only contain symbols, not the actual functions. Pickle some and see for yourself.)\n", - "\n", - "#### \"There should be only one.\"\n", - "\n", - "Which brings me to talking about one of my hopes and dreams for this notation: \"There should be only one.\" What I mean is that there should be one universal standard dictionary of commands, and all bespoke work done in a UI for purposes takes place by direct interaction and macros. There would be a *Grand Refactoring* biannually (two years, not six months, that's semi-annually) where any new definitions factored out of the usage and macros of the previous time, along with new algorithms and such, were entered into the dictionary and posted to e.g. IPFS.\n", - "\n", - "Code should not burgeon wildly, as it does today. The variety of code should map more-or-less to the well-factored variety of human computably-solvable problems. There shouldn't be dozens of chat apps, JS frameworks, programming languages. It's a waste of time, a [fractal \"thundering herd\" attack](https://en.wikipedia.org/wiki/Thundering_herd_problem) on human mentality.\n", - "\n", - "#### Literary Code Library\n", - "\n", - "If you read over the other notebooks you'll see that developing code in Joy is a lot like doing simple mathematics, and the descriptions of the code resemble math papers. The code also works the first time, no bugs. If you have any experience programming at all, you are probably skeptical, as I was, but it seems to work: deriving code mathematically seems to lead to fewer errors.\n", - "\n", - "But my point now is that this great ratio of textual explanation to wind up with code that consists of a few equations and could fit on an index card is highly desirable. Less code has fewer errors. The structure of Joy engenders a kind of thinking that seems to be very effective for developing structured processes.\n", - "\n", - "There seems to be an elegance and power to the notation.\n" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [ - " " - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/0. This Implementation of Joy in Python.md b/docs/0. This Implementation of Joy in Python.md deleted file mode 100644 index d3871fa..0000000 --- a/docs/0. This Implementation of Joy in Python.md +++ /dev/null @@ -1,410 +0,0 @@ - -# Joypy -## Joy in Python - -This implementation is meant as a tool for exploring the programming model and method of Joy. Python seems like a great implementation language for Joy for several reasons. - -We can lean on the Python immutable types for our basic semantics and types: ints, floats, strings, and tuples, which enforces functional purity. We get garbage collection for free. Compilation via Cython. Glue language with loads of libraries. - -### [Read-Eval-Print Loop (REPL)](https://en.wikipedia.org/wiki/Read%E2%80%93eval%E2%80%93print_loop) -The main way to interact with the Joy interpreter is through a simple [REPL](https://en.wikipedia.org/wiki/Read%E2%80%93eval%E2%80%93print_loop) that you start by running the package: - - $ python -m joy - Joypy - Copyright © 2017 Simon Forman - This program comes with ABSOLUTELY NO WARRANTY; for details type "warranty". - This is free software, and you are welcome to redistribute it - under certain conditions; type "sharing" for details. - Type "words" to see a list of all words, and "[] help" to print the - docs for a word. - - - <-top - - joy? _ - -The `<-top` marker points to the top of the (initially empty) stack. You can enter Joy notation at the prompt and a [trace of evaluation](#The-TracePrinter.) will be printed followed by the stack and prompt again: - - joy? 23 sqr 18 + - . 23 sqr 18 + - 23 . sqr 18 + - 23 . dup mul 18 + - 23 23 . mul 18 + - 529 . 18 + - 529 18 . + - 547 . - - 547 <-top - - joy? - - -# Stacks (aka list, quote, sequence, etc.) - -In Joy, in addition to the types Boolean, integer, float, and string, there is a single sequence type represented by enclosing a sequence of terms in brackets `[...]`. This sequence type is used to represent both the stack and the expression. It is a [cons list](https://en.wikipedia.org/wiki/Cons#Lists) made from Python tuples. - - -```python -import inspect -import joy.utils.stack - - -print inspect.getdoc(joy.utils.stack) -``` - - § Stack - - - When talking about Joy we use the terms "stack", "list", "sequence" and - "aggregate" to mean the same thing: a simple datatype that permits - certain operations such as iterating and pushing and popping values from - (at least) one end. - - We use the venerable two-tuple recursive form of sequences where the - empty tuple () is the empty stack and (head, rest) gives the recursive - form of a stack with one or more items on it. - - () - (1, ()) - (2, (1, ())) - (3, (2, (1, ()))) - ... - - And so on. - - - We have two very simple functions to build up a stack from a Python - iterable and also to iterate through a stack and yield its items - one-by-one in order, and two functions to generate string representations - of stacks: - - list_to_stack() - - iter_stack() - - expression_to_string() (prints left-to-right) - - stack_to_string() (prints right-to-left) - - - A word about the stack data structure. - - Python has very nice "tuple packing and unpacking" in its syntax which - means we can directly "unpack" the expected arguments to a Joy function. - - For example: - - def dup(stack): - head, tail = stack - return head, (head, tail) - - We replace the argument "stack" by the expected structure of the stack, - in this case "(head, tail)", and Python takes care of de-structuring the - incoming argument and assigning values to the names. Note that Python - syntax doesn't require parentheses around tuples used in expressions - where they would be redundant. - - -### The utility functions maintain order. -The 0th item in the list will be on the top of the stack and *vise versa*. - - -```python -joy.utils.stack.list_to_stack([1, 2, 3]) -``` - - - - - (1, (2, (3, ()))) - - - - -```python -list(joy.utils.stack.iter_stack((1, (2, (3, ()))))) -``` - - - - - [1, 2, 3] - - - -This requires reversing the sequence (or iterating backwards) otherwise: - - -```python -stack = () - -for n in [1, 2, 3]: - stack = n, stack - -print stack -print list(joy.utils.stack.iter_stack(stack)) -``` - - (3, (2, (1, ()))) - [3, 2, 1] - - -### Purely Functional Datastructures. -Because Joy lists are made out of Python tuples they are immutable, so all Joy datastructures are *[purely functional](https://en.wikipedia.org/wiki/Purely_functional_data_structure)*. - -# The `joy()` function. -## An Interpreter -The `joy()` function is extrememly simple. It accepts a stack, an expression, and a dictionary, and it iterates through the expression putting values onto the stack and delegating execution to functions it looks up in the dictionary. - -Each function is passed the stack, expression, and dictionary and returns them. Whatever the function returns becomes the new stack, expression, and dictionary. (The dictionary is passed to enable e.g. writing words that let you enter new words into the dictionary at runtime, which nothing does yet and may be a bad idea, and the `help` command.) - - -```python -import joy.joy - -print inspect.getsource(joy.joy.joy) -``` - - def joy(stack, expression, dictionary, viewer=None): - ''' - Evaluate the Joy expression on the stack. - ''' - while expression: - - if viewer: viewer(stack, expression) - - term, expression = expression - if isinstance(term, Symbol): - term = dictionary[term] - stack, expression, dictionary = term(stack, expression, dictionary) - else: - stack = term, stack - - if viewer: viewer(stack, expression) - return stack, expression, dictionary - - - -### View function -The `joy()` function accepts a "viewer" function which it calls on each iteration passing the current stack and expression just before evaluation. This can be used for tracing, breakpoints, retrying after exceptions, or interrupting an evaluation and saving to disk or sending over the network to resume later. The stack and expression together contain all the state of the computation at each step. - -### The `TracePrinter`. - -A `viewer` records each step of the evaluation of a Joy program. The `TracePrinter` has a facility for printing out a trace of the evaluation, one line per step. Each step is aligned to the current interpreter position, signified by a period separating the stack on the left from the pending expression ("continuation") on the right. - -### [Continuation-Passing Style](https://en.wikipedia.org/wiki/Continuation-passing_style) -One day I thought, What happens if you rewrite Joy to use [CSP](https://en.wikipedia.org/wiki/Continuation-passing_style)? I made all the functions accept and return the expression as well as the stack and found that all the combinators could be rewritten to work by modifying the expression rather than making recursive calls to the `joy()` function. - -# Parser - - -```python -import joy.parser - -print inspect.getdoc(joy.parser) -``` - - § Converting text to a joy expression. - - This module exports a single function: - - text_to_expression(text) - - As well as a single Symbol class and a single Exception type: - - ParseError - - When supplied with a string this function returns a Python datastructure - that represents the Joy datastructure described by the text expression. - Any unbalanced square brackets will raise a ParseError. - - -The parser is extremely simple, the undocumented `re.Scanner` class does most of the tokenizing work and then you just build the tuple structure out of the tokens. There's no Abstract Syntax Tree or anything like that. - - -```python -print inspect.getsource(joy.parser._parse) -``` - - def _parse(tokens): - ''' - Return a stack/list expression of the tokens. - ''' - frame = [] - stack = [] - for tok in tokens: - if tok == '[': - stack.append(frame) - frame = [] - stack[-1].append(frame) - elif tok == ']': - try: - frame = stack.pop() - except IndexError: - raise ParseError('One or more extra closing brackets.') - frame[-1] = list_to_stack(frame[-1]) - else: - frame.append(tok) - if stack: - raise ParseError('One or more unclosed brackets.') - return list_to_stack(frame) - - - -That's pretty much all there is to it. - - -```python -joy.parser.text_to_expression('1 2 3 4 5') # A simple sequence. -``` - - - - - (1, (2, (3, (4, (5, ()))))) - - - - -```python -joy.parser.text_to_expression('[1 2 3] 4 5') # Three items, the first is a list with three items -``` - - - - - ((1, (2, (3, ()))), (4, (5, ()))) - - - - -```python -joy.parser.text_to_expression('1 23 ["four" [-5.0] cons] 8888') # A mixed bag. cons is - # a Symbol, no lookup at - # parse-time. Haiku docs. -``` - - - - - (1, (23, (('four', ((-5.0, ()), (cons, ()))), (8888, ())))) - - - - -```python -joy.parser.text_to_expression('[][][][][]') # Five empty lists. -``` - - - - - ((), ((), ((), ((), ((), ()))))) - - - - -```python -joy.parser.text_to_expression('[[[[[]]]]]') # Five nested lists. -``` - - - - - ((((((), ()), ()), ()), ()), ()) - - - -# Library -The Joy library of functions (aka commands, or "words" after Forth usage) encapsulates all the actual functionality (no pun intended) of the Joy system. There are simple functions such as addition `add` (or `+`, the library module supports aliases), and combinators which provide control-flow and higher-order operations. - - -```python -import joy.library - -print ' '.join(sorted(joy.library.initialize())) -``` - - != % & * *fraction *fraction0 + ++ - -- / < << <= <> = > >= >> ? ^ add anamorphism and app1 app2 app3 average b binary branch choice clear cleave concat cons dinfrirst dip dipd dipdd disenstacken div down_to_zero dudipd dup dupd dupdip enstacken eq first flatten floordiv gcd ge genrec getitem gt help i id ifte infra le least_fraction loop lshift lt map min mod modulus mul ne neg not nullary or over pam parse pm pop popd popdd popop pow pred primrec product quoted range range_to_zero rem remainder remove rest reverse roll< roll> rolldown rollup rshift run second select sharing shunt size sqr sqrt stack step sub succ sum swaack swap swoncat swons ternary third times truediv truthy tuck unary uncons unit unquoted unstack void warranty while words x xor zip • - - -Many of the functions are defined in Python, like `dip`: - - -```python -print inspect.getsource(joy.library.dip) -``` - - def dip(stack, expression, dictionary): - (quote, (x, stack)) = stack - expression = x, expression - return stack, pushback(quote, expression), dictionary - - - -Some functions are defined in equations in terms of other functions. When the interpreter executes a definition function that function just pushes its body expression onto the pending expression (the continuation) and returns control to the interpreter. - - -```python -print joy.library.definitions -``` - - second == rest first - third == rest rest first - product == 1 swap [*] step - swons == swap cons - swoncat == swap concat - flatten == [] swap [concat] step - unit == [] cons - quoted == [unit] dip - unquoted == [i] dip - enstacken == stack [clear] dip - disenstacken == ? [uncons ?] loop pop - ? == dup truthy - dinfrirst == dip infra first - nullary == [stack] dinfrirst - unary == [stack [pop] dip] dinfrirst - binary == [stack [popop] dip] dinfrirst - ternary == [stack [popop pop] dip] dinfrirst - pam == [i] map - run == [] swap infra - sqr == dup mul - size == 0 swap [pop ++] step - cleave == [i] app2 [popd] dip - average == [sum 1.0 *] [size] cleave / - gcd == 1 [tuck modulus dup 0 >] loop pop - least_fraction == dup [gcd] infra [div] concat map - *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons - *fraction0 == concat [[swap] dip * [*] dip] infra - down_to_zero == [0 >] [dup --] while - range_to_zero == unit [down_to_zero] infra - anamorphism == [pop []] swap [dip swons] genrec - range == [0 <=] [1 - dup] anamorphism - while == swap [nullary] cons dup dipd concat loop - dudipd == dup dipd - primrec == [i] genrec - - - -Currently, there's no function to add new definitions to the dictionary from "within" Joy code itself. Adding new definitions remains a meta-interpreter action. You have to do it yourself, in Python, and wash your hands afterward. - -It would be simple enough to define one, but it would open the door to *name binding* and break the idea that all state is captured in the stack and expression. There's an implicit *standard dictionary* that defines the actual semantics of the syntactic stack and expression datastructures (which only contain symbols, not the actual functions. Pickle some and see for yourself.) - -#### "There should be only one." - -Which brings me to talking about one of my hopes and dreams for this notation: "There should be only one." What I mean is that there should be one universal standard dictionary of commands, and all bespoke work done in a UI for purposes takes place by direct interaction and macros. There would be a *Grand Refactoring* biannually (two years, not six months, that's semi-annually) where any new definitions factored out of the usage and macros of the previous time, along with new algorithms and such, were entered into the dictionary and posted to e.g. IPFS. - -Code should not burgeon wildly, as it does today. The variety of code should map more-or-less to the well-factored variety of human computably-solvable problems. There shouldn't be dozens of chat apps, JS frameworks, programming languages. It's a waste of time, a [fractal "thundering herd" attack](https://en.wikipedia.org/wiki/Thundering_herd_problem) on human mentality. - -#### Literary Code Library - -If you read over the other notebooks you'll see that developing code in Joy is a lot like doing simple mathematics, and the descriptions of the code resemble math papers. The code also works the first time, no bugs. If you have any experience programming at all, you are probably skeptical, as I was, but it seems to work: deriving code mathematically seems to lead to fewer errors. - -But my point now is that this great ratio of textual explanation to wind up with code that consists of a few equations and could fit on an index card is highly desirable. Less code has fewer errors. The structure of Joy engenders a kind of thinking that seems to be very effective for developing structured processes. - -There seems to be an elegance and power to the notation. - - - -```python - -``` diff --git a/docs/0. This Implementation of Joy in Python.rst b/docs/0. This Implementation of Joy in Python.rst deleted file mode 100644 index 7515dcc..0000000 --- a/docs/0. This Implementation of Joy in Python.rst +++ /dev/null @@ -1,535 +0,0 @@ - -Joypy -===== - -Joy in Python -------------- - -This implementation is meant as a tool for exploring the programming -model and method of Joy. Python seems like a great implementation -language for Joy for several reasons. - -We can lean on the Python immutable types for our basic semantics and -types: ints, floats, strings, and tuples, which enforces functional -purity. We get garbage collection for free. Compilation via Cython. Glue -language with loads of libraries. - -`Read-Eval-Print Loop (REPL) `__ -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -The main way to interact with the Joy interpreter is through a simple -`REPL `__ -that you start by running the package: - -:: - - $ python -m joy - Joypy - Copyright © 2017 Simon Forman - This program comes with ABSOLUTELY NO WARRANTY; for details type "warranty". - This is free software, and you are welcome to redistribute it - under certain conditions; type "sharing" for details. - Type "words" to see a list of all words, and "[] help" to print the - docs for a word. - - - <-top - - joy? _ - -The ``<-top`` marker points to the top of the (initially empty) stack. -You can enter Joy notation at the prompt and a `trace of -evaluation <#The-TracePrinter.>`__ will be printed followed by the stack -and prompt again: - -:: - - joy? 23 sqr 18 + - . 23 sqr 18 + - 23 . sqr 18 + - 23 . dup mul 18 + - 23 23 . mul 18 + - 529 . 18 + - 529 18 . + - 547 . - - 547 <-top - - joy? - -Stacks (aka list, quote, sequence, etc.) -======================================== - -In Joy, in addition to the types Boolean, integer, float, and string, -there is a single sequence type represented by enclosing a sequence of -terms in brackets ``[...]``. This sequence type is used to represent -both the stack and the expression. It is a `cons -list `__ made from Python -tuples. - -.. code:: ipython2 - - import inspect - import joy.utils.stack - - - print inspect.getdoc(joy.utils.stack) - - -.. parsed-literal:: - - § Stack - - - When talking about Joy we use the terms "stack", "list", "sequence" and - "aggregate" to mean the same thing: a simple datatype that permits - certain operations such as iterating and pushing and popping values from - (at least) one end. - - We use the venerable two-tuple recursive form of sequences where the - empty tuple () is the empty stack and (head, rest) gives the recursive - form of a stack with one or more items on it. - - () - (1, ()) - (2, (1, ())) - (3, (2, (1, ()))) - ... - - And so on. - - - We have two very simple functions to build up a stack from a Python - iterable and also to iterate through a stack and yield its items - one-by-one in order, and two functions to generate string representations - of stacks: - - list_to_stack() - - iter_stack() - - expression_to_string() (prints left-to-right) - - stack_to_string() (prints right-to-left) - - - A word about the stack data structure. - - Python has very nice "tuple packing and unpacking" in its syntax which - means we can directly "unpack" the expected arguments to a Joy function. - - For example: - - def dup(stack): - head, tail = stack - return head, (head, tail) - - We replace the argument "stack" by the expected structure of the stack, - in this case "(head, tail)", and Python takes care of de-structuring the - incoming argument and assigning values to the names. Note that Python - syntax doesn't require parentheses around tuples used in expressions - where they would be redundant. - - -The utility functions maintain order. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -The 0th item in the list will be on the top of the stack and *vise -versa*. - -.. code:: ipython2 - - joy.utils.stack.list_to_stack([1, 2, 3]) - - - - -.. parsed-literal:: - - (1, (2, (3, ()))) - - - -.. code:: ipython2 - - list(joy.utils.stack.iter_stack((1, (2, (3, ()))))) - - - - -.. parsed-literal:: - - [1, 2, 3] - - - -This requires reversing the sequence (or iterating backwards) otherwise: - -.. code:: ipython2 - - stack = () - - for n in [1, 2, 3]: - stack = n, stack - - print stack - print list(joy.utils.stack.iter_stack(stack)) - - -.. parsed-literal:: - - (3, (2, (1, ()))) - [3, 2, 1] - - -Purely Functional Datastructures. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Because Joy lists are made out of Python tuples they are immutable, so -all Joy datastructures are *`purely -functional `__*. - -The ``joy()`` function. -======================= - -An Interpreter --------------- - -The ``joy()`` function is extrememly simple. It accepts a stack, an -expression, and a dictionary, and it iterates through the expression -putting values onto the stack and delegating execution to functions it -looks up in the dictionary. - -Each function is passed the stack, expression, and dictionary and -returns them. Whatever the function returns becomes the new stack, -expression, and dictionary. (The dictionary is passed to enable e.g. -writing words that let you enter new words into the dictionary at -runtime, which nothing does yet and may be a bad idea, and the ``help`` -command.) - -.. code:: ipython2 - - import joy.joy - - print inspect.getsource(joy.joy.joy) - - -.. parsed-literal:: - - def joy(stack, expression, dictionary, viewer=None): - ''' - Evaluate the Joy expression on the stack. - ''' - while expression: - - if viewer: viewer(stack, expression) - - term, expression = expression - if isinstance(term, Symbol): - term = dictionary[term] - stack, expression, dictionary = term(stack, expression, dictionary) - else: - stack = term, stack - - if viewer: viewer(stack, expression) - return stack, expression, dictionary - - - -View function -~~~~~~~~~~~~~ - -The ``joy()`` function accepts a "viewer" function which it calls on -each iteration passing the current stack and expression just before -evaluation. This can be used for tracing, breakpoints, retrying after -exceptions, or interrupting an evaluation and saving to disk or sending -over the network to resume later. The stack and expression together -contain all the state of the computation at each step. - -The ``TracePrinter``. -~~~~~~~~~~~~~~~~~~~~~ - -A ``viewer`` records each step of the evaluation of a Joy program. The -``TracePrinter`` has a facility for printing out a trace of the -evaluation, one line per step. Each step is aligned to the current -interpreter position, signified by a period separating the stack on the -left from the pending expression ("continuation") on the right. - -`Continuation-Passing Style `__ -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -One day I thought, What happens if you rewrite Joy to use -`CSP `__? I -made all the functions accept and return the expression as well as the -stack and found that all the combinators could be rewritten to work by -modifying the expression rather than making recursive calls to the -``joy()`` function. - -Parser -====== - -.. code:: ipython2 - - import joy.parser - - print inspect.getdoc(joy.parser) - - -.. parsed-literal:: - - § Converting text to a joy expression. - - This module exports a single function: - - text_to_expression(text) - - As well as a single Symbol class and a single Exception type: - - ParseError - - When supplied with a string this function returns a Python datastructure - that represents the Joy datastructure described by the text expression. - Any unbalanced square brackets will raise a ParseError. - - -The parser is extremely simple, the undocumented ``re.Scanner`` class -does most of the tokenizing work and then you just build the tuple -structure out of the tokens. There's no Abstract Syntax Tree or anything -like that. - -.. code:: ipython2 - - print inspect.getsource(joy.parser._parse) - - -.. parsed-literal:: - - def _parse(tokens): - ''' - Return a stack/list expression of the tokens. - ''' - frame = [] - stack = [] - for tok in tokens: - if tok == '[': - stack.append(frame) - frame = [] - stack[-1].append(frame) - elif tok == ']': - try: - frame = stack.pop() - except IndexError: - raise ParseError('One or more extra closing brackets.') - frame[-1] = list_to_stack(frame[-1]) - else: - frame.append(tok) - if stack: - raise ParseError('One or more unclosed brackets.') - return list_to_stack(frame) - - - -That's pretty much all there is to it. - -.. code:: ipython2 - - joy.parser.text_to_expression('1 2 3 4 5') # A simple sequence. - - - - -.. parsed-literal:: - - (1, (2, (3, (4, (5, ()))))) - - - -.. code:: ipython2 - - joy.parser.text_to_expression('[1 2 3] 4 5') # Three items, the first is a list with three items - - - - -.. parsed-literal:: - - ((1, (2, (3, ()))), (4, (5, ()))) - - - -.. code:: ipython2 - - joy.parser.text_to_expression('1 23 ["four" [-5.0] cons] 8888') # A mixed bag. cons is - # a Symbol, no lookup at - # parse-time. Haiku docs. - - - - -.. parsed-literal:: - - (1, (23, (('four', ((-5.0, ()), (cons, ()))), (8888, ())))) - - - -.. code:: ipython2 - - joy.parser.text_to_expression('[][][][][]') # Five empty lists. - - - - -.. parsed-literal:: - - ((), ((), ((), ((), ((), ()))))) - - - -.. code:: ipython2 - - joy.parser.text_to_expression('[[[[[]]]]]') # Five nested lists. - - - - -.. parsed-literal:: - - ((((((), ()), ()), ()), ()), ()) - - - -Library -======= - -The Joy library of functions (aka commands, or "words" after Forth -usage) encapsulates all the actual functionality (no pun intended) of -the Joy system. There are simple functions such as addition ``add`` (or -``+``, the library module supports aliases), and combinators which -provide control-flow and higher-order operations. - -.. code:: ipython2 - - import joy.library - - print ' '.join(sorted(joy.library.initialize())) - - -.. parsed-literal:: - - != % & * *fraction *fraction0 + ++ - -- / < << <= <> = > >= >> ? ^ add anamorphism and app1 app2 app3 average b binary branch choice clear cleave concat cons dinfrirst dip dipd dipdd disenstacken div down_to_zero dudipd dup dupd dupdip enstacken eq first flatten floordiv gcd ge genrec getitem gt help i id ifte infra le least_fraction loop lshift lt map min mod modulus mul ne neg not nullary or over pam parse pm pop popd popdd popop pow pred primrec product quoted range range_to_zero rem remainder remove rest reverse roll< roll> rolldown rollup rshift run second select sharing shunt size sqr sqrt stack step sub succ sum swaack swap swoncat swons ternary third times truediv truthy tuck unary uncons unit unquoted unstack void warranty while words x xor zip • - - -Many of the functions are defined in Python, like ``dip``: - -.. code:: ipython2 - - print inspect.getsource(joy.library.dip) - - -.. parsed-literal:: - - def dip(stack, expression, dictionary): - (quote, (x, stack)) = stack - expression = x, expression - return stack, pushback(quote, expression), dictionary - - - -Some functions are defined in equations in terms of other functions. -When the interpreter executes a definition function that function just -pushes its body expression onto the pending expression (the -continuation) and returns control to the interpreter. - -.. code:: ipython2 - - print joy.library.definitions - - -.. parsed-literal:: - - second == rest first - third == rest rest first - product == 1 swap [*] step - swons == swap cons - swoncat == swap concat - flatten == [] swap [concat] step - unit == [] cons - quoted == [unit] dip - unquoted == [i] dip - enstacken == stack [clear] dip - disenstacken == ? [uncons ?] loop pop - ? == dup truthy - dinfrirst == dip infra first - nullary == [stack] dinfrirst - unary == [stack [pop] dip] dinfrirst - binary == [stack [popop] dip] dinfrirst - ternary == [stack [popop pop] dip] dinfrirst - pam == [i] map - run == [] swap infra - sqr == dup mul - size == 0 swap [pop ++] step - cleave == [i] app2 [popd] dip - average == [sum 1.0 *] [size] cleave / - gcd == 1 [tuck modulus dup 0 >] loop pop - least_fraction == dup [gcd] infra [div] concat map - *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons - *fraction0 == concat [[swap] dip * [*] dip] infra - down_to_zero == [0 >] [dup --] while - range_to_zero == unit [down_to_zero] infra - anamorphism == [pop []] swap [dip swons] genrec - range == [0 <=] [1 - dup] anamorphism - while == swap [nullary] cons dup dipd concat loop - dudipd == dup dipd - primrec == [i] genrec - - - -Currently, there's no function to add new definitions to the dictionary -from "within" Joy code itself. Adding new definitions remains a -meta-interpreter action. You have to do it yourself, in Python, and wash -your hands afterward. - -It would be simple enough to define one, but it would open the door to -*name binding* and break the idea that all state is captured in the -stack and expression. There's an implicit *standard dictionary* that -defines the actual semantics of the syntactic stack and expression -datastructures (which only contain symbols, not the actual functions. -Pickle some and see for yourself.) - -"There should be only one." -^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Which brings me to talking about one of my hopes and dreams for this -notation: "There should be only one." What I mean is that there should -be one universal standard dictionary of commands, and all bespoke work -done in a UI for purposes takes place by direct interaction and macros. -There would be a *Grand Refactoring* biannually (two years, not six -months, that's semi-annually) where any new definitions factored out of -the usage and macros of the previous time, along with new algorithms and -such, were entered into the dictionary and posted to e.g. IPFS. - -Code should not burgeon wildly, as it does today. The variety of code -should map more-or-less to the well-factored variety of human -computably-solvable problems. There shouldn't be dozens of chat apps, JS -frameworks, programming languages. It's a waste of time, a `fractal -"thundering herd" -attack `__ on -human mentality. - -Literary Code Library -^^^^^^^^^^^^^^^^^^^^^ - -If you read over the other notebooks you'll see that developing code in -Joy is a lot like doing simple mathematics, and the descriptions of the -code resemble math papers. The code also works the first time, no bugs. -If you have any experience programming at all, you are probably -skeptical, as I was, but it seems to work: deriving code mathematically -seems to lead to fewer errors. - -But my point now is that this great ratio of textual explanation to wind -up with code that consists of a few equations and could fit on an index -card is highly desirable. Less code has fewer errors. The structure of -Joy engenders a kind of thinking that seems to be very effective for -developing structured processes. - -There seems to be an elegance and power to the notation. - diff --git a/docs/1. Basic Use of Joy in a Notebook.html b/docs/1. Basic Use of Joy in a Notebook.html deleted file mode 100644 index ef8d4b3..0000000 --- a/docs/1. Basic Use of Joy in a Notebook.html +++ /dev/null @@ -1,12079 +0,0 @@ - - - -1. Basic Use of Joy in a Notebook - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Preamble

First, import what we need.

- -
-
-
-
-
-
In [1]:
-
-
-
from joy.joy import run
-from joy.library import initialize
-from joy.utils.stack import stack_to_string
-from joy.utils.pretty_print import TracePrinter
-
- -
-
-
- -
-
-
-
-
-

Define a dictionary, an initial stack, and two helper functions to run Joy code and print results for us.

- -
-
-
-
-
-
In [2]:
-
-
-
D = initialize()
-S = ()
-
-
-def J(text):
-    print stack_to_string(run(text, S, D)[0])
-
-
-def V(text):
-    tp = TracePrinter()
-    run(text, S, D, tp.viewer)
-    tp.print_()
-
- -
-
-
- -
-
-
-
-
-

Run some simple programs

-
-
-
-
-
-
In [3]:
-
-
-
J('23 18 +')
-
- -
-
-
- -
-
- - -
- -
- - -
-
41
-
-
-
- -
-
- -
-
-
-
In [4]:
-
-
-
J('45 30 gcd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
15
-
-
-
- -
-
- -
-
-
-
-
-

With Viewer

A viewer records each step of the evaluation of a Joy program. The TracePrinter has a facility for printing out a trace of the evaluation, one line per step. Each step is aligned to the current interpreter position, signified by a period separating the stack on the left from the pending expression ("continuation") on the right. I find these traces beautiful, like a kind of art.

- -
-
-
-
-
-
In [5]:
-
-
-
V('23 18 +')
-
- -
-
-
- -
-
- - -
- -
- - -
-
      . 23 18 +
-   23 . 18 +
-23 18 . +
-   41 . 
-
-
-
- -
-
- -
-
-
-
In [6]:
-
-
-
V('45 30 gcd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                  . 45 30 gcd
-                               45 . 30 gcd
-                            45 30 . gcd
-                            45 30 . 1 [tuck modulus dup 0 >] loop pop
-                          45 30 1 . [tuck modulus dup 0 >] loop pop
-   45 30 1 [tuck modulus dup 0 >] . loop pop
-                            45 30 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                         30 45 30 . modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                            30 15 . dup 0 > [tuck modulus dup 0 >] loop pop
-                         30 15 15 . 0 > [tuck modulus dup 0 >] loop pop
-                       30 15 15 0 . > [tuck modulus dup 0 >] loop pop
-                       30 15 True . [tuck modulus dup 0 >] loop pop
-30 15 True [tuck modulus dup 0 >] . loop pop
-                            30 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                         15 30 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                             15 0 . dup 0 > [tuck modulus dup 0 >] loop pop
-                           15 0 0 . 0 > [tuck modulus dup 0 >] loop pop
-                         15 0 0 0 . > [tuck modulus dup 0 >] loop pop
-                       15 0 False . [tuck modulus dup 0 >] loop pop
-15 0 False [tuck modulus dup 0 >] . loop pop
-                             15 0 . pop
-                               15 . 
-
-
-
- -
-
- -
-
-
-
-
-

Here's a longer trace.

- -
-
-
-
-
-
In [7]:
-
-
-
V('96 27 gcd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                  . 96 27 gcd
-                               96 . 27 gcd
-                            96 27 . gcd
-                            96 27 . 1 [tuck modulus dup 0 >] loop pop
-                          96 27 1 . [tuck modulus dup 0 >] loop pop
-   96 27 1 [tuck modulus dup 0 >] . loop pop
-                            96 27 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                         27 96 27 . modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                            27 15 . dup 0 > [tuck modulus dup 0 >] loop pop
-                         27 15 15 . 0 > [tuck modulus dup 0 >] loop pop
-                       27 15 15 0 . > [tuck modulus dup 0 >] loop pop
-                       27 15 True . [tuck modulus dup 0 >] loop pop
-27 15 True [tuck modulus dup 0 >] . loop pop
-                            27 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                         15 27 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                            15 12 . dup 0 > [tuck modulus dup 0 >] loop pop
-                         15 12 12 . 0 > [tuck modulus dup 0 >] loop pop
-                       15 12 12 0 . > [tuck modulus dup 0 >] loop pop
-                       15 12 True . [tuck modulus dup 0 >] loop pop
-15 12 True [tuck modulus dup 0 >] . loop pop
-                            15 12 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                         12 15 12 . modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                             12 3 . dup 0 > [tuck modulus dup 0 >] loop pop
-                           12 3 3 . 0 > [tuck modulus dup 0 >] loop pop
-                         12 3 3 0 . > [tuck modulus dup 0 >] loop pop
-                        12 3 True . [tuck modulus dup 0 >] loop pop
- 12 3 True [tuck modulus dup 0 >] . loop pop
-                             12 3 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                           3 12 3 . modulus dup 0 > [tuck modulus dup 0 >] loop pop
-                              3 0 . dup 0 > [tuck modulus dup 0 >] loop pop
-                            3 0 0 . 0 > [tuck modulus dup 0 >] loop pop
-                          3 0 0 0 . > [tuck modulus dup 0 >] loop pop
-                        3 0 False . [tuck modulus dup 0 >] loop pop
- 3 0 False [tuck modulus dup 0 >] . loop pop
-                              3 0 . pop
-                                3 . 
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/1. Basic Use of Joy in a Notebook.ipynb b/docs/1. Basic Use of Joy in a Notebook.ipynb deleted file mode 100644 index 7c8f2a3..0000000 --- a/docs/1. Basic Use of Joy in a Notebook.ipynb +++ /dev/null @@ -1,240 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Preamble\n", - "\n", - "First, import what we need." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from joy.joy import run\n", - "from joy.library import initialize\n", - "from joy.utils.stack import stack_to_string\n", - "from joy.utils.pretty_print import TracePrinter" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Define a dictionary, an initial stack, and two helper functions to run Joy code and print results for us." - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [], - "source": [ - "D = initialize()\n", - "S = ()\n", - "\n", - "\n", - "def J(text):\n", - " print stack_to_string(run(text, S, D)[0])\n", - "\n", - "\n", - "def V(text):\n", - " tp = TracePrinter()\n", - " run(text, S, D, tp.viewer)\n", - " tp.print_()" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Run some simple programs" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "41\n" - ] - } - ], - "source": [ - "J('23 18 +')" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "15\n" - ] - } - ], - "source": [ - "J('45 30 gcd')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### With Viewer\n", - "\n", - "A `viewer` records each step of the evaluation of a Joy program. The `TracePrinter` has a facility for printing out a trace of the evaluation, one line per step. Each step is aligned to the current interpreter position, signified by a period separating the stack on the left from the pending expression (\"continuation\") on the right. I find these traces beautiful, like a kind of art." - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 23 18 +\n", - " 23 . 18 +\n", - "23 18 . +\n", - " 41 . \n" - ] - } - ], - "source": [ - "V('23 18 +')" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 45 30 gcd\n", - " 45 . 30 gcd\n", - " 45 30 . gcd\n", - " 45 30 . 1 [tuck modulus dup 0 >] loop pop\n", - " 45 30 1 . [tuck modulus dup 0 >] loop pop\n", - " 45 30 1 [tuck modulus dup 0 >] . loop pop\n", - " 45 30 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 30 45 30 . modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 30 15 . dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 30 15 15 . 0 > [tuck modulus dup 0 >] loop pop\n", - " 30 15 15 0 . > [tuck modulus dup 0 >] loop pop\n", - " 30 15 True . [tuck modulus dup 0 >] loop pop\n", - "30 15 True [tuck modulus dup 0 >] . loop pop\n", - " 30 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 30 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 0 . dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 0 0 . 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 0 0 0 . > [tuck modulus dup 0 >] loop pop\n", - " 15 0 False . [tuck modulus dup 0 >] loop pop\n", - "15 0 False [tuck modulus dup 0 >] . loop pop\n", - " 15 0 . pop\n", - " 15 . \n" - ] - } - ], - "source": [ - "V('45 30 gcd')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Here's a longer trace." - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 96 27 gcd\n", - " 96 . 27 gcd\n", - " 96 27 . gcd\n", - " 96 27 . 1 [tuck modulus dup 0 >] loop pop\n", - " 96 27 1 . [tuck modulus dup 0 >] loop pop\n", - " 96 27 1 [tuck modulus dup 0 >] . loop pop\n", - " 96 27 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 27 96 27 . modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 27 15 . dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 27 15 15 . 0 > [tuck modulus dup 0 >] loop pop\n", - " 27 15 15 0 . > [tuck modulus dup 0 >] loop pop\n", - " 27 15 True . [tuck modulus dup 0 >] loop pop\n", - "27 15 True [tuck modulus dup 0 >] . loop pop\n", - " 27 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 27 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 12 . dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 12 12 . 0 > [tuck modulus dup 0 >] loop pop\n", - " 15 12 12 0 . > [tuck modulus dup 0 >] loop pop\n", - " 15 12 True . [tuck modulus dup 0 >] loop pop\n", - "15 12 True [tuck modulus dup 0 >] . loop pop\n", - " 15 12 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 12 15 12 . modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 12 3 . dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 12 3 3 . 0 > [tuck modulus dup 0 >] loop pop\n", - " 12 3 3 0 . > [tuck modulus dup 0 >] loop pop\n", - " 12 3 True . [tuck modulus dup 0 >] loop pop\n", - " 12 3 True [tuck modulus dup 0 >] . loop pop\n", - " 12 3 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 3 12 3 . modulus dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 3 0 . dup 0 > [tuck modulus dup 0 >] loop pop\n", - " 3 0 0 . 0 > [tuck modulus dup 0 >] loop pop\n", - " 3 0 0 0 . > [tuck modulus dup 0 >] loop pop\n", - " 3 0 False . [tuck modulus dup 0 >] loop pop\n", - " 3 0 False [tuck modulus dup 0 >] . loop pop\n", - " 3 0 . pop\n", - " 3 . \n" - ] - } - ], - "source": [ - "V('96 27 gcd')" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/1. Basic Use of Joy in a Notebook.md b/docs/1. Basic Use of Joy in a Notebook.md deleted file mode 100644 index a46ae6a..0000000 --- a/docs/1. Basic Use of Joy in a Notebook.md +++ /dev/null @@ -1,137 +0,0 @@ - -### Preamble - -First, import what we need. - - -```python -from joy.joy import run -from joy.library import initialize -from joy.utils.stack import stack_to_string -from joy.utils.pretty_print import TracePrinter -``` - -Define a dictionary, an initial stack, and two helper functions to run Joy code and print results for us. - - -```python -D = initialize() -S = () - - -def J(text): - print stack_to_string(run(text, S, D)[0]) - - -def V(text): - tp = TracePrinter() - run(text, S, D, tp.viewer) - tp.print_() -``` - -### Run some simple programs - - -```python -J('23 18 +') -``` - - 41 - - - -```python -J('45 30 gcd') -``` - - 15 - - -### With Viewer - -A `viewer` records each step of the evaluation of a Joy program. The `TracePrinter` has a facility for printing out a trace of the evaluation, one line per step. Each step is aligned to the current interpreter position, signified by a period separating the stack on the left from the pending expression ("continuation") on the right. I find these traces beautiful, like a kind of art. - - -```python -V('23 18 +') -``` - - . 23 18 + - 23 . 18 + - 23 18 . + - 41 . - - - -```python -V('45 30 gcd') -``` - - . 45 30 gcd - 45 . 30 gcd - 45 30 . gcd - 45 30 . 1 [tuck modulus dup 0 >] loop pop - 45 30 1 . [tuck modulus dup 0 >] loop pop - 45 30 1 [tuck modulus dup 0 >] . loop pop - 45 30 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 30 45 30 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 30 15 . dup 0 > [tuck modulus dup 0 >] loop pop - 30 15 15 . 0 > [tuck modulus dup 0 >] loop pop - 30 15 15 0 . > [tuck modulus dup 0 >] loop pop - 30 15 True . [tuck modulus dup 0 >] loop pop - 30 15 True [tuck modulus dup 0 >] . loop pop - 30 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 30 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 0 . dup 0 > [tuck modulus dup 0 >] loop pop - 15 0 0 . 0 > [tuck modulus dup 0 >] loop pop - 15 0 0 0 . > [tuck modulus dup 0 >] loop pop - 15 0 False . [tuck modulus dup 0 >] loop pop - 15 0 False [tuck modulus dup 0 >] . loop pop - 15 0 . pop - 15 . - - -Here's a longer trace. - - -```python -V('96 27 gcd') -``` - - . 96 27 gcd - 96 . 27 gcd - 96 27 . gcd - 96 27 . 1 [tuck modulus dup 0 >] loop pop - 96 27 1 . [tuck modulus dup 0 >] loop pop - 96 27 1 [tuck modulus dup 0 >] . loop pop - 96 27 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 27 96 27 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 27 15 . dup 0 > [tuck modulus dup 0 >] loop pop - 27 15 15 . 0 > [tuck modulus dup 0 >] loop pop - 27 15 15 0 . > [tuck modulus dup 0 >] loop pop - 27 15 True . [tuck modulus dup 0 >] loop pop - 27 15 True [tuck modulus dup 0 >] . loop pop - 27 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 27 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 12 . dup 0 > [tuck modulus dup 0 >] loop pop - 15 12 12 . 0 > [tuck modulus dup 0 >] loop pop - 15 12 12 0 . > [tuck modulus dup 0 >] loop pop - 15 12 True . [tuck modulus dup 0 >] loop pop - 15 12 True [tuck modulus dup 0 >] . loop pop - 15 12 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 12 15 12 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 12 3 . dup 0 > [tuck modulus dup 0 >] loop pop - 12 3 3 . 0 > [tuck modulus dup 0 >] loop pop - 12 3 3 0 . > [tuck modulus dup 0 >] loop pop - 12 3 True . [tuck modulus dup 0 >] loop pop - 12 3 True [tuck modulus dup 0 >] . loop pop - 12 3 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 3 12 3 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 3 0 . dup 0 > [tuck modulus dup 0 >] loop pop - 3 0 0 . 0 > [tuck modulus dup 0 >] loop pop - 3 0 0 0 . > [tuck modulus dup 0 >] loop pop - 3 0 False . [tuck modulus dup 0 >] loop pop - 3 0 False [tuck modulus dup 0 >] . loop pop - 3 0 . pop - 3 . - diff --git a/docs/1. Basic Use of Joy in a Notebook.rst b/docs/1. Basic Use of Joy in a Notebook.rst deleted file mode 100644 index 15f23e3..0000000 --- a/docs/1. Basic Use of Joy in a Notebook.rst +++ /dev/null @@ -1,154 +0,0 @@ - -Preamble -~~~~~~~~ - -First, import what we need. - -.. code:: ipython2 - - from joy.joy import run - from joy.library import initialize - from joy.utils.stack import stack_to_string - from joy.utils.pretty_print import TracePrinter - -Define a dictionary, an initial stack, and two helper functions to run -Joy code and print results for us. - -.. code:: ipython2 - - D = initialize() - S = () - - - def J(text): - print stack_to_string(run(text, S, D)[0]) - - - def V(text): - tp = TracePrinter() - run(text, S, D, tp.viewer) - tp.print_() - -Run some simple programs -~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 18 +') - - -.. parsed-literal:: - - 41 - - -.. code:: ipython2 - - J('45 30 gcd') - - -.. parsed-literal:: - - 15 - - -With Viewer -~~~~~~~~~~~ - -A ``viewer`` records each step of the evaluation of a Joy program. The -``TracePrinter`` has a facility for printing out a trace of the -evaluation, one line per step. Each step is aligned to the current -interpreter position, signified by a period separating the stack on the -left from the pending expression ("continuation") on the right. I find -these traces beautiful, like a kind of art. - -.. code:: ipython2 - - V('23 18 +') - - -.. parsed-literal:: - - . 23 18 + - 23 . 18 + - 23 18 . + - 41 . - - -.. code:: ipython2 - - V('45 30 gcd') - - -.. parsed-literal:: - - . 45 30 gcd - 45 . 30 gcd - 45 30 . gcd - 45 30 . 1 [tuck modulus dup 0 >] loop pop - 45 30 1 . [tuck modulus dup 0 >] loop pop - 45 30 1 [tuck modulus dup 0 >] . loop pop - 45 30 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 30 45 30 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 30 15 . dup 0 > [tuck modulus dup 0 >] loop pop - 30 15 15 . 0 > [tuck modulus dup 0 >] loop pop - 30 15 15 0 . > [tuck modulus dup 0 >] loop pop - 30 15 True . [tuck modulus dup 0 >] loop pop - 30 15 True [tuck modulus dup 0 >] . loop pop - 30 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 30 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 0 . dup 0 > [tuck modulus dup 0 >] loop pop - 15 0 0 . 0 > [tuck modulus dup 0 >] loop pop - 15 0 0 0 . > [tuck modulus dup 0 >] loop pop - 15 0 False . [tuck modulus dup 0 >] loop pop - 15 0 False [tuck modulus dup 0 >] . loop pop - 15 0 . pop - 15 . - - -Here's a longer trace. - -.. code:: ipython2 - - V('96 27 gcd') - - -.. parsed-literal:: - - . 96 27 gcd - 96 . 27 gcd - 96 27 . gcd - 96 27 . 1 [tuck modulus dup 0 >] loop pop - 96 27 1 . [tuck modulus dup 0 >] loop pop - 96 27 1 [tuck modulus dup 0 >] . loop pop - 96 27 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 27 96 27 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 27 15 . dup 0 > [tuck modulus dup 0 >] loop pop - 27 15 15 . 0 > [tuck modulus dup 0 >] loop pop - 27 15 15 0 . > [tuck modulus dup 0 >] loop pop - 27 15 True . [tuck modulus dup 0 >] loop pop - 27 15 True [tuck modulus dup 0 >] . loop pop - 27 15 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 27 15 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 15 12 . dup 0 > [tuck modulus dup 0 >] loop pop - 15 12 12 . 0 > [tuck modulus dup 0 >] loop pop - 15 12 12 0 . > [tuck modulus dup 0 >] loop pop - 15 12 True . [tuck modulus dup 0 >] loop pop - 15 12 True [tuck modulus dup 0 >] . loop pop - 15 12 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 12 15 12 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 12 3 . dup 0 > [tuck modulus dup 0 >] loop pop - 12 3 3 . 0 > [tuck modulus dup 0 >] loop pop - 12 3 3 0 . > [tuck modulus dup 0 >] loop pop - 12 3 True . [tuck modulus dup 0 >] loop pop - 12 3 True [tuck modulus dup 0 >] . loop pop - 12 3 . tuck modulus dup 0 > [tuck modulus dup 0 >] loop pop - 3 12 3 . modulus dup 0 > [tuck modulus dup 0 >] loop pop - 3 0 . dup 0 > [tuck modulus dup 0 >] loop pop - 3 0 0 . 0 > [tuck modulus dup 0 >] loop pop - 3 0 0 0 . > [tuck modulus dup 0 >] loop pop - 3 0 False . [tuck modulus dup 0 >] loop pop - 3 0 False [tuck modulus dup 0 >] . loop pop - 3 0 . pop - 3 . - diff --git a/docs/2. Library Examples.html b/docs/2. Library Examples.html deleted file mode 100644 index 5e4a892..0000000 --- a/docs/2. Library Examples.html +++ /dev/null @@ -1,16523 +0,0 @@ - - - -2. Library Examples - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Examples (and some documentation) for the Words in the Library

-
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import J, V
-
- -
-
-
- -
-
-
-
-
-

Stack Chatter

This is what I like to call the functions that just rearrange things on the stack. (One thing I want to mention is that during a hypothetical compilation phase these "stack chatter" words effectively disappear, because we can map the logical stack locations to registers that remain static for the duration of the computation. This remains to be done but it's "off the shelf" technology.)

- -
-
-
-
-
-
-
-

clear

-
-
-
-
-
-
In [2]:
-
-
-
J('1 2 3 clear')
-
- -
-
-
- -
-
- - -
- -
- - -
-
-
-
-
- -
-
- -
-
-
-
-
-

dup dupd

-
-
-
-
-
-
In [3]:
-
-
-
J('1 2 3 dup')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 3
-
-
-
- -
-
- -
-
-
-
In [4]:
-
-
-
J('1 2 3 dupd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 2 3
-
-
-
- -
-
- -
-
-
-
-
-

enstacken disenstacken stack unstack

(I may have these paired up wrong. I.e. disenstacken should be unstack and vice versa.)

- -
-
-
-
-
-
In [5]:
-
-
-
J('1 2 3 enstacken') # Replace the stack with a quote of itself.
-
- -
-
-
- -
-
- - -
- -
- - -
-
[3 2 1]
-
-
-
- -
-
- -
-
-
-
In [6]:
-
-
-
J('4 5 6 [3 2 1] disenstacken')  # Unpack a list onto the stack.
-
- -
-
-
- -
-
- - -
- -
- - -
-
4 5 6 3 2 1
-
-
-
- -
-
- -
-
-
-
In [7]:
-
-
-
J('1 2 3 stack')  # Get the stack on the stack.
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 [3 2 1]
-
-
-
- -
-
- -
-
-
-
In [8]:
-
-
-
J('1 2 3 [4 5 6] unstack')  # Replace the stack with the list on top.
-                            # The items appear reversed but they are not,
-                            # 4 is on the top of both the list and the stack.
-
- -
-
-
- -
-
- - -
- -
- - -
-
6 5 4
-
-
-
- -
-
- -
-
-
-
-
-

pop popd popop

-
-
-
-
-
-
In [9]:
-
-
-
J('1 2 3 pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2
-
-
-
- -
-
- -
-
-
-
In [10]:
-
-
-
J('1 2 3 popd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 3
-
-
-
- -
-
- -
-
-
-
In [11]:
-
-
-
J('1 2 3 popop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1
-
-
-
- -
-
- -
-
-
-
-
-

roll< rolldown roll> rollup

The "down" and "up" refer to the movement of two of the top three items (displacing the third.)

- -
-
-
-
-
-
In [12]:
-
-
-
J('1 2 3 roll<')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2 3 1
-
-
-
- -
-
- -
-
-
-
In [13]:
-
-
-
J('1 2 3 roll>')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 1 2
-
-
-
- -
-
- -
-
-
-
-
-

swap

-
-
-
-
-
-
In [14]:
-
-
-
J('1 2 3 swap')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 3 2
-
-
-
- -
-
- -
-
-
-
-
-

tuck over

-
-
-
-
-
-
In [15]:
-
-
-
J('1 2 3 tuck')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 3 2 3
-
-
-
- -
-
- -
-
-
-
In [16]:
-
-
-
J('1 2 3 over')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 2
-
-
-
- -
-
- -
-
-
-
-
-

unit quoted unquoted

-
-
-
-
-
-
In [17]:
-
-
-
J('1 2 3 unit')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 [3]
-
-
-
- -
-
- -
-
-
-
In [18]:
-
-
-
J('1 2 3 quoted')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 [2] 3
-
-
-
- -
-
- -
-
-
-
In [19]:
-
-
-
J('1 [2] 3 unquoted')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3
-
-
-
- -
-
- -
-
-
-
In [20]:
-
-
-
V('1 [dup] 3 unquoted')  # Unquoting evaluates.  Be aware.
-
- -
-
-
- -
-
- - -
- -
- - -
-
              . 1 [dup] 3 unquoted
-            1 . [dup] 3 unquoted
-      1 [dup] . 3 unquoted
-    1 [dup] 3 . unquoted
-    1 [dup] 3 . [i] dip
-1 [dup] 3 [i] . dip
-      1 [dup] . i 3
-            1 . dup 3
-          1 1 . 3
-        1 1 3 . 
-
-
-
- -
-
- -
-
-
-
-
-

List words

-
-
-
-
-
-
-
-

concat swoncat shunt

-
-
-
-
-
-
In [21]:
-
-
-
J('[1 2 3] [4 5 6] concat')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 2 3 4 5 6]
-
-
-
- -
-
- -
-
-
-
In [22]:
-
-
-
J('[1 2 3] [4 5 6] swoncat')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[4 5 6 1 2 3]
-
-
-
- -
-
- -
-
-
-
In [23]:
-
-
-
J('[1 2 3] [4 5 6] shunt')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[6 5 4 1 2 3]
-
-
-
- -
-
- -
-
-
-
-
-

cons swons uncons

-
-
-
-
-
-
In [24]:
-
-
-
J('1 [2 3] cons')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 2 3]
-
-
-
- -
-
- -
-
-
-
In [25]:
-
-
-
J('[2 3] 1 swons')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 2 3]
-
-
-
- -
-
- -
-
-
-
In [26]:
-
-
-
J('[1 2 3] uncons')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 [2 3]
-
-
-
- -
-
- -
-
-
-
-
-

first second third rest

-
-
-
-
-
-
In [27]:
-
-
-
J('[1 2 3 4] first')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1
-
-
-
- -
-
- -
-
-
-
In [28]:
-
-
-
J('[1 2 3 4] second')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
In [29]:
-
-
-
J('[1 2 3 4] third')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3
-
-
-
- -
-
- -
-
-
-
In [30]:
-
-
-
J('[1 2 3 4] rest')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[2 3 4]
-
-
-
- -
-
- -
-
-
-
-
-

flatten

-
-
-
-
-
-
In [31]:
-
-
-
J('[[1] [2 [3] 4] [5 6]] flatten')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 2 [3] 4 5 6]
-
-
-
- -
-
- -
-
-
-
-
-

getitem at of drop take

at and getitem are the same function. of == swap at

- -
-
-
-
-
-
In [32]:
-
-
-
J('[10 11 12 13 14] 2 getitem')
-
- -
-
-
- -
-
- - -
- -
- - -
-
12
-
-
-
- -
-
- -
-
-
-
In [33]:
-
-
-
J('[1 2 3 4] 0 at')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1
-
-
-
- -
-
- -
-
-
-
In [34]:
-
-
-
J('2 [1 2 3 4] of')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3
-
-
-
- -
-
- -
-
-
-
In [35]:
-
-
-
J('[1 2 3 4] 2 drop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[3 4]
-
-
-
- -
-
- -
-
-
-
In [36]:
-
-
-
J('[1 2 3 4] 2 take')  # reverses the order
-
- -
-
-
- -
-
- - -
- -
- - -
-
[2 1]
-
-
-
- -
-
- -
-
-
-
-
-

reverse could be defines as reverse == dup size take

- -
-
-
-
-
-
-
-

remove

-
-
-
-
-
-
In [37]:
-
-
-
J('[1 2 3 1 4] 1 remove')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[2 3 1 4]
-
-
-
- -
-
- -
-
-
-
-
-

reverse

-
-
-
-
-
-
In [38]:
-
-
-
J('[1 2 3 4] reverse')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[4 3 2 1]
-
-
-
- -
-
- -
-
-
-
-
-

size

-
-
-
-
-
-
In [39]:
-
-
-
J('[1 1 1 1] size')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4
-
-
-
- -
-
- -
-
-
-
-
-

swaack

"Swap stack" swap the list on the top of the stack for the stack, and put the old stack on top of the new one. Think of it as a context switch. Niether of the lists/stacks change their order.

- -
-
-
-
-
-
In [40]:
-
-
-
J('1 2 3 [4 5 6] swaack')
-
- -
-
-
- -
-
- - -
- -
- - -
-
6 5 4 [3 2 1]
-
-
-
- -
-
- -
-
-
-
-
-

choice select

-
-
-
-
-
-
In [41]:
-
-
-
J('23 9 1 choice')
-
- -
-
-
- -
-
- - -
- -
- - -
-
9
-
-
-
- -
-
- -
-
-
-
In [42]:
-
-
-
J('23 9 0 choice')
-
- -
-
-
- -
-
- - -
- -
- - -
-
23
-
-
-
- -
-
- -
-
-
-
In [43]:
-
-
-
J('[23 9 7] 1 select')  # select is basically getitem, should retire it?
-
- -
-
-
- -
-
- - -
- -
- - -
-
9
-
-
-
- -
-
- -
-
-
-
In [44]:
-
-
-
J('[23 9 7] 0 select')
-
- -
-
-
- -
-
- - -
- -
- - -
-
23
-
-
-
- -
-
- -
-
-
-
-
-

zip

-
-
-
-
-
-
In [45]:
-
-
-
J('[1 2 3] [6 5 4] zip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[[6 1] [5 2] [4 3]]
-
-
-
- -
-
- -
-
-
-
In [46]:
-
-
-
J('[1 2 3] [6 5 4] zip [sum] map')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[7 7 7]
-
-
-
- -
-
- -
-
-
-
-
-

Math words

-
-
-
-
-
-
-
-

+ add

-
-
-
-
-
-
In [47]:
-
-
-
J('23 9 +')
-
- -
-
-
- -
-
- - -
- -
- - -
-
32
-
-
-
- -
-
- -
-
-
-
-
-

- sub

-
-
-
-
-
-
In [48]:
-
-
-
J('23 9 -')
-
- -
-
-
- -
-
- - -
- -
- - -
-
14
-
-
-
- -
-
- -
-
-
-
-
-

* mul

-
-
-
-
-
-
In [49]:
-
-
-
J('23 9 *')
-
- -
-
-
- -
-
- - -
- -
- - -
-
207
-
-
-
- -
-
- -
-
-
-
-
-

/ div floordiv truediv

-
-
-
-
-
-
In [50]:
-
-
-
J('23 9 /')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2.5555555555555554
-
-
-
- -
-
- -
-
-
-
In [51]:
-
-
-
J('23 -9 truediv')
-
- -
-
-
- -
-
- - -
- -
- - -
-
-2.5555555555555554
-
-
-
- -
-
- -
-
-
-
In [52]:
-
-
-
J('23 9 div')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
In [53]:
-
-
-
J('23 9 floordiv')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
In [54]:
-
-
-
J('23 -9 div')
-
- -
-
-
- -
-
- - -
- -
- - -
-
-3
-
-
-
- -
-
- -
-
-
-
In [55]:
-
-
-
J('23 -9 floordiv')
-
- -
-
-
- -
-
- - -
- -
- - -
-
-3
-
-
-
- -
-
- -
-
-
-
-
-

% mod modulus rem remainder

-
-
-
-
-
-
In [56]:
-
-
-
J('23 9 %')
-
- -
-
-
- -
-
- - -
- -
- - -
-
5
-
-
-
- -
-
- -
-
-
-
-
-

neg

-
-
-
-
-
-
In [57]:
-
-
-
J('23 neg -5 neg')
-
- -
-
-
- -
-
- - -
- -
- - -
-
-23 5
-
-
-
- -
-
- -
-
-
-
-
-

pow

-
-
-
-
-
-
In [58]:
-
-
-
J('2 10 pow')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1024
-
-
-
- -
-
- -
-
-
-
-
-

sqr sqrt

-
-
-
-
-
-
In [59]:
-
-
-
J('23 sqr')
-
- -
-
-
- -
-
- - -
- -
- - -
-
529
-
-
-
- -
-
- -
-
-
-
In [60]:
-
-
-
J('23 sqrt')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4.795831523312719
-
-
-
- -
-
- -
-
-
-
-
-

++ succ -- pred

-
-
-
-
-
-
In [61]:
-
-
-
J('1 ++')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
In [62]:
-
-
-
J('1 --')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0
-
-
-
- -
-
- -
-
-
-
-
-

<< lshift >> rshift

-
-
-
-
-
-
In [63]:
-
-
-
J('8 1 <<')
-
- -
-
-
- -
-
- - -
- -
- - -
-
16
-
-
-
- -
-
- -
-
-
-
In [64]:
-
-
-
J('8 1 >>')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4
-
-
-
- -
-
- -
-
-
-
-
-

average

-
-
-
-
-
-
In [65]:
-
-
-
J('[1 2 3 5] average')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2.75
-
-
-
- -
-
- -
-
-
-
-
-

range range_to_zero down_to_zero

-
-
-
-
-
-
In [66]:
-
-
-
J('5 range')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[4 3 2 1 0]
-
-
-
- -
-
- -
-
-
-
In [67]:
-
-
-
J('5 range_to_zero')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[0 1 2 3 4 5]
-
-
-
- -
-
- -
-
-
-
In [68]:
-
-
-
J('5 down_to_zero')
-
- -
-
-
- -
-
- - -
- -
- - -
-
5 4 3 2 1 0
-
-
-
- -
-
- -
-
-
-
-
-

product

-
-
-
-
-
-
In [69]:
-
-
-
J('[1 2 3 5] product')
-
- -
-
-
- -
-
- - -
- -
- - -
-
30
-
-
-
- -
-
- -
-
-
-
-
-

sum

-
-
-
-
-
-
In [70]:
-
-
-
J('[1 2 3 5] sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
11
-
-
-
- -
-
- -
-
-
-
-
-

min

-
-
-
-
-
-
In [71]:
-
-
-
J('[1 2 3 5] min')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1
-
-
-
- -
-
- -
-
-
-
-
-

gcd

-
-
-
-
-
-
In [72]:
-
-
-
J('45 30 gcd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
15
-
-
-
- -
-
- -
-
-
-
-
-

least_fraction

If we represent fractions as a quoted pair of integers [q d] this word reduces them to their ... least common factors or whatever.

- -
-
-
-
-
-
In [73]:
-
-
-
J('[45 30] least_fraction')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[3 2]
-
-
-
- -
-
- -
-
-
-
In [74]:
-
-
-
J('[23 12] least_fraction')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[23 12]
-
-
-
- -
-
- -
-
-
-
-
-

Logic and Comparison

-
-
-
-
-
-
-
-

? truthy

Get the Boolean value of the item on the top of the stack.

- -
-
-
-
-
-
In [75]:
-
-
-
J('23 truthy')
-
- -
-
-
- -
-
- - -
- -
- - -
-
True
-
-
-
- -
-
- -
-
-
-
In [76]:
-
-
-
J('[] truthy')  # Python semantics.
-
- -
-
-
- -
-
- - -
- -
- - -
-
False
-
-
-
- -
-
- -
-
-
-
In [77]:
-
-
-
J('0 truthy')
-
- -
-
-
- -
-
- - -
- -
- - -
-
False
-
-
-
- -
-
- -
-
-
-
-
- -
? == dup truthy
- -
-
-
-
-
-
In [78]:
-
-
-
V('23 ?')
-
- -
-
-
- -
-
- - -
- -
- - -
-
        . 23 ?
-     23 . ?
-     23 . dup truthy
-  23 23 . truthy
-23 True . 
-
-
-
- -
-
- -
-
-
-
In [79]:
-
-
-
J('[] ?')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[] False
-
-
-
- -
-
- -
-
-
-
In [80]:
-
-
-
J('0 ?')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0 False
-
-
-
- -
-
- -
-
-
-
-
-

& and

-
-
-
-
-
-
In [81]:
-
-
-
J('23 9 &')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1
-
-
-
- -
-
- -
-
-
-
-
-

!= <> ne

-
-
-
-
-
-
In [82]:
-
-
-
J('23 9 !=')
-
- -
-
-
- -
-
- - -
- -
- - -
-
True
-
-
-
- -
-
- -
-
-
-
-
-

The usual suspects:

-
    -
  • < lt
    • -
  • <= le
    • -
  • = eq
    • -
  • > gt
    • -
  • >= ge
    • -
  • not
    • -
  • or
    • -
- -
-
-
-
-
-
-
-

^ xor

-
-
-
-
-
-
In [83]:
-
-
-
J('1 1 ^')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0
-
-
-
- -
-
- -
-
-
-
In [84]:
-
-
-
J('1 0 ^')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1
-
-
-
- -
-
- -
-
-
-
-
-

Miscellaneous

-
-
-
-
-
-
-
-

help

-
-
-
-
-
-
In [85]:
-
-
-
J('[help] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
Accepts a quoted symbol on the top of the stack and prints its docs.
-
-
-
-
- -
-
- -
-
-
-
-
-

parse

-
-
-
-
-
-
In [86]:
-
-
-
J('[parse] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
Parse the string on the stack to a Joy expression.
-
-
-
-
- -
-
- -
-
-
-
In [87]:
-
-
-
J('1 "2 [3] dup" parse')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 [2 [3] dup]
-
-
-
- -
-
- -
-
-
-
-
-

run

Evaluate a quoted Joy sequence.

- -
-
-
-
-
-
In [88]:
-
-
-
J('[1 2 dup + +] run')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[5]
-
-
-
- -
-
- -
-
-
-
-
-

Combinators

-
-
-
-
-
-
-
-

app1 app2 app3

-
-
-
-
-
-
In [89]:
-
-
-
J('[app1] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
Given a quoted program on TOS and anything as the second stack item run
-the program and replace the two args with the first result of the
-program.
-
-            ... x [Q] . app1
-   -----------------------------------
-      ... [x ...] [Q] . infra first
-
-
-
-
- -
-
- -
-
-
-
In [90]:
-
-
-
J('10 4 [sqr *] app1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
10 160
-
-
-
- -
-
- -
-
-
-
In [91]:
-
-
-
J('10 3 4 [sqr *] app2')
-
- -
-
-
- -
-
- - -
- -
- - -
-
10 90 160
-
-
-
- -
-
- -
-
-
-
In [92]:
-
-
-
J('[app2] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
Like app1 with two items.
-
-       ... y x [Q] . app2
------------------------------------
-   ... [y ...] [Q] . infra first
-       [x ...] [Q]   infra first
-
-
-
-
- -
-
- -
-
-
-
In [93]:
-
-
-
J('10 2 3 4 [sqr *] app3')
-
- -
-
-
- -
-
- - -
- -
- - -
-
10 40 90 160
-
-
-
- -
-
- -
-
-
-
-
-

anamorphism

Given an initial value, a predicate function [P], and a generator function [G], the anamorphism combinator creates a sequence.

- -
   n [P] [G] anamorphism
----------------------------
-          [...]
-
-
-

Example, range:

- -
range == [0 <=] [1 - dup] anamorphism
- -
-
-
-
-
-
In [94]:
-
-
-
J('3 [0 <=] [1 - dup] anamorphism')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[2 1 0]
-
-
-
- -
-
- -
-
-
-
-
-

branch

-
-
-
-
-
-
In [95]:
-
-
-
J('3 4 1 [+] [*] branch')
-
- -
-
-
- -
-
- - -
- -
- - -
-
12
-
-
-
- -
-
- -
-
-
-
In [96]:
-
-
-
J('3 4 0 [+] [*] branch')
-
- -
-
-
- -
-
- - -
- -
- - -
-
7
-
-
-
- -
-
- -
-
-
-
-
-

cleave

-
... x [P] [Q] cleave
-
-
-

From the original Joy docs: "The cleave combinator expects two quotations, and below that an item x -It first executes [P], with x on top, and saves the top result element. -Then it executes [Q], again with x, and saves the top result. -Finally it restores the stack to what it was below x and pushes the two -results P(X) and Q(X)."

-

Note that P and Q can use items from the stack freely, since the stack (below x) is restored. cleave is a kind of parallel primitive, and it would make sense to create a version that uses, e.g. Python threads or something, to actually run P and Q concurrently. The current implementation of cleave is a definition in terms of app2:

- -
cleave == [i] app2 [popd] dip
- -
-
-
-
-
-
In [97]:
-
-
-
J('10 2 [+] [-] cleave')
-
- -
-
-
- -
-
- - -
- -
- - -
-
10 12 8
-
-
-
- -
-
- -
-
-
-
-
-

dip dipd dipdd

-
-
-
-
-
-
In [98]:
-
-
-
J('1 2 3 4 5 [+] dip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 7 5
-
-
-
- -
-
- -
-
-
-
In [99]:
-
-
-
J('1 2 3 4 5 [+] dipd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 5 4 5
-
-
-
- -
-
- -
-
-
-
In [100]:
-
-
-
J('1 2 3 4 5 [+] dipdd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 3 4 5
-
-
-
- -
-
- -
-
-
-
-
-

dupdip

Expects a quoted program [Q] on the stack and some item under it, dup the item and dip the quoted program under it.

- -
n [Q] dupdip == n Q n
- -
-
-
-
-
-
In [101]:
-
-
-
V('23 [++] dupdip *')  # N(N + 1)
-
- -
-
-
- -
-
- - -
- -
- - -
-
        . 23 [++] dupdip *
-     23 . [++] dupdip *
-23 [++] . dupdip *
-     23 . ++ 23 *
-     24 . 23 *
-  24 23 . *
-    552 . 
-
-
-
- -
-
- -
-
-
-
-
-

genrec primrec

-
-
-
-
-
-
In [102]:
-
-
-
J('[genrec] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
General Recursion Combinator.
-
-                        [if] [then] [rec1] [rec2] genrec
-  ---------------------------------------------------------------------
-     [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
-
-From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
-"The genrec combinator takes four program parameters in addition to
-whatever data parameters it needs. Fourth from the top is an if-part,
-followed by a then-part. If the if-part yields true, then the then-part
-is executed and the combinator terminates. The other two parameters are
-the rec1-part and the rec2-part. If the if-part yields false, the
-rec1-part is executed. Following that the four program parameters and
-the combinator are again pushed onto the stack bundled up in a quoted
-form. Then the rec2-part is executed, where it will find the bundled
-form. Typically it will then execute the bundled form, either with i or
-with app2, or some other combinator."
-
-The way to design one of these is to fix your base case [then] and the
-test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
-a quotation of the whole function.
-
-For example, given a (general recursive) function 'F':
-
-    F == [I] [T] [R1] [R2] genrec
-
-If the [I] if-part fails you must derive R1 and R2 from:
-
-    ... R1 [F] R2
-
-Just set the stack arguments in front, and figure out what R1 and R2
-have to do to apply the quoted [F] in the proper way.  In effect, the
-genrec combinator turns into an ifte combinator with a quoted copy of
-the original definition in the else-part:
-
-    F == [I] [T] [R1]   [R2] genrec
-      == [I] [T] [R1 [F] R2] ifte
-
-(Primitive recursive functions are those where R2 == i.
-
-    P == [I] [T] [R] primrec
-      == [I] [T] [R [P] i] ifte
-      == [I] [T] [R P] ifte
-)
-
-
-
-
- -
-
- -
-
-
-
In [103]:
-
-
-
J('3 [1 <=] [] [dup --] [i *] genrec')
-
- -
-
-
- -
-
- - -
- -
- - -
-
6
-
-
-
- -
-
- -
-
-
-
-
-

i

-
-
-
-
-
-
In [104]:
-
-
-
V('1 2 3 [+ +] i')
-
- -
-
-
- -
-
- - -
- -
- - -
-
            . 1 2 3 [+ +] i
-          1 . 2 3 [+ +] i
-        1 2 . 3 [+ +] i
-      1 2 3 . [+ +] i
-1 2 3 [+ +] . i
-      1 2 3 . + +
-        1 5 . +
-          6 . 
-
-
-
- -
-
- -
-
-
-
-
-

ifte

-
[predicate] [then] [else] ifte
- -
-
-
-
-
-
In [105]:
-
-
-
J('1 2 [1] [+] [*] ifte')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3
-
-
-
- -
-
- -
-
-
-
In [106]:
-
-
-
J('1 2 [0] [+] [*] ifte')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
-
-

infra

-
-
-
-
-
-
In [107]:
-
-
-
V('1 2 3 [4 5 6] [* +] infra')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                    . 1 2 3 [4 5 6] [* +] infra
-                  1 . 2 3 [4 5 6] [* +] infra
-                1 2 . 3 [4 5 6] [* +] infra
-              1 2 3 . [4 5 6] [* +] infra
-      1 2 3 [4 5 6] . [* +] infra
-1 2 3 [4 5 6] [* +] . infra
-              6 5 4 . * + [3 2 1] swaack
-               6 20 . + [3 2 1] swaack
-                 26 . [3 2 1] swaack
-         26 [3 2 1] . swaack
-         1 2 3 [26] . 
-
-
-
- -
-
- -
-
-
-
-
-

loop

-
-
-
-
-
-
In [108]:
-
-
-
J('[loop] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
Basic loop combinator.
-
-   ... True [Q] loop
------------------------
-     ... Q [Q] loop
-
-   ... False [Q] loop
-------------------------
-          ...
-
-
-
-
- -
-
- -
-
-
-
In [109]:
-
-
-
V('3 dup [1 - dup] loop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
              . 3 dup [1 - dup] loop
-            3 . dup [1 - dup] loop
-          3 3 . [1 - dup] loop
-3 3 [1 - dup] . loop
-            3 . 1 - dup [1 - dup] loop
-          3 1 . - dup [1 - dup] loop
-            2 . dup [1 - dup] loop
-          2 2 . [1 - dup] loop
-2 2 [1 - dup] . loop
-            2 . 1 - dup [1 - dup] loop
-          2 1 . - dup [1 - dup] loop
-            1 . dup [1 - dup] loop
-          1 1 . [1 - dup] loop
-1 1 [1 - dup] . loop
-            1 . 1 - dup [1 - dup] loop
-          1 1 . - dup [1 - dup] loop
-            0 . dup [1 - dup] loop
-          0 0 . [1 - dup] loop
-0 0 [1 - dup] . loop
-            0 . 
-
-
-
- -
-
- -
-
-
-
-
-

map pam

-
-
-
-
-
-
In [110]:
-
-
-
J('10 [1 2 3] [*] map')
-
- -
-
-
- -
-
- - -
- -
- - -
-
10 [10 20 30]
-
-
-
- -
-
- -
-
-
-
In [111]:
-
-
-
J('10 5 [[*][/][+][-]] pam')
-
- -
-
-
- -
-
- - -
- -
- - -
-
10 5 [50 2.0 15 5]
-
-
-
- -
-
- -
-
-
-
-
-

nullary unary binary ternary

Run a quoted program enforcing arity.

- -
-
-
-
-
-
In [112]:
-
-
-
J('1 2 3 4 5 [+] nullary')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 4 5 9
-
-
-
- -
-
- -
-
-
-
In [113]:
-
-
-
J('1 2 3 4 5 [+] unary')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 4 9
-
-
-
- -
-
- -
-
-
-
In [114]:
-
-
-
J('1 2 3 4 5 [+] binary')  # + has arity 2 so this is technically pointless...
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 9
-
-
-
- -
-
- -
-
-
-
In [115]:
-
-
-
J('1 2 3 4 5 [+] ternary')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 9
-
-
-
- -
-
- -
-
-
-
-
-

step

-
-
-
-
-
-
In [116]:
-
-
-
J('[step] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
Run a quoted program on each item in a sequence.
-
-        ... [] [Q] . step
-     -----------------------
-               ... .
-
-
-       ... [a] [Q] . step
-    ------------------------
-             ... a . Q
-
-
-   ... [a b c] [Q] . step
-----------------------------------------
-             ... a . Q [b c] [Q] step
-
-The step combinator executes the quotation on each member of the list
-on top of the stack.
-
-
-
-
- -
-
- -
-
-
-
In [117]:
-
-
-
V('0 [1 2 3] [+] step')
-
- -
-
-
- -
-
- - -
- -
- - -
-
              . 0 [1 2 3] [+] step
-            0 . [1 2 3] [+] step
-    0 [1 2 3] . [+] step
-0 [1 2 3] [+] . step
-      0 1 [+] . i [2 3] [+] step
-          0 1 . + [2 3] [+] step
-            1 . [2 3] [+] step
-      1 [2 3] . [+] step
-  1 [2 3] [+] . step
-      1 2 [+] . i [3] [+] step
-          1 2 . + [3] [+] step
-            3 . [3] [+] step
-        3 [3] . [+] step
-    3 [3] [+] . step
-      3 3 [+] . i
-          3 3 . +
-            6 . 
-
-
-
- -
-
- -
-
-
-
-
-

times

-
-
-
-
-
-
In [118]:
-
-
-
V('3 2 1 2 [+] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
            . 3 2 1 2 [+] times
-          3 . 2 1 2 [+] times
-        3 2 . 1 2 [+] times
-      3 2 1 . 2 [+] times
-    3 2 1 2 . [+] times
-3 2 1 2 [+] . times
-      3 2 1 . + 1 [+] times
-        3 3 . 1 [+] times
-      3 3 1 . [+] times
-  3 3 1 [+] . times
-        3 3 . +
-          6 . 
-
-
-
- -
-
- -
-
-
-
-
-

b

-
-
-
-
-
-
In [119]:
-
-
-
J('[b] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
b == [i] dip i
-
-... [P] [Q] b == ... [P] i [Q] i
-... [P] [Q] b == ... P Q
-
-
-
-
- -
-
- -
-
-
-
In [120]:
-
-
-
V('1 2 [3] [4] b')
-
- -
-
-
- -
-
- - -
- -
- - -
-
            . 1 2 [3] [4] b
-          1 . 2 [3] [4] b
-        1 2 . [3] [4] b
-    1 2 [3] . [4] b
-1 2 [3] [4] . b
-        1 2 . 3 4
-      1 2 3 . 4
-    1 2 3 4 . 
-
-
-
- -
-
- -
-
-
-
-
-

while

-
[predicate] [body] while
- -
-
-
-
-
-
In [121]:
-
-
-
J('3 [0 >] [dup --] while')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 0
-
-
-
- -
-
- -
-
-
-
-
-

x

-
-
-
-
-
-
In [122]:
-
-
-
J('[x] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
x == dup i
-
-... [Q] x = ... [Q] dup i
-... [Q] x = ... [Q] [Q] i
-... [Q] x = ... [Q]  Q
-
-
-
-
- -
-
- -
-
-
-
In [123]:
-
-
-
V('1 [2] [i 3] x')  # Kind of a pointless example.
-
- -
-
-
- -
-
- - -
- -
- - -
-
            . 1 [2] [i 3] x
-          1 . [2] [i 3] x
-      1 [2] . [i 3] x
-1 [2] [i 3] . x
-1 [2] [i 3] . i 3
-      1 [2] . i 3 3
-          1 . 2 3 3
-        1 2 . 3 3
-      1 2 3 . 3
-    1 2 3 3 . 
-
-
-
- -
-
- -
-
-
-
-
-

void

Implements Laws of Form arithmetic over quote-only datastructures (that is, datastructures that consist soley of containers, without strings or numbers or anything else.)

- -
-
-
-
-
-
In [124]:
-
-
-
J('[] void')
-
- -
-
-
- -
-
- - -
- -
- - -
-
False
-
-
-
- -
-
- -
-
-
-
In [125]:
-
-
-
J('[[]] void')
-
- -
-
-
- -
-
- - -
- -
- - -
-
True
-
-
-
- -
-
- -
-
-
-
In [126]:
-
-
-
J('[[][[]]] void')
-
- -
-
-
- -
-
- - -
- -
- - -
-
True
-
-
-
- -
-
- -
-
-
-
In [127]:
-
-
-
J('[[[]][[][]]] void')
-
- -
-
-
- -
-
- - -
- -
- - -
-
False
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/2. Library Examples.ipynb b/docs/2. Library Examples.ipynb deleted file mode 100644 index 1349eb4..0000000 --- a/docs/2. Library Examples.ipynb +++ /dev/null @@ -1,2964 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Examples (and some documentation) for the Words in the Library" - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Stack Chatter\n", - "This is what I like to call the functions that just rearrange things on the stack. (One thing I want to mention is that during a hypothetical compilation phase these \"stack chatter\" words effectively disappear, because we can map the logical stack locations to registers that remain static for the duration of the computation. This remains to be done but it's \"off the shelf\" technology.)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `clear`" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "\n" - ] - } - ], - "source": [ - "J('1 2 3 clear')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `dup` `dupd`" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 3\n" - ] - } - ], - "source": [ - "J('1 2 3 dup')" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 2 3\n" - ] - } - ], - "source": [ - "J('1 2 3 dupd')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `enstacken` `disenstacken` `stack` `unstack`\n", - "(I may have these paired up wrong. I.e. `disenstacken` should be `unstack` and vice versa.)" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[3 2 1]\n" - ] - } - ], - "source": [ - "J('1 2 3 enstacken') # Replace the stack with a quote of itself." - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4 5 6 3 2 1\n" - ] - } - ], - "source": [ - "J('4 5 6 [3 2 1] disenstacken') # Unpack a list onto the stack." - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 [3 2 1]\n" - ] - } - ], - "source": [ - "J('1 2 3 stack') # Get the stack on the stack." - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6 5 4\n" - ] - } - ], - "source": [ - "J('1 2 3 [4 5 6] unstack') # Replace the stack with the list on top.\n", - " # The items appear reversed but they are not,\n", - " # 4 is on the top of both the list and the stack." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `pop` `popd` `popop`" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2\n" - ] - } - ], - "source": [ - "J('1 2 3 pop')" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 3\n" - ] - } - ], - "source": [ - "J('1 2 3 popd')" - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1\n" - ] - } - ], - "source": [ - "J('1 2 3 popop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `roll<` `rolldown` `roll>` `rollup`\n", - "The \"down\" and \"up\" refer to the movement of two of the top three items (displacing the third.)" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2 3 1\n" - ] - } - ], - "source": [ - "J('1 2 3 roll<')" - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 1 2\n" - ] - } - ], - "source": [ - "J('1 2 3 roll>')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `swap`" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 3 2\n" - ] - } - ], - "source": [ - "J('1 2 3 swap')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `tuck` `over`" - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 3 2 3\n" - ] - } - ], - "source": [ - "J('1 2 3 tuck')" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 2\n" - ] - } - ], - "source": [ - "J('1 2 3 over')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `unit` `quoted` `unquoted`" - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 [3]\n" - ] - } - ], - "source": [ - "J('1 2 3 unit')" - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 [2] 3\n" - ] - } - ], - "source": [ - "J('1 2 3 quoted')" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3\n" - ] - } - ], - "source": [ - "J('1 [2] 3 unquoted')" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 1 [dup] 3 unquoted\n", - " 1 . [dup] 3 unquoted\n", - " 1 [dup] . 3 unquoted\n", - " 1 [dup] 3 . unquoted\n", - " 1 [dup] 3 . [i] dip\n", - "1 [dup] 3 [i] . dip\n", - " 1 [dup] . i 3\n", - " 1 . dup 3\n", - " 1 1 . 3\n", - " 1 1 3 . \n" - ] - } - ], - "source": [ - "V('1 [dup] 3 unquoted') # Unquoting evaluates. Be aware." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# List words" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `concat` `swoncat` `shunt`" - ] - }, - { - "cell_type": "code", - "execution_count": 21, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 2 3 4 5 6]\n" - ] - } - ], - "source": [ - "J('[1 2 3] [4 5 6] concat')" - ] - }, - { - "cell_type": "code", - "execution_count": 22, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[4 5 6 1 2 3]\n" - ] - } - ], - "source": [ - "J('[1 2 3] [4 5 6] swoncat')" - ] - }, - { - "cell_type": "code", - "execution_count": 23, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[6 5 4 1 2 3]\n" - ] - } - ], - "source": [ - "J('[1 2 3] [4 5 6] shunt')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `cons` `swons` `uncons`" - ] - }, - { - "cell_type": "code", - "execution_count": 24, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 2 3]\n" - ] - } - ], - "source": [ - "J('1 [2 3] cons')" - ] - }, - { - "cell_type": "code", - "execution_count": 25, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 2 3]\n" - ] - } - ], - "source": [ - "J('[2 3] 1 swons')" - ] - }, - { - "cell_type": "code", - "execution_count": 26, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 [2 3]\n" - ] - } - ], - "source": [ - "J('[1 2 3] uncons')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `first` `second` `third` `rest`" - ] - }, - { - "cell_type": "code", - "execution_count": 27, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] first')" - ] - }, - { - "cell_type": "code", - "execution_count": 28, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] second')" - ] - }, - { - "cell_type": "code", - "execution_count": 29, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] third')" - ] - }, - { - "cell_type": "code", - "execution_count": 30, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[2 3 4]\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] rest')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `flatten`" - ] - }, - { - "cell_type": "code", - "execution_count": 31, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 2 [3] 4 5 6]\n" - ] - } - ], - "source": [ - "J('[[1] [2 [3] 4] [5 6]] flatten')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `getitem` `at` `of` `drop` `take`\n", - "\n", - "`at` and `getitem` are the same function. `of == swap at`" - ] - }, - { - "cell_type": "code", - "execution_count": 32, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "12\n" - ] - } - ], - "source": [ - "J('[10 11 12 13 14] 2 getitem')" - ] - }, - { - "cell_type": "code", - "execution_count": 33, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] 0 at')" - ] - }, - { - "cell_type": "code", - "execution_count": 34, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3\n" - ] - } - ], - "source": [ - "J('2 [1 2 3 4] of')" - ] - }, - { - "cell_type": "code", - "execution_count": 35, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[3 4]\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] 2 drop')" - ] - }, - { - "cell_type": "code", - "execution_count": 36, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[2 1]\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] 2 take') # reverses the order" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "`reverse` could be defines as `reverse == dup size take`" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `remove`" - ] - }, - { - "cell_type": "code", - "execution_count": 37, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[2 3 1 4]\n" - ] - } - ], - "source": [ - "J('[1 2 3 1 4] 1 remove')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `reverse`" - ] - }, - { - "cell_type": "code", - "execution_count": 38, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[4 3 2 1]\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] reverse')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `size`" - ] - }, - { - "cell_type": "code", - "execution_count": 39, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4\n" - ] - } - ], - "source": [ - "J('[1 1 1 1] size')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `swaack`\n", - "\"Swap stack\" swap the list on the top of the stack for the stack, and put the old stack on top of the new one. Think of it as a context switch. Niether of the lists/stacks change their order." - ] - }, - { - "cell_type": "code", - "execution_count": 40, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6 5 4 [3 2 1]\n" - ] - } - ], - "source": [ - "J('1 2 3 [4 5 6] swaack')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `choice` `select`" - ] - }, - { - "cell_type": "code", - "execution_count": 41, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9\n" - ] - } - ], - "source": [ - "J('23 9 1 choice')" - ] - }, - { - "cell_type": "code", - "execution_count": 42, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "23\n" - ] - } - ], - "source": [ - "J('23 9 0 choice')" - ] - }, - { - "cell_type": "code", - "execution_count": 43, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9\n" - ] - } - ], - "source": [ - "J('[23 9 7] 1 select') # select is basically getitem, should retire it?" - ] - }, - { - "cell_type": "code", - "execution_count": 44, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "23\n" - ] - } - ], - "source": [ - "J('[23 9 7] 0 select')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `zip`" - ] - }, - { - "cell_type": "code", - "execution_count": 45, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[[6 1] [5 2] [4 3]]\n" - ] - } - ], - "source": [ - "J('[1 2 3] [6 5 4] zip')" - ] - }, - { - "cell_type": "code", - "execution_count": 46, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[7 7 7]\n" - ] - } - ], - "source": [ - "J('[1 2 3] [6 5 4] zip [sum] map')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Math words" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `+` `add`" - ] - }, - { - "cell_type": "code", - "execution_count": 47, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "32\n" - ] - } - ], - "source": [ - "J('23 9 +')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `-` `sub`" - ] - }, - { - "cell_type": "code", - "execution_count": 48, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "14\n" - ] - } - ], - "source": [ - "J('23 9 -')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `*` `mul`" - ] - }, - { - "cell_type": "code", - "execution_count": 49, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "207\n" - ] - } - ], - "source": [ - "J('23 9 *')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `/` `div` `floordiv` `truediv`" - ] - }, - { - "cell_type": "code", - "execution_count": 50, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2.5555555555555554\n" - ] - } - ], - "source": [ - "J('23 9 /')" - ] - }, - { - "cell_type": "code", - "execution_count": 51, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "-2.5555555555555554\n" - ] - } - ], - "source": [ - "J('23 -9 truediv')" - ] - }, - { - "cell_type": "code", - "execution_count": 52, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('23 9 div')" - ] - }, - { - "cell_type": "code", - "execution_count": 53, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('23 9 floordiv')" - ] - }, - { - "cell_type": "code", - "execution_count": 54, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "-3\n" - ] - } - ], - "source": [ - "J('23 -9 div')" - ] - }, - { - "cell_type": "code", - "execution_count": 55, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "-3\n" - ] - } - ], - "source": [ - "J('23 -9 floordiv')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `%` `mod` `modulus` `rem` `remainder`" - ] - }, - { - "cell_type": "code", - "execution_count": 56, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "5\n" - ] - } - ], - "source": [ - "J('23 9 %')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `neg`" - ] - }, - { - "cell_type": "code", - "execution_count": 57, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "-23 5\n" - ] - } - ], - "source": [ - "J('23 neg -5 neg')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### pow" - ] - }, - { - "cell_type": "code", - "execution_count": 58, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1024\n" - ] - } - ], - "source": [ - "J('2 10 pow')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `sqr` `sqrt`" - ] - }, - { - "cell_type": "code", - "execution_count": 59, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "529\n" - ] - } - ], - "source": [ - "J('23 sqr')" - ] - }, - { - "cell_type": "code", - "execution_count": 60, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4.795831523312719\n" - ] - } - ], - "source": [ - "J('23 sqrt')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `++` `succ` `--` `pred`" - ] - }, - { - "cell_type": "code", - "execution_count": 61, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('1 ++')" - ] - }, - { - "cell_type": "code", - "execution_count": 62, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0\n" - ] - } - ], - "source": [ - "J('1 --')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `<<` `lshift` `>>` `rshift`" - ] - }, - { - "cell_type": "code", - "execution_count": 63, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "16\n" - ] - } - ], - "source": [ - "J('8 1 <<')" - ] - }, - { - "cell_type": "code", - "execution_count": 64, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4\n" - ] - } - ], - "source": [ - "J('8 1 >>')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `average`" - ] - }, - { - "cell_type": "code", - "execution_count": 65, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2.75\n" - ] - } - ], - "source": [ - "J('[1 2 3 5] average')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `range` `range_to_zero` `down_to_zero`" - ] - }, - { - "cell_type": "code", - "execution_count": 66, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[4 3 2 1 0]\n" - ] - } - ], - "source": [ - "J('5 range')" - ] - }, - { - "cell_type": "code", - "execution_count": 67, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[0 1 2 3 4 5]\n" - ] - } - ], - "source": [ - "J('5 range_to_zero')" - ] - }, - { - "cell_type": "code", - "execution_count": 68, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "5 4 3 2 1 0\n" - ] - } - ], - "source": [ - "J('5 down_to_zero')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `product`" - ] - }, - { - "cell_type": "code", - "execution_count": 69, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "30\n" - ] - } - ], - "source": [ - "J('[1 2 3 5] product')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `sum`" - ] - }, - { - "cell_type": "code", - "execution_count": 70, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "11\n" - ] - } - ], - "source": [ - "J('[1 2 3 5] sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `min`" - ] - }, - { - "cell_type": "code", - "execution_count": 71, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1\n" - ] - } - ], - "source": [ - "J('[1 2 3 5] min')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `gcd`" - ] - }, - { - "cell_type": "code", - "execution_count": 72, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "15\n" - ] - } - ], - "source": [ - "J('45 30 gcd')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `least_fraction`\n", - "If we represent fractions as a quoted pair of integers [q d] this word reduces them to their ... least common factors or whatever." - ] - }, - { - "cell_type": "code", - "execution_count": 73, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[3 2]\n" - ] - } - ], - "source": [ - "J('[45 30] least_fraction')" - ] - }, - { - "cell_type": "code", - "execution_count": 74, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[23 12]\n" - ] - } - ], - "source": [ - "J('[23 12] least_fraction')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Logic and Comparison" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `?` `truthy`\n", - "Get the Boolean value of the item on the top of the stack." - ] - }, - { - "cell_type": "code", - "execution_count": 75, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "True\n" - ] - } - ], - "source": [ - "J('23 truthy')" - ] - }, - { - "cell_type": "code", - "execution_count": 76, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "False\n" - ] - } - ], - "source": [ - "J('[] truthy') # Python semantics." - ] - }, - { - "cell_type": "code", - "execution_count": 77, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "False\n" - ] - } - ], - "source": [ - "J('0 truthy')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " ? == dup truthy" - ] - }, - { - "cell_type": "code", - "execution_count": 78, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 23 ?\n", - " 23 . ?\n", - " 23 . dup truthy\n", - " 23 23 . truthy\n", - "23 True . \n" - ] - } - ], - "source": [ - "V('23 ?')" - ] - }, - { - "cell_type": "code", - "execution_count": 79, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[] False\n" - ] - } - ], - "source": [ - "J('[] ?')" - ] - }, - { - "cell_type": "code", - "execution_count": 80, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0 False\n" - ] - } - ], - "source": [ - "J('0 ?')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `&` `and` " - ] - }, - { - "cell_type": "code", - "execution_count": 81, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1\n" - ] - } - ], - "source": [ - "J('23 9 &')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `!=` `<>` `ne`" - ] - }, - { - "cell_type": "code", - "execution_count": 82, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "True\n" - ] - } - ], - "source": [ - "J('23 9 !=')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The usual suspects:\n", - "- `<` `lt`\n", - "- `<=` `le` \n", - "- `=` `eq`\n", - "- `>` `gt`\n", - "- `>=` `ge`\n", - "- `not`\n", - "- `or`" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `^` `xor`" - ] - }, - { - "cell_type": "code", - "execution_count": 83, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0\n" - ] - } - ], - "source": [ - "J('1 1 ^')" - ] - }, - { - "cell_type": "code", - "execution_count": 84, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1\n" - ] - } - ], - "source": [ - "J('1 0 ^')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Miscellaneous" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `help`" - ] - }, - { - "cell_type": "code", - "execution_count": 85, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Accepts a quoted symbol on the top of the stack and prints its docs.\n", - "\n" - ] - } - ], - "source": [ - "J('[help] help')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `parse`" - ] - }, - { - "cell_type": "code", - "execution_count": 86, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Parse the string on the stack to a Joy expression.\n", - "\n" - ] - } - ], - "source": [ - "J('[parse] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 87, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 [2 [3] dup]\n" - ] - } - ], - "source": [ - "J('1 \"2 [3] dup\" parse')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `run`\n", - "Evaluate a quoted Joy sequence." - ] - }, - { - "cell_type": "code", - "execution_count": 88, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[5]\n" - ] - } - ], - "source": [ - "J('[1 2 dup + +] run')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Combinators" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `app1` `app2` `app3`" - ] - }, - { - "cell_type": "code", - "execution_count": 89, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Given a quoted program on TOS and anything as the second stack item run\n", - "the program and replace the two args with the first result of the\n", - "program.\n", - "\n", - " ... x [Q] . app1\n", - " -----------------------------------\n", - " ... [x ...] [Q] . infra first\n", - "\n" - ] - } - ], - "source": [ - "J('[app1] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 90, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10 160\n" - ] - } - ], - "source": [ - "J('10 4 [sqr *] app1')" - ] - }, - { - "cell_type": "code", - "execution_count": 91, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10 90 160\n" - ] - } - ], - "source": [ - "J('10 3 4 [sqr *] app2')" - ] - }, - { - "cell_type": "code", - "execution_count": 92, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Like app1 with two items.\n", - "\n", - " ... y x [Q] . app2\n", - "-----------------------------------\n", - " ... [y ...] [Q] . infra first\n", - " [x ...] [Q] infra first\n", - "\n" - ] - } - ], - "source": [ - "J('[app2] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 93, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10 40 90 160\n" - ] - } - ], - "source": [ - "J('10 2 3 4 [sqr *] app3')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `anamorphism`\n", - "Given an initial value, a predicate function `[P]`, and a generator function `[G]`, the `anamorphism` combinator creates a sequence.\n", - "\n", - " n [P] [G] anamorphism\n", - " ---------------------------\n", - " [...]\n", - "\n", - "Example, `range`:\n", - "\n", - " range == [0 <=] [1 - dup] anamorphism" - ] - }, - { - "cell_type": "code", - "execution_count": 94, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[2 1 0]\n" - ] - } - ], - "source": [ - "J('3 [0 <=] [1 - dup] anamorphism')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `branch`" - ] - }, - { - "cell_type": "code", - "execution_count": 95, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "12\n" - ] - } - ], - "source": [ - "J('3 4 1 [+] [*] branch')" - ] - }, - { - "cell_type": "code", - "execution_count": 96, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "7\n" - ] - } - ], - "source": [ - "J('3 4 0 [+] [*] branch')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `cleave`\n", - " ... x [P] [Q] cleave\n", - "\n", - "From the original Joy docs: \"The cleave combinator expects two quotations, and below that an item `x`\n", - "It first executes `[P]`, with `x` on top, and saves the top result element.\n", - "Then it executes `[Q]`, again with `x`, and saves the top result.\n", - "Finally it restores the stack to what it was below `x` and pushes the two\n", - "results P(X) and Q(X).\"\n", - "\n", - "Note that `P` and `Q` can use items from the stack freely, since the stack (below `x`) is restored. `cleave` is a kind of *parallel* primitive, and it would make sense to create a version that uses, e.g. Python threads or something, to actually run `P` and `Q` concurrently. The current implementation of `cleave` is a definition in terms of `app2`:\n", - "\n", - " cleave == [i] app2 [popd] dip" - ] - }, - { - "cell_type": "code", - "execution_count": 97, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10 12 8\n" - ] - } - ], - "source": [ - "J('10 2 [+] [-] cleave')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `dip` `dipd` `dipdd`" - ] - }, - { - "cell_type": "code", - "execution_count": 98, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 7 5\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] dip')" - ] - }, - { - "cell_type": "code", - "execution_count": 99, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 5 4 5\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] dipd')" - ] - }, - { - "cell_type": "code", - "execution_count": 100, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 3 4 5\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] dipdd')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `dupdip`\n", - "Expects a quoted program `[Q]` on the stack and some item under it, `dup` the item and `dip` the quoted program under it.\n", - "\n", - " n [Q] dupdip == n Q n" - ] - }, - { - "cell_type": "code", - "execution_count": 101, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 23 [++] dupdip *\n", - " 23 . [++] dupdip *\n", - "23 [++] . dupdip *\n", - " 23 . ++ 23 *\n", - " 24 . 23 *\n", - " 24 23 . *\n", - " 552 . \n" - ] - } - ], - "source": [ - "V('23 [++] dupdip *') # N(N + 1)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `genrec` `primrec`" - ] - }, - { - "cell_type": "code", - "execution_count": 102, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "General Recursion Combinator.\n", - "\n", - " [if] [then] [rec1] [rec2] genrec\n", - " ---------------------------------------------------------------------\n", - " [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte\n", - "\n", - "From \"Recursion Theory and Joy\" (j05cmp.html) by Manfred von Thun:\n", - "\"The genrec combinator takes four program parameters in addition to\n", - "whatever data parameters it needs. Fourth from the top is an if-part,\n", - "followed by a then-part. If the if-part yields true, then the then-part\n", - "is executed and the combinator terminates. The other two parameters are\n", - "the rec1-part and the rec2-part. If the if-part yields false, the\n", - "rec1-part is executed. Following that the four program parameters and\n", - "the combinator are again pushed onto the stack bundled up in a quoted\n", - "form. Then the rec2-part is executed, where it will find the bundled\n", - "form. Typically it will then execute the bundled form, either with i or\n", - "with app2, or some other combinator.\"\n", - "\n", - "The way to design one of these is to fix your base case [then] and the\n", - "test [if], and then treat rec1 and rec2 as an else-part \"sandwiching\"\n", - "a quotation of the whole function.\n", - "\n", - "For example, given a (general recursive) function 'F':\n", - "\n", - " F == [I] [T] [R1] [R2] genrec\n", - "\n", - "If the [I] if-part fails you must derive R1 and R2 from:\n", - "\n", - " ... R1 [F] R2\n", - "\n", - "Just set the stack arguments in front, and figure out what R1 and R2\n", - "have to do to apply the quoted [F] in the proper way. In effect, the\n", - "genrec combinator turns into an ifte combinator with a quoted copy of\n", - "the original definition in the else-part:\n", - "\n", - " F == [I] [T] [R1] [R2] genrec\n", - " == [I] [T] [R1 [F] R2] ifte\n", - "\n", - "(Primitive recursive functions are those where R2 == i.\n", - "\n", - " P == [I] [T] [R] primrec\n", - " == [I] [T] [R [P] i] ifte\n", - " == [I] [T] [R P] ifte\n", - ")\n", - "\n" - ] - } - ], - "source": [ - "J('[genrec] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 103, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6\n" - ] - } - ], - "source": [ - "J('3 [1 <=] [] [dup --] [i *] genrec')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `i`" - ] - }, - { - "cell_type": "code", - "execution_count": 104, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 1 2 3 [+ +] i\n", - " 1 . 2 3 [+ +] i\n", - " 1 2 . 3 [+ +] i\n", - " 1 2 3 . [+ +] i\n", - "1 2 3 [+ +] . i\n", - " 1 2 3 . + +\n", - " 1 5 . +\n", - " 6 . \n" - ] - } - ], - "source": [ - "V('1 2 3 [+ +] i')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `ifte`\n", - " [predicate] [then] [else] ifte" - ] - }, - { - "cell_type": "code", - "execution_count": 105, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3\n" - ] - } - ], - "source": [ - "J('1 2 [1] [+] [*] ifte')" - ] - }, - { - "cell_type": "code", - "execution_count": 106, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('1 2 [0] [+] [*] ifte')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `infra`" - ] - }, - { - "cell_type": "code", - "execution_count": 107, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 1 2 3 [4 5 6] [* +] infra\n", - " 1 . 2 3 [4 5 6] [* +] infra\n", - " 1 2 . 3 [4 5 6] [* +] infra\n", - " 1 2 3 . [4 5 6] [* +] infra\n", - " 1 2 3 [4 5 6] . [* +] infra\n", - "1 2 3 [4 5 6] [* +] . infra\n", - " 6 5 4 . * + [3 2 1] swaack\n", - " 6 20 . + [3 2 1] swaack\n", - " 26 . [3 2 1] swaack\n", - " 26 [3 2 1] . swaack\n", - " 1 2 3 [26] . \n" - ] - } - ], - "source": [ - "V('1 2 3 [4 5 6] [* +] infra')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `loop`" - ] - }, - { - "cell_type": "code", - "execution_count": 108, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Basic loop combinator.\n", - "\n", - " ... True [Q] loop\n", - "-----------------------\n", - " ... Q [Q] loop\n", - "\n", - " ... False [Q] loop\n", - "------------------------\n", - " ...\n", - "\n" - ] - } - ], - "source": [ - "J('[loop] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 109, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 3 dup [1 - dup] loop\n", - " 3 . dup [1 - dup] loop\n", - " 3 3 . [1 - dup] loop\n", - "3 3 [1 - dup] . loop\n", - " 3 . 1 - dup [1 - dup] loop\n", - " 3 1 . - dup [1 - dup] loop\n", - " 2 . dup [1 - dup] loop\n", - " 2 2 . [1 - dup] loop\n", - "2 2 [1 - dup] . loop\n", - " 2 . 1 - dup [1 - dup] loop\n", - " 2 1 . - dup [1 - dup] loop\n", - " 1 . dup [1 - dup] loop\n", - " 1 1 . [1 - dup] loop\n", - "1 1 [1 - dup] . loop\n", - " 1 . 1 - dup [1 - dup] loop\n", - " 1 1 . - dup [1 - dup] loop\n", - " 0 . dup [1 - dup] loop\n", - " 0 0 . [1 - dup] loop\n", - "0 0 [1 - dup] . loop\n", - " 0 . \n" - ] - } - ], - "source": [ - "V('3 dup [1 - dup] loop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `map` `pam`" - ] - }, - { - "cell_type": "code", - "execution_count": 110, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10 [10 20 30]\n" - ] - } - ], - "source": [ - "J('10 [1 2 3] [*] map')" - ] - }, - { - "cell_type": "code", - "execution_count": 111, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10 5 [50 2.0 15 5]\n" - ] - } - ], - "source": [ - "J('10 5 [[*][/][+][-]] pam')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `nullary` `unary` `binary` `ternary`\n", - "Run a quoted program enforcing [arity](https://en.wikipedia.org/wiki/Arity)." - ] - }, - { - "cell_type": "code", - "execution_count": 112, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 4 5 9\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] nullary')" - ] - }, - { - "cell_type": "code", - "execution_count": 113, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 4 9\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] unary')" - ] - }, - { - "cell_type": "code", - "execution_count": 114, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 9\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] binary') # + has arity 2 so this is technically pointless..." - ] - }, - { - "cell_type": "code", - "execution_count": 115, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 9\n" - ] - } - ], - "source": [ - "J('1 2 3 4 5 [+] ternary')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `step`" - ] - }, - { - "cell_type": "code", - "execution_count": 116, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Run a quoted program on each item in a sequence.\n", - "\n", - " ... [] [Q] . step\n", - " -----------------------\n", - " ... .\n", - "\n", - "\n", - " ... [a] [Q] . step\n", - " ------------------------\n", - " ... a . Q\n", - "\n", - "\n", - " ... [a b c] [Q] . step\n", - "----------------------------------------\n", - " ... a . Q [b c] [Q] step\n", - "\n", - "The step combinator executes the quotation on each member of the list\n", - "on top of the stack.\n", - "\n" - ] - } - ], - "source": [ - "J('[step] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 117, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 0 [1 2 3] [+] step\n", - " 0 . [1 2 3] [+] step\n", - " 0 [1 2 3] . [+] step\n", - "0 [1 2 3] [+] . step\n", - " 0 1 [+] . i [2 3] [+] step\n", - " 0 1 . + [2 3] [+] step\n", - " 1 . [2 3] [+] step\n", - " 1 [2 3] . [+] step\n", - " 1 [2 3] [+] . step\n", - " 1 2 [+] . i [3] [+] step\n", - " 1 2 . + [3] [+] step\n", - " 3 . [3] [+] step\n", - " 3 [3] . [+] step\n", - " 3 [3] [+] . step\n", - " 3 3 [+] . i\n", - " 3 3 . +\n", - " 6 . \n" - ] - } - ], - "source": [ - "V('0 [1 2 3] [+] step')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `times`" - ] - }, - { - "cell_type": "code", - "execution_count": 118, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 3 2 1 2 [+] times\n", - " 3 . 2 1 2 [+] times\n", - " 3 2 . 1 2 [+] times\n", - " 3 2 1 . 2 [+] times\n", - " 3 2 1 2 . [+] times\n", - "3 2 1 2 [+] . times\n", - " 3 2 1 . + 1 [+] times\n", - " 3 3 . 1 [+] times\n", - " 3 3 1 . [+] times\n", - " 3 3 1 [+] . times\n", - " 3 3 . +\n", - " 6 . \n" - ] - } - ], - "source": [ - "V('3 2 1 2 [+] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `b`" - ] - }, - { - "cell_type": "code", - "execution_count": 119, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "b == [i] dip i\n", - "\n", - "... [P] [Q] b == ... [P] i [Q] i\n", - "... [P] [Q] b == ... P Q\n", - "\n" - ] - } - ], - "source": [ - "J('[b] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 120, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 1 2 [3] [4] b\n", - " 1 . 2 [3] [4] b\n", - " 1 2 . [3] [4] b\n", - " 1 2 [3] . [4] b\n", - "1 2 [3] [4] . b\n", - " 1 2 . 3 4\n", - " 1 2 3 . 4\n", - " 1 2 3 4 . \n" - ] - } - ], - "source": [ - "V('1 2 [3] [4] b')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `while`\n", - " [predicate] [body] while" - ] - }, - { - "cell_type": "code", - "execution_count": 121, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 0\n" - ] - } - ], - "source": [ - "J('3 [0 >] [dup --] while')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `x`" - ] - }, - { - "cell_type": "code", - "execution_count": 122, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "x == dup i\n", - "\n", - "... [Q] x = ... [Q] dup i\n", - "... [Q] x = ... [Q] [Q] i\n", - "... [Q] x = ... [Q] Q\n", - "\n" - ] - } - ], - "source": [ - "J('[x] help')" - ] - }, - { - "cell_type": "code", - "execution_count": 123, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 1 [2] [i 3] x\n", - " 1 . [2] [i 3] x\n", - " 1 [2] . [i 3] x\n", - "1 [2] [i 3] . x\n", - "1 [2] [i 3] . i 3\n", - " 1 [2] . i 3 3\n", - " 1 . 2 3 3\n", - " 1 2 . 3 3\n", - " 1 2 3 . 3\n", - " 1 2 3 3 . \n" - ] - } - ], - "source": [ - "V('1 [2] [i 3] x') # Kind of a pointless example." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# `void`\n", - "Implements [**Laws of Form** *arithmetic*](https://en.wikipedia.org/wiki/Laws_of_Form#The_primary_arithmetic_.28Chapter_4.29) over quote-only datastructures (that is, datastructures that consist soley of containers, without strings or numbers or anything else.)" - ] - }, - { - "cell_type": "code", - "execution_count": 124, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "False\n" - ] - } - ], - "source": [ - "J('[] void')" - ] - }, - { - "cell_type": "code", - "execution_count": 125, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "True\n" - ] - } - ], - "source": [ - "J('[[]] void')" - ] - }, - { - "cell_type": "code", - "execution_count": 126, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "True\n" - ] - } - ], - "source": [ - "J('[[][[]]] void')" - ] - }, - { - "cell_type": "code", - "execution_count": 127, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "False\n" - ] - } - ], - "source": [ - "J('[[[]][[][]]] void')" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/2. Library Examples.md b/docs/2. Library Examples.md deleted file mode 100644 index fd70ce7..0000000 --- a/docs/2. Library Examples.md +++ /dev/null @@ -1,1395 +0,0 @@ - -# Examples (and some documentation) for the Words in the Library - - -```python -from notebook_preamble import J, V -``` - -# Stack Chatter -This is what I like to call the functions that just rearrange things on the stack. (One thing I want to mention is that during a hypothetical compilation phase these "stack chatter" words effectively disappear, because we can map the logical stack locations to registers that remain static for the duration of the computation. This remains to be done but it's "off the shelf" technology.) - -### `clear` - - -```python -J('1 2 3 clear') -``` - - - - -### `dup` `dupd` - - -```python -J('1 2 3 dup') -``` - - 1 2 3 3 - - - -```python -J('1 2 3 dupd') -``` - - 1 2 2 3 - - -### `enstacken` `disenstacken` `stack` `unstack` -(I may have these paired up wrong. I.e. `disenstacken` should be `unstack` and vice versa.) - - -```python -J('1 2 3 enstacken') # Replace the stack with a quote of itself. -``` - - [3 2 1] - - - -```python -J('4 5 6 [3 2 1] disenstacken') # Unpack a list onto the stack. -``` - - 4 5 6 3 2 1 - - - -```python -J('1 2 3 stack') # Get the stack on the stack. -``` - - 1 2 3 [3 2 1] - - - -```python -J('1 2 3 [4 5 6] unstack') # Replace the stack with the list on top. - # The items appear reversed but they are not, - # 4 is on the top of both the list and the stack. -``` - - 6 5 4 - - -### `pop` `popd` `popop` - - -```python -J('1 2 3 pop') -``` - - 1 2 - - - -```python -J('1 2 3 popd') -``` - - 1 3 - - - -```python -J('1 2 3 popop') -``` - - 1 - - -### `roll<` `rolldown` `roll>` `rollup` -The "down" and "up" refer to the movement of two of the top three items (displacing the third.) - - -```python -J('1 2 3 roll<') -``` - - 2 3 1 - - - -```python -J('1 2 3 roll>') -``` - - 3 1 2 - - -### `swap` - - -```python -J('1 2 3 swap') -``` - - 1 3 2 - - -### `tuck` `over` - - -```python -J('1 2 3 tuck') -``` - - 1 3 2 3 - - - -```python -J('1 2 3 over') -``` - - 1 2 3 2 - - -### `unit` `quoted` `unquoted` - - -```python -J('1 2 3 unit') -``` - - 1 2 [3] - - - -```python -J('1 2 3 quoted') -``` - - 1 [2] 3 - - - -```python -J('1 [2] 3 unquoted') -``` - - 1 2 3 - - - -```python -V('1 [dup] 3 unquoted') # Unquoting evaluates. Be aware. -``` - - . 1 [dup] 3 unquoted - 1 . [dup] 3 unquoted - 1 [dup] . 3 unquoted - 1 [dup] 3 . unquoted - 1 [dup] 3 . [i] dip - 1 [dup] 3 [i] . dip - 1 [dup] . i 3 - 1 . dup 3 - 1 1 . 3 - 1 1 3 . - - -# List words - -### `concat` `swoncat` `shunt` - - -```python -J('[1 2 3] [4 5 6] concat') -``` - - [1 2 3 4 5 6] - - - -```python -J('[1 2 3] [4 5 6] swoncat') -``` - - [4 5 6 1 2 3] - - - -```python -J('[1 2 3] [4 5 6] shunt') -``` - - [6 5 4 1 2 3] - - -### `cons` `swons` `uncons` - - -```python -J('1 [2 3] cons') -``` - - [1 2 3] - - - -```python -J('[2 3] 1 swons') -``` - - [1 2 3] - - - -```python -J('[1 2 3] uncons') -``` - - 1 [2 3] - - -### `first` `second` `third` `rest` - - -```python -J('[1 2 3 4] first') -``` - - 1 - - - -```python -J('[1 2 3 4] second') -``` - - 2 - - - -```python -J('[1 2 3 4] third') -``` - - 3 - - - -```python -J('[1 2 3 4] rest') -``` - - [2 3 4] - - -### `flatten` - - -```python -J('[[1] [2 [3] 4] [5 6]] flatten') -``` - - [1 2 [3] 4 5 6] - - -### `getitem` `at` `of` `drop` `take` - -`at` and `getitem` are the same function. `of == swap at` - - -```python -J('[10 11 12 13 14] 2 getitem') -``` - - 12 - - - -```python -J('[1 2 3 4] 0 at') -``` - - 1 - - - -```python -J('2 [1 2 3 4] of') -``` - - 3 - - - -```python -J('[1 2 3 4] 2 drop') -``` - - [3 4] - - - -```python -J('[1 2 3 4] 2 take') # reverses the order -``` - - [2 1] - - -`reverse` could be defines as `reverse == dup size take` - -### `remove` - - -```python -J('[1 2 3 1 4] 1 remove') -``` - - [2 3 1 4] - - -### `reverse` - - -```python -J('[1 2 3 4] reverse') -``` - - [4 3 2 1] - - -### `size` - - -```python -J('[1 1 1 1] size') -``` - - 4 - - -### `swaack` -"Swap stack" swap the list on the top of the stack for the stack, and put the old stack on top of the new one. Think of it as a context switch. Niether of the lists/stacks change their order. - - -```python -J('1 2 3 [4 5 6] swaack') -``` - - 6 5 4 [3 2 1] - - -### `choice` `select` - - -```python -J('23 9 1 choice') -``` - - 9 - - - -```python -J('23 9 0 choice') -``` - - 23 - - - -```python -J('[23 9 7] 1 select') # select is basically getitem, should retire it? -``` - - 9 - - - -```python -J('[23 9 7] 0 select') -``` - - 23 - - -### `zip` - - -```python -J('[1 2 3] [6 5 4] zip') -``` - - [[6 1] [5 2] [4 3]] - - - -```python -J('[1 2 3] [6 5 4] zip [sum] map') -``` - - [7 7 7] - - -# Math words - -### `+` `add` - - -```python -J('23 9 +') -``` - - 32 - - -### `-` `sub` - - -```python -J('23 9 -') -``` - - 14 - - -### `*` `mul` - - -```python -J('23 9 *') -``` - - 207 - - -### `/` `div` `floordiv` `truediv` - - -```python -J('23 9 /') -``` - - 2.5555555555555554 - - - -```python -J('23 -9 truediv') -``` - - -2.5555555555555554 - - - -```python -J('23 9 div') -``` - - 2 - - - -```python -J('23 9 floordiv') -``` - - 2 - - - -```python -J('23 -9 div') -``` - - -3 - - - -```python -J('23 -9 floordiv') -``` - - -3 - - -### `%` `mod` `modulus` `rem` `remainder` - - -```python -J('23 9 %') -``` - - 5 - - -### `neg` - - -```python -J('23 neg -5 neg') -``` - - -23 5 - - -### pow - - -```python -J('2 10 pow') -``` - - 1024 - - -### `sqr` `sqrt` - - -```python -J('23 sqr') -``` - - 529 - - - -```python -J('23 sqrt') -``` - - 4.795831523312719 - - -### `++` `succ` `--` `pred` - - -```python -J('1 ++') -``` - - 2 - - - -```python -J('1 --') -``` - - 0 - - -### `<<` `lshift` `>>` `rshift` - - -```python -J('8 1 <<') -``` - - 16 - - - -```python -J('8 1 >>') -``` - - 4 - - -### `average` - - -```python -J('[1 2 3 5] average') -``` - - 2.75 - - -### `range` `range_to_zero` `down_to_zero` - - -```python -J('5 range') -``` - - [4 3 2 1 0] - - - -```python -J('5 range_to_zero') -``` - - [0 1 2 3 4 5] - - - -```python -J('5 down_to_zero') -``` - - 5 4 3 2 1 0 - - -### `product` - - -```python -J('[1 2 3 5] product') -``` - - 30 - - -### `sum` - - -```python -J('[1 2 3 5] sum') -``` - - 11 - - -### `min` - - -```python -J('[1 2 3 5] min') -``` - - 1 - - -### `gcd` - - -```python -J('45 30 gcd') -``` - - 15 - - -### `least_fraction` -If we represent fractions as a quoted pair of integers [q d] this word reduces them to their ... least common factors or whatever. - - -```python -J('[45 30] least_fraction') -``` - - [3 2] - - - -```python -J('[23 12] least_fraction') -``` - - [23 12] - - -# Logic and Comparison - -### `?` `truthy` -Get the Boolean value of the item on the top of the stack. - - -```python -J('23 truthy') -``` - - True - - - -```python -J('[] truthy') # Python semantics. -``` - - False - - - -```python -J('0 truthy') -``` - - False - - - ? == dup truthy - - -```python -V('23 ?') -``` - - . 23 ? - 23 . ? - 23 . dup truthy - 23 23 . truthy - 23 True . - - - -```python -J('[] ?') -``` - - [] False - - - -```python -J('0 ?') -``` - - 0 False - - -### `&` `and` - - -```python -J('23 9 &') -``` - - 1 - - -### `!=` `<>` `ne` - - -```python -J('23 9 !=') -``` - - True - - -The usual suspects: -- `<` `lt` -- `<=` `le` -- `=` `eq` -- `>` `gt` -- `>=` `ge` -- `not` -- `or` - -### `^` `xor` - - -```python -J('1 1 ^') -``` - - 0 - - - -```python -J('1 0 ^') -``` - - 1 - - -# Miscellaneous - -### `help` - - -```python -J('[help] help') -``` - - Accepts a quoted symbol on the top of the stack and prints its docs. - - - -### `parse` - - -```python -J('[parse] help') -``` - - Parse the string on the stack to a Joy expression. - - - - -```python -J('1 "2 [3] dup" parse') -``` - - 1 [2 [3] dup] - - -### `run` -Evaluate a quoted Joy sequence. - - -```python -J('[1 2 dup + +] run') -``` - - [5] - - -# Combinators - -### `app1` `app2` `app3` - - -```python -J('[app1] help') -``` - - Given a quoted program on TOS and anything as the second stack item run - the program and replace the two args with the first result of the - program. - - ... x [Q] . app1 - ----------------------------------- - ... [x ...] [Q] . infra first - - - - -```python -J('10 4 [sqr *] app1') -``` - - 10 160 - - - -```python -J('10 3 4 [sqr *] app2') -``` - - 10 90 160 - - - -```python -J('[app2] help') -``` - - Like app1 with two items. - - ... y x [Q] . app2 - ----------------------------------- - ... [y ...] [Q] . infra first - [x ...] [Q] infra first - - - - -```python -J('10 2 3 4 [sqr *] app3') -``` - - 10 40 90 160 - - -### `anamorphism` -Given an initial value, a predicate function `[P]`, and a generator function `[G]`, the `anamorphism` combinator creates a sequence. - - n [P] [G] anamorphism - --------------------------- - [...] - -Example, `range`: - - range == [0 <=] [1 - dup] anamorphism - - -```python -J('3 [0 <=] [1 - dup] anamorphism') -``` - - [2 1 0] - - -### `branch` - - -```python -J('3 4 1 [+] [*] branch') -``` - - 12 - - - -```python -J('3 4 0 [+] [*] branch') -``` - - 7 - - -### `cleave` - ... x [P] [Q] cleave - -From the original Joy docs: "The cleave combinator expects two quotations, and below that an item `x` -It first executes `[P]`, with `x` on top, and saves the top result element. -Then it executes `[Q]`, again with `x`, and saves the top result. -Finally it restores the stack to what it was below `x` and pushes the two -results P(X) and Q(X)." - -Note that `P` and `Q` can use items from the stack freely, since the stack (below `x`) is restored. `cleave` is a kind of *parallel* primitive, and it would make sense to create a version that uses, e.g. Python threads or something, to actually run `P` and `Q` concurrently. The current implementation of `cleave` is a definition in terms of `app2`: - - cleave == [i] app2 [popd] dip - - -```python -J('10 2 [+] [-] cleave') -``` - - 10 12 8 - - -### `dip` `dipd` `dipdd` - - -```python -J('1 2 3 4 5 [+] dip') -``` - - 1 2 7 5 - - - -```python -J('1 2 3 4 5 [+] dipd') -``` - - 1 5 4 5 - - - -```python -J('1 2 3 4 5 [+] dipdd') -``` - - 3 3 4 5 - - -### `dupdip` -Expects a quoted program `[Q]` on the stack and some item under it, `dup` the item and `dip` the quoted program under it. - - n [Q] dupdip == n Q n - - -```python -V('23 [++] dupdip *') # N(N + 1) -``` - - . 23 [++] dupdip * - 23 . [++] dupdip * - 23 [++] . dupdip * - 23 . ++ 23 * - 24 . 23 * - 24 23 . * - 552 . - - -### `genrec` `primrec` - - -```python -J('[genrec] help') -``` - - General Recursion Combinator. - - [if] [then] [rec1] [rec2] genrec - --------------------------------------------------------------------- - [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte - - From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun: - "The genrec combinator takes four program parameters in addition to - whatever data parameters it needs. Fourth from the top is an if-part, - followed by a then-part. If the if-part yields true, then the then-part - is executed and the combinator terminates. The other two parameters are - the rec1-part and the rec2-part. If the if-part yields false, the - rec1-part is executed. Following that the four program parameters and - the combinator are again pushed onto the stack bundled up in a quoted - form. Then the rec2-part is executed, where it will find the bundled - form. Typically it will then execute the bundled form, either with i or - with app2, or some other combinator." - - The way to design one of these is to fix your base case [then] and the - test [if], and then treat rec1 and rec2 as an else-part "sandwiching" - a quotation of the whole function. - - For example, given a (general recursive) function 'F': - - F == [I] [T] [R1] [R2] genrec - - If the [I] if-part fails you must derive R1 and R2 from: - - ... R1 [F] R2 - - Just set the stack arguments in front, and figure out what R1 and R2 - have to do to apply the quoted [F] in the proper way. In effect, the - genrec combinator turns into an ifte combinator with a quoted copy of - the original definition in the else-part: - - F == [I] [T] [R1] [R2] genrec - == [I] [T] [R1 [F] R2] ifte - - (Primitive recursive functions are those where R2 == i. - - P == [I] [T] [R] primrec - == [I] [T] [R [P] i] ifte - == [I] [T] [R P] ifte - ) - - - - -```python -J('3 [1 <=] [] [dup --] [i *] genrec') -``` - - 6 - - -### `i` - - -```python -V('1 2 3 [+ +] i') -``` - - . 1 2 3 [+ +] i - 1 . 2 3 [+ +] i - 1 2 . 3 [+ +] i - 1 2 3 . [+ +] i - 1 2 3 [+ +] . i - 1 2 3 . + + - 1 5 . + - 6 . - - -### `ifte` - [predicate] [then] [else] ifte - - -```python -J('1 2 [1] [+] [*] ifte') -``` - - 3 - - - -```python -J('1 2 [0] [+] [*] ifte') -``` - - 2 - - -### `infra` - - -```python -V('1 2 3 [4 5 6] [* +] infra') -``` - - . 1 2 3 [4 5 6] [* +] infra - 1 . 2 3 [4 5 6] [* +] infra - 1 2 . 3 [4 5 6] [* +] infra - 1 2 3 . [4 5 6] [* +] infra - 1 2 3 [4 5 6] . [* +] infra - 1 2 3 [4 5 6] [* +] . infra - 6 5 4 . * + [3 2 1] swaack - 6 20 . + [3 2 1] swaack - 26 . [3 2 1] swaack - 26 [3 2 1] . swaack - 1 2 3 [26] . - - -### `loop` - - -```python -J('[loop] help') -``` - - Basic loop combinator. - - ... True [Q] loop - ----------------------- - ... Q [Q] loop - - ... False [Q] loop - ------------------------ - ... - - - - -```python -V('3 dup [1 - dup] loop') -``` - - . 3 dup [1 - dup] loop - 3 . dup [1 - dup] loop - 3 3 . [1 - dup] loop - 3 3 [1 - dup] . loop - 3 . 1 - dup [1 - dup] loop - 3 1 . - dup [1 - dup] loop - 2 . dup [1 - dup] loop - 2 2 . [1 - dup] loop - 2 2 [1 - dup] . loop - 2 . 1 - dup [1 - dup] loop - 2 1 . - dup [1 - dup] loop - 1 . dup [1 - dup] loop - 1 1 . [1 - dup] loop - 1 1 [1 - dup] . loop - 1 . 1 - dup [1 - dup] loop - 1 1 . - dup [1 - dup] loop - 0 . dup [1 - dup] loop - 0 0 . [1 - dup] loop - 0 0 [1 - dup] . loop - 0 . - - -### `map` `pam` - - -```python -J('10 [1 2 3] [*] map') -``` - - 10 [10 20 30] - - - -```python -J('10 5 [[*][/][+][-]] pam') -``` - - 10 5 [50 2.0 15 5] - - -### `nullary` `unary` `binary` `ternary` -Run a quoted program enforcing [arity](https://en.wikipedia.org/wiki/Arity). - - -```python -J('1 2 3 4 5 [+] nullary') -``` - - 1 2 3 4 5 9 - - - -```python -J('1 2 3 4 5 [+] unary') -``` - - 1 2 3 4 9 - - - -```python -J('1 2 3 4 5 [+] binary') # + has arity 2 so this is technically pointless... -``` - - 1 2 3 9 - - - -```python -J('1 2 3 4 5 [+] ternary') -``` - - 1 2 9 - - -### `step` - - -```python -J('[step] help') -``` - - Run a quoted program on each item in a sequence. - - ... [] [Q] . step - ----------------------- - ... . - - - ... [a] [Q] . step - ------------------------ - ... a . Q - - - ... [a b c] [Q] . step - ---------------------------------------- - ... a . Q [b c] [Q] step - - The step combinator executes the quotation on each member of the list - on top of the stack. - - - - -```python -V('0 [1 2 3] [+] step') -``` - - . 0 [1 2 3] [+] step - 0 . [1 2 3] [+] step - 0 [1 2 3] . [+] step - 0 [1 2 3] [+] . step - 0 1 [+] . i [2 3] [+] step - 0 1 . + [2 3] [+] step - 1 . [2 3] [+] step - 1 [2 3] . [+] step - 1 [2 3] [+] . step - 1 2 [+] . i [3] [+] step - 1 2 . + [3] [+] step - 3 . [3] [+] step - 3 [3] . [+] step - 3 [3] [+] . step - 3 3 [+] . i - 3 3 . + - 6 . - - -### `times` - - -```python -V('3 2 1 2 [+] times') -``` - - . 3 2 1 2 [+] times - 3 . 2 1 2 [+] times - 3 2 . 1 2 [+] times - 3 2 1 . 2 [+] times - 3 2 1 2 . [+] times - 3 2 1 2 [+] . times - 3 2 1 . + 1 [+] times - 3 3 . 1 [+] times - 3 3 1 . [+] times - 3 3 1 [+] . times - 3 3 . + - 6 . - - -### `b` - - -```python -J('[b] help') -``` - - b == [i] dip i - - ... [P] [Q] b == ... [P] i [Q] i - ... [P] [Q] b == ... P Q - - - - -```python -V('1 2 [3] [4] b') -``` - - . 1 2 [3] [4] b - 1 . 2 [3] [4] b - 1 2 . [3] [4] b - 1 2 [3] . [4] b - 1 2 [3] [4] . b - 1 2 . 3 4 - 1 2 3 . 4 - 1 2 3 4 . - - -### `while` - [predicate] [body] while - - -```python -J('3 [0 >] [dup --] while') -``` - - 3 2 1 0 - - -### `x` - - -```python -J('[x] help') -``` - - x == dup i - - ... [Q] x = ... [Q] dup i - ... [Q] x = ... [Q] [Q] i - ... [Q] x = ... [Q] Q - - - - -```python -V('1 [2] [i 3] x') # Kind of a pointless example. -``` - - . 1 [2] [i 3] x - 1 . [2] [i 3] x - 1 [2] . [i 3] x - 1 [2] [i 3] . x - 1 [2] [i 3] . i 3 - 1 [2] . i 3 3 - 1 . 2 3 3 - 1 2 . 3 3 - 1 2 3 . 3 - 1 2 3 3 . - - -# `void` -Implements [**Laws of Form** *arithmetic*](https://en.wikipedia.org/wiki/Laws_of_Form#The_primary_arithmetic_.28Chapter_4.29) over quote-only datastructures (that is, datastructures that consist soley of containers, without strings or numbers or anything else.) - - -```python -J('[] void') -``` - - False - - - -```python -J('[[]] void') -``` - - True - - - -```python -J('[[][[]]] void') -``` - - True - - - -```python -J('[[[]][[][]]] void') -``` - - False - diff --git a/docs/2. Library Examples.rst b/docs/2. Library Examples.rst deleted file mode 100644 index fe7bbb4..0000000 --- a/docs/2. Library Examples.rst +++ /dev/null @@ -1,1761 +0,0 @@ - -Examples (and some documentation) for the Words in the Library -============================================================== - -.. code:: ipython2 - - from notebook_preamble import J, V - -Stack Chatter -============= - -This is what I like to call the functions that just rearrange things on -the stack. (One thing I want to mention is that during a hypothetical -compilation phase these "stack chatter" words effectively disappear, -because we can map the logical stack locations to registers that remain -static for the duration of the computation. This remains to be done but -it's "off the shelf" technology.) - -``clear`` -~~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 clear') - - -.. parsed-literal:: - - - - -``dup`` ``dupd`` -~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 dup') - - -.. parsed-literal:: - - 1 2 3 3 - - -.. code:: ipython2 - - J('1 2 3 dupd') - - -.. parsed-literal:: - - 1 2 2 3 - - -``enstacken`` ``disenstacken`` ``stack`` ``unstack`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -(I may have these paired up wrong. I.e. ``disenstacken`` should be -``unstack`` and vice versa.) - -.. code:: ipython2 - - J('1 2 3 enstacken') # Replace the stack with a quote of itself. - - -.. parsed-literal:: - - [3 2 1] - - -.. code:: ipython2 - - J('4 5 6 [3 2 1] disenstacken') # Unpack a list onto the stack. - - -.. parsed-literal:: - - 4 5 6 3 2 1 - - -.. code:: ipython2 - - J('1 2 3 stack') # Get the stack on the stack. - - -.. parsed-literal:: - - 1 2 3 [3 2 1] - - -.. code:: ipython2 - - J('1 2 3 [4 5 6] unstack') # Replace the stack with the list on top. - # The items appear reversed but they are not, - # 4 is on the top of both the list and the stack. - - -.. parsed-literal:: - - 6 5 4 - - -``pop`` ``popd`` ``popop`` -~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 pop') - - -.. parsed-literal:: - - 1 2 - - -.. code:: ipython2 - - J('1 2 3 popd') - - -.. parsed-literal:: - - 1 3 - - -.. code:: ipython2 - - J('1 2 3 popop') - - -.. parsed-literal:: - - 1 - - -``roll<`` ``rolldown`` ``roll>`` ``rollup`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -The "down" and "up" refer to the movement of two of the top three items -(displacing the third.) - -.. code:: ipython2 - - J('1 2 3 roll<') - - -.. parsed-literal:: - - 2 3 1 - - -.. code:: ipython2 - - J('1 2 3 roll>') - - -.. parsed-literal:: - - 3 1 2 - - -``swap`` -~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 swap') - - -.. parsed-literal:: - - 1 3 2 - - -``tuck`` ``over`` -~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 tuck') - - -.. parsed-literal:: - - 1 3 2 3 - - -.. code:: ipython2 - - J('1 2 3 over') - - -.. parsed-literal:: - - 1 2 3 2 - - -``unit`` ``quoted`` ``unquoted`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 unit') - - -.. parsed-literal:: - - 1 2 [3] - - -.. code:: ipython2 - - J('1 2 3 quoted') - - -.. parsed-literal:: - - 1 [2] 3 - - -.. code:: ipython2 - - J('1 [2] 3 unquoted') - - -.. parsed-literal:: - - 1 2 3 - - -.. code:: ipython2 - - V('1 [dup] 3 unquoted') # Unquoting evaluates. Be aware. - - -.. parsed-literal:: - - . 1 [dup] 3 unquoted - 1 . [dup] 3 unquoted - 1 [dup] . 3 unquoted - 1 [dup] 3 . unquoted - 1 [dup] 3 . [i] dip - 1 [dup] 3 [i] . dip - 1 [dup] . i 3 - 1 . dup 3 - 1 1 . 3 - 1 1 3 . - - -List words -========== - -``concat`` ``swoncat`` ``shunt`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3] [4 5 6] concat') - - -.. parsed-literal:: - - [1 2 3 4 5 6] - - -.. code:: ipython2 - - J('[1 2 3] [4 5 6] swoncat') - - -.. parsed-literal:: - - [4 5 6 1 2 3] - - -.. code:: ipython2 - - J('[1 2 3] [4 5 6] shunt') - - -.. parsed-literal:: - - [6 5 4 1 2 3] - - -``cons`` ``swons`` ``uncons`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 [2 3] cons') - - -.. parsed-literal:: - - [1 2 3] - - -.. code:: ipython2 - - J('[2 3] 1 swons') - - -.. parsed-literal:: - - [1 2 3] - - -.. code:: ipython2 - - J('[1 2 3] uncons') - - -.. parsed-literal:: - - 1 [2 3] - - -``first`` ``second`` ``third`` ``rest`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 4] first') - - -.. parsed-literal:: - - 1 - - -.. code:: ipython2 - - J('[1 2 3 4] second') - - -.. parsed-literal:: - - 2 - - -.. code:: ipython2 - - J('[1 2 3 4] third') - - -.. parsed-literal:: - - 3 - - -.. code:: ipython2 - - J('[1 2 3 4] rest') - - -.. parsed-literal:: - - [2 3 4] - - -``flatten`` -~~~~~~~~~~~ - -.. code:: ipython2 - - J('[[1] [2 [3] 4] [5 6]] flatten') - - -.. parsed-literal:: - - [1 2 [3] 4 5 6] - - -``getitem`` ``at`` ``of`` ``drop`` ``take`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -``at`` and ``getitem`` are the same function. ``of == swap at`` - -.. code:: ipython2 - - J('[10 11 12 13 14] 2 getitem') - - -.. parsed-literal:: - - 12 - - -.. code:: ipython2 - - J('[1 2 3 4] 0 at') - - -.. parsed-literal:: - - 1 - - -.. code:: ipython2 - - J('2 [1 2 3 4] of') - - -.. parsed-literal:: - - 3 - - -.. code:: ipython2 - - J('[1 2 3 4] 2 drop') - - -.. parsed-literal:: - - [3 4] - - -.. code:: ipython2 - - J('[1 2 3 4] 2 take') # reverses the order - - -.. parsed-literal:: - - [2 1] - - -``reverse`` could be defines as ``reverse == dup size take`` - -``remove`` -~~~~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 1 4] 1 remove') - - -.. parsed-literal:: - - [2 3 1 4] - - -``reverse`` -~~~~~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 4] reverse') - - -.. parsed-literal:: - - [4 3 2 1] - - -``size`` -~~~~~~~~ - -.. code:: ipython2 - - J('[1 1 1 1] size') - - -.. parsed-literal:: - - 4 - - -``swaack`` -~~~~~~~~~~ - -"Swap stack" swap the list on the top of the stack for the stack, and -put the old stack on top of the new one. Think of it as a context -switch. Niether of the lists/stacks change their order. - -.. code:: ipython2 - - J('1 2 3 [4 5 6] swaack') - - -.. parsed-literal:: - - 6 5 4 [3 2 1] - - -``choice`` ``select`` -~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 1 choice') - - -.. parsed-literal:: - - 9 - - -.. code:: ipython2 - - J('23 9 0 choice') - - -.. parsed-literal:: - - 23 - - -.. code:: ipython2 - - J('[23 9 7] 1 select') # select is basically getitem, should retire it? - - -.. parsed-literal:: - - 9 - - -.. code:: ipython2 - - J('[23 9 7] 0 select') - - -.. parsed-literal:: - - 23 - - -``zip`` -~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3] [6 5 4] zip') - - -.. parsed-literal:: - - [[6 1] [5 2] [4 3]] - - -.. code:: ipython2 - - J('[1 2 3] [6 5 4] zip [sum] map') - - -.. parsed-literal:: - - [7 7 7] - - -Math words -========== - -``+`` ``add`` -~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 +') - - -.. parsed-literal:: - - 32 - - -``-`` ``sub`` -~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 -') - - -.. parsed-literal:: - - 14 - - -``*`` ``mul`` -~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 *') - - -.. parsed-literal:: - - 207 - - -``/`` ``div`` ``floordiv`` ``truediv`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 /') - - -.. parsed-literal:: - - 2.5555555555555554 - - -.. code:: ipython2 - - J('23 -9 truediv') - - -.. parsed-literal:: - - -2.5555555555555554 - - -.. code:: ipython2 - - J('23 9 div') - - -.. parsed-literal:: - - 2 - - -.. code:: ipython2 - - J('23 9 floordiv') - - -.. parsed-literal:: - - 2 - - -.. code:: ipython2 - - J('23 -9 div') - - -.. parsed-literal:: - - -3 - - -.. code:: ipython2 - - J('23 -9 floordiv') - - -.. parsed-literal:: - - -3 - - -``%`` ``mod`` ``modulus`` ``rem`` ``remainder`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 %') - - -.. parsed-literal:: - - 5 - - -``neg`` -~~~~~~~ - -.. code:: ipython2 - - J('23 neg -5 neg') - - -.. parsed-literal:: - - -23 5 - - -pow -~~~ - -.. code:: ipython2 - - J('2 10 pow') - - -.. parsed-literal:: - - 1024 - - -``sqr`` ``sqrt`` -~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 sqr') - - -.. parsed-literal:: - - 529 - - -.. code:: ipython2 - - J('23 sqrt') - - -.. parsed-literal:: - - 4.795831523312719 - - -``++`` ``succ`` ``--`` ``pred`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 ++') - - -.. parsed-literal:: - - 2 - - -.. code:: ipython2 - - J('1 --') - - -.. parsed-literal:: - - 0 - - -``<<`` ``lshift`` ``>>`` ``rshift`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('8 1 <<') - - -.. parsed-literal:: - - 16 - - -.. code:: ipython2 - - J('8 1 >>') - - -.. parsed-literal:: - - 4 - - -``average`` -~~~~~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 5] average') - - -.. parsed-literal:: - - 2.75 - - -``range`` ``range_to_zero`` ``down_to_zero`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('5 range') - - -.. parsed-literal:: - - [4 3 2 1 0] - - -.. code:: ipython2 - - J('5 range_to_zero') - - -.. parsed-literal:: - - [0 1 2 3 4 5] - - -.. code:: ipython2 - - J('5 down_to_zero') - - -.. parsed-literal:: - - 5 4 3 2 1 0 - - -``product`` -~~~~~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 5] product') - - -.. parsed-literal:: - - 30 - - -``sum`` -~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 5] sum') - - -.. parsed-literal:: - - 11 - - -``min`` -~~~~~~~ - -.. code:: ipython2 - - J('[1 2 3 5] min') - - -.. parsed-literal:: - - 1 - - -``gcd`` -~~~~~~~ - -.. code:: ipython2 - - J('45 30 gcd') - - -.. parsed-literal:: - - 15 - - -``least_fraction`` -~~~~~~~~~~~~~~~~~~ - -If we represent fractions as a quoted pair of integers [q d] this word -reduces them to their ... least common factors or whatever. - -.. code:: ipython2 - - J('[45 30] least_fraction') - - -.. parsed-literal:: - - [3 2] - - -.. code:: ipython2 - - J('[23 12] least_fraction') - - -.. parsed-literal:: - - [23 12] - - -Logic and Comparison -==================== - -``?`` ``truthy`` -~~~~~~~~~~~~~~~~ - -Get the Boolean value of the item on the top of the stack. - -.. code:: ipython2 - - J('23 truthy') - - -.. parsed-literal:: - - True - - -.. code:: ipython2 - - J('[] truthy') # Python semantics. - - -.. parsed-literal:: - - False - - -.. code:: ipython2 - - J('0 truthy') - - -.. parsed-literal:: - - False - - -:: - - ? == dup truthy - -.. code:: ipython2 - - V('23 ?') - - -.. parsed-literal:: - - . 23 ? - 23 . ? - 23 . dup truthy - 23 23 . truthy - 23 True . - - -.. code:: ipython2 - - J('[] ?') - - -.. parsed-literal:: - - [] False - - -.. code:: ipython2 - - J('0 ?') - - -.. parsed-literal:: - - 0 False - - -``&`` ``and`` -~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 &') - - -.. parsed-literal:: - - 1 - - -``!=`` ``<>`` ``ne`` -~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('23 9 !=') - - -.. parsed-literal:: - - True - - -| The usual suspects: - ``<`` ``lt`` - ``<=`` ``le`` -| - ``=`` ``eq`` - ``>`` ``gt`` - ``>=`` ``ge`` - ``not`` - ``or`` - -``^`` ``xor`` -~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 1 ^') - - -.. parsed-literal:: - - 0 - - -.. code:: ipython2 - - J('1 0 ^') - - -.. parsed-literal:: - - 1 - - -Miscellaneous -============= - -``help`` -~~~~~~~~ - -.. code:: ipython2 - - J('[help] help') - - -.. parsed-literal:: - - Accepts a quoted symbol on the top of the stack and prints its docs. - - - -``parse`` -~~~~~~~~~ - -.. code:: ipython2 - - J('[parse] help') - - -.. parsed-literal:: - - Parse the string on the stack to a Joy expression. - - - -.. code:: ipython2 - - J('1 "2 [3] dup" parse') - - -.. parsed-literal:: - - 1 [2 [3] dup] - - -``run`` -~~~~~~~ - -Evaluate a quoted Joy sequence. - -.. code:: ipython2 - - J('[1 2 dup + +] run') - - -.. parsed-literal:: - - [5] - - -Combinators -=========== - -``app1`` ``app2`` ``app3`` -~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('[app1] help') - - -.. parsed-literal:: - - Given a quoted program on TOS and anything as the second stack item run - the program and replace the two args with the first result of the - program. - - ... x [Q] . app1 - ----------------------------------- - ... [x ...] [Q] . infra first - - - -.. code:: ipython2 - - J('10 4 [sqr *] app1') - - -.. parsed-literal:: - - 10 160 - - -.. code:: ipython2 - - J('10 3 4 [sqr *] app2') - - -.. parsed-literal:: - - 10 90 160 - - -.. code:: ipython2 - - J('[app2] help') - - -.. parsed-literal:: - - Like app1 with two items. - - ... y x [Q] . app2 - ----------------------------------- - ... [y ...] [Q] . infra first - [x ...] [Q] infra first - - - -.. code:: ipython2 - - J('10 2 3 4 [sqr *] app3') - - -.. parsed-literal:: - - 10 40 90 160 - - -``anamorphism`` -~~~~~~~~~~~~~~~ - -Given an initial value, a predicate function ``[P]``, and a generator -function ``[G]``, the ``anamorphism`` combinator creates a sequence. - -:: - - n [P] [G] anamorphism - --------------------------- - [...] - -Example, ``range``: - -:: - - range == [0 <=] [1 - dup] anamorphism - -.. code:: ipython2 - - J('3 [0 <=] [1 - dup] anamorphism') - - -.. parsed-literal:: - - [2 1 0] - - -``branch`` -~~~~~~~~~~ - -.. code:: ipython2 - - J('3 4 1 [+] [*] branch') - - -.. parsed-literal:: - - 12 - - -.. code:: ipython2 - - J('3 4 0 [+] [*] branch') - - -.. parsed-literal:: - - 7 - - -``cleave`` -~~~~~~~~~~ - -:: - - ... x [P] [Q] cleave - -From the original Joy docs: "The cleave combinator expects two -quotations, and below that an item ``x`` It first executes ``[P]``, with -``x`` on top, and saves the top result element. Then it executes -``[Q]``, again with ``x``, and saves the top result. Finally it restores -the stack to what it was below ``x`` and pushes the two results P(X) and -Q(X)." - -Note that ``P`` and ``Q`` can use items from the stack freely, since the -stack (below ``x``) is restored. ``cleave`` is a kind of *parallel* -primitive, and it would make sense to create a version that uses, e.g. -Python threads or something, to actually run ``P`` and ``Q`` -concurrently. The current implementation of ``cleave`` is a definition -in terms of ``app2``: - -:: - - cleave == [i] app2 [popd] dip - -.. code:: ipython2 - - J('10 2 [+] [-] cleave') - - -.. parsed-literal:: - - 10 12 8 - - -``dip`` ``dipd`` ``dipdd`` -~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 2 3 4 5 [+] dip') - - -.. parsed-literal:: - - 1 2 7 5 - - -.. code:: ipython2 - - J('1 2 3 4 5 [+] dipd') - - -.. parsed-literal:: - - 1 5 4 5 - - -.. code:: ipython2 - - J('1 2 3 4 5 [+] dipdd') - - -.. parsed-literal:: - - 3 3 4 5 - - -``dupdip`` -~~~~~~~~~~ - -Expects a quoted program ``[Q]`` on the stack and some item under it, -``dup`` the item and ``dip`` the quoted program under it. - -:: - - n [Q] dupdip == n Q n - -.. code:: ipython2 - - V('23 [++] dupdip *') # N(N + 1) - - -.. parsed-literal:: - - . 23 [++] dupdip * - 23 . [++] dupdip * - 23 [++] . dupdip * - 23 . ++ 23 * - 24 . 23 * - 24 23 . * - 552 . - - -``genrec`` ``primrec`` -~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('[genrec] help') - - -.. parsed-literal:: - - General Recursion Combinator. - - [if] [then] [rec1] [rec2] genrec - --------------------------------------------------------------------- - [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte - - From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun: - "The genrec combinator takes four program parameters in addition to - whatever data parameters it needs. Fourth from the top is an if-part, - followed by a then-part. If the if-part yields true, then the then-part - is executed and the combinator terminates. The other two parameters are - the rec1-part and the rec2-part. If the if-part yields false, the - rec1-part is executed. Following that the four program parameters and - the combinator are again pushed onto the stack bundled up in a quoted - form. Then the rec2-part is executed, where it will find the bundled - form. Typically it will then execute the bundled form, either with i or - with app2, or some other combinator." - - The way to design one of these is to fix your base case [then] and the - test [if], and then treat rec1 and rec2 as an else-part "sandwiching" - a quotation of the whole function. - - For example, given a (general recursive) function 'F': - - F == [I] [T] [R1] [R2] genrec - - If the [I] if-part fails you must derive R1 and R2 from: - - ... R1 [F] R2 - - Just set the stack arguments in front, and figure out what R1 and R2 - have to do to apply the quoted [F] in the proper way. In effect, the - genrec combinator turns into an ifte combinator with a quoted copy of - the original definition in the else-part: - - F == [I] [T] [R1] [R2] genrec - == [I] [T] [R1 [F] R2] ifte - - (Primitive recursive functions are those where R2 == i. - - P == [I] [T] [R] primrec - == [I] [T] [R [P] i] ifte - == [I] [T] [R P] ifte - ) - - - -.. code:: ipython2 - - J('3 [1 <=] [] [dup --] [i *] genrec') - - -.. parsed-literal:: - - 6 - - -``i`` -~~~~~ - -.. code:: ipython2 - - V('1 2 3 [+ +] i') - - -.. parsed-literal:: - - . 1 2 3 [+ +] i - 1 . 2 3 [+ +] i - 1 2 . 3 [+ +] i - 1 2 3 . [+ +] i - 1 2 3 [+ +] . i - 1 2 3 . + + - 1 5 . + - 6 . - - -``ifte`` -~~~~~~~~ - -:: - - [predicate] [then] [else] ifte - -.. code:: ipython2 - - J('1 2 [1] [+] [*] ifte') - - -.. parsed-literal:: - - 3 - - -.. code:: ipython2 - - J('1 2 [0] [+] [*] ifte') - - -.. parsed-literal:: - - 2 - - -``infra`` -~~~~~~~~~ - -.. code:: ipython2 - - V('1 2 3 [4 5 6] [* +] infra') - - -.. parsed-literal:: - - . 1 2 3 [4 5 6] [* +] infra - 1 . 2 3 [4 5 6] [* +] infra - 1 2 . 3 [4 5 6] [* +] infra - 1 2 3 . [4 5 6] [* +] infra - 1 2 3 [4 5 6] . [* +] infra - 1 2 3 [4 5 6] [* +] . infra - 6 5 4 . * + [3 2 1] swaack - 6 20 . + [3 2 1] swaack - 26 . [3 2 1] swaack - 26 [3 2 1] . swaack - 1 2 3 [26] . - - -``loop`` -~~~~~~~~ - -.. code:: ipython2 - - J('[loop] help') - - -.. parsed-literal:: - - Basic loop combinator. - - ... True [Q] loop - ----------------------- - ... Q [Q] loop - - ... False [Q] loop - ------------------------ - ... - - - -.. code:: ipython2 - - V('3 dup [1 - dup] loop') - - -.. parsed-literal:: - - . 3 dup [1 - dup] loop - 3 . dup [1 - dup] loop - 3 3 . [1 - dup] loop - 3 3 [1 - dup] . loop - 3 . 1 - dup [1 - dup] loop - 3 1 . - dup [1 - dup] loop - 2 . dup [1 - dup] loop - 2 2 . [1 - dup] loop - 2 2 [1 - dup] . loop - 2 . 1 - dup [1 - dup] loop - 2 1 . - dup [1 - dup] loop - 1 . dup [1 - dup] loop - 1 1 . [1 - dup] loop - 1 1 [1 - dup] . loop - 1 . 1 - dup [1 - dup] loop - 1 1 . - dup [1 - dup] loop - 0 . dup [1 - dup] loop - 0 0 . [1 - dup] loop - 0 0 [1 - dup] . loop - 0 . - - -``map`` ``pam`` -~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('10 [1 2 3] [*] map') - - -.. parsed-literal:: - - 10 [10 20 30] - - -.. code:: ipython2 - - J('10 5 [[*][/][+][-]] pam') - - -.. parsed-literal:: - - 10 5 [50 2.0 15 5] - - -``nullary`` ``unary`` ``binary`` ``ternary`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Run a quoted program enforcing -`arity `__. - -.. code:: ipython2 - - J('1 2 3 4 5 [+] nullary') - - -.. parsed-literal:: - - 1 2 3 4 5 9 - - -.. code:: ipython2 - - J('1 2 3 4 5 [+] unary') - - -.. parsed-literal:: - - 1 2 3 4 9 - - -.. code:: ipython2 - - J('1 2 3 4 5 [+] binary') # + has arity 2 so this is technically pointless... - - -.. parsed-literal:: - - 1 2 3 9 - - -.. code:: ipython2 - - J('1 2 3 4 5 [+] ternary') - - -.. parsed-literal:: - - 1 2 9 - - -``step`` -~~~~~~~~ - -.. code:: ipython2 - - J('[step] help') - - -.. parsed-literal:: - - Run a quoted program on each item in a sequence. - - ... [] [Q] . step - ----------------------- - ... . - - - ... [a] [Q] . step - ------------------------ - ... a . Q - - - ... [a b c] [Q] . step - ---------------------------------------- - ... a . Q [b c] [Q] step - - The step combinator executes the quotation on each member of the list - on top of the stack. - - - -.. code:: ipython2 - - V('0 [1 2 3] [+] step') - - -.. parsed-literal:: - - . 0 [1 2 3] [+] step - 0 . [1 2 3] [+] step - 0 [1 2 3] . [+] step - 0 [1 2 3] [+] . step - 0 1 [+] . i [2 3] [+] step - 0 1 . + [2 3] [+] step - 1 . [2 3] [+] step - 1 [2 3] . [+] step - 1 [2 3] [+] . step - 1 2 [+] . i [3] [+] step - 1 2 . + [3] [+] step - 3 . [3] [+] step - 3 [3] . [+] step - 3 [3] [+] . step - 3 3 [+] . i - 3 3 . + - 6 . - - -``times`` -~~~~~~~~~ - -.. code:: ipython2 - - V('3 2 1 2 [+] times') - - -.. parsed-literal:: - - . 3 2 1 2 [+] times - 3 . 2 1 2 [+] times - 3 2 . 1 2 [+] times - 3 2 1 . 2 [+] times - 3 2 1 2 . [+] times - 3 2 1 2 [+] . times - 3 2 1 . + 1 [+] times - 3 3 . 1 [+] times - 3 3 1 . [+] times - 3 3 1 [+] . times - 3 3 . + - 6 . - - -``b`` -~~~~~ - -.. code:: ipython2 - - J('[b] help') - - -.. parsed-literal:: - - b == [i] dip i - - ... [P] [Q] b == ... [P] i [Q] i - ... [P] [Q] b == ... P Q - - - -.. code:: ipython2 - - V('1 2 [3] [4] b') - - -.. parsed-literal:: - - . 1 2 [3] [4] b - 1 . 2 [3] [4] b - 1 2 . [3] [4] b - 1 2 [3] . [4] b - 1 2 [3] [4] . b - 1 2 . 3 4 - 1 2 3 . 4 - 1 2 3 4 . - - -``while`` -~~~~~~~~~ - -:: - - [predicate] [body] while - -.. code:: ipython2 - - J('3 [0 >] [dup --] while') - - -.. parsed-literal:: - - 3 2 1 0 - - -``x`` -~~~~~ - -.. code:: ipython2 - - J('[x] help') - - -.. parsed-literal:: - - x == dup i - - ... [Q] x = ... [Q] dup i - ... [Q] x = ... [Q] [Q] i - ... [Q] x = ... [Q] Q - - - -.. code:: ipython2 - - V('1 [2] [i 3] x') # Kind of a pointless example. - - -.. parsed-literal:: - - . 1 [2] [i 3] x - 1 . [2] [i 3] x - 1 [2] . [i 3] x - 1 [2] [i 3] . x - 1 [2] [i 3] . i 3 - 1 [2] . i 3 3 - 1 . 2 3 3 - 1 2 . 3 3 - 1 2 3 . 3 - 1 2 3 3 . - - -``void`` -======== - -Implements `**Laws of Form** -*arithmetic* `__ -over quote-only datastructures (that is, datastructures that consist -soley of containers, without strings or numbers or anything else.) - -.. code:: ipython2 - - J('[] void') - - -.. parsed-literal:: - - False - - -.. code:: ipython2 - - J('[[]] void') - - -.. parsed-literal:: - - True - - -.. code:: ipython2 - - J('[[][[]]] void') - - -.. parsed-literal:: - - True - - -.. code:: ipython2 - - J('[[[]][[][]]] void') - - -.. parsed-literal:: - - False - diff --git a/docs/3. Developing a Program.html b/docs/3. Developing a Program.html deleted file mode 100644 index 4a6e724..0000000 --- a/docs/3. Developing a Program.html +++ /dev/null @@ -1,13283 +0,0 @@ - - - -3. Developing a Program - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Project Euler, first problem: "Multiples of 3 and 5"

-
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
-
-Find the sum of all the multiples of 3 or 5 below 1000.
- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import J, V, define
-
- -
-
-
- -
-
-
-
-
-

Let's create a predicate that returns True if a number is a multiple of 3 or 5 and False otherwise.

- -
-
-
-
-
-
In [2]:
-
-
-
define('P == [3 % not] dupdip 5 % not or')
-
- -
-
-
- -
-
-
-
In [3]:
-
-
-
V('80 P')
-
- -
-
-
- -
-
- - -
- -
- - -
-
             . 80 P
-          80 . P
-          80 . [3 % not] dupdip 5 % not or
-80 [3 % not] . dupdip 5 % not or
-          80 . 3 % not 80 5 % not or
-        80 3 . % not 80 5 % not or
-           2 . not 80 5 % not or
-       False . 80 5 % not or
-    False 80 . 5 % not or
-  False 80 5 . % not or
-     False 0 . not or
-  False True . or
-        True . 
-
-
-
- -
-
- -
-
-
-
-
-

Given the predicate function P a suitable program is:

- -
PE1 == 1000 range [P] filter sum
-
-
-

This function generates a list of the integers from 0 to 999, filters -that list by P, and then sums the result.

-

Logically this is fine, but pragmatically we are doing more work than we -should be; we generate one thousand integers but actually use less than -half of them. A better solution would be to generate just the multiples -we want to sum, and to add them as we go rather than storing them and -adding summing them at the end.

-

At first I had the idea to use two counters and increase them by three -and five, respectively. This way we only generate the terms that we -actually want to sum. We have to proceed by incrementing the counter -that is lower, or if they are equal, the three counter, and we have to -take care not to double add numbers like 15 that are multiples of both -three and five.

-

This seemed a little clunky, so I tried a different approach.

-

Consider the first few terms in the series:

- -
3 5 6 9 10 12 15 18 20 21 ...
-
-
-

Subtract each number from the one after it (subtracting 0 from 3):

- -
3 5 6 9 10 12 15 18 20 21 24 25 27 30 ...
-0 3 5 6  9 10 12 15 18 20 21 24 25 27 ...
--------------------------------------------
-3 2 1 3  1  2  3  3  2  1  3  1  2  3 ...
-
-
-

You get this lovely repeating palindromic sequence:

- -
3 2 1 3 1 2 3
-
-
-

To make a counter that increments by factors of 3 and 5 you just add -these differences to the counter one-by-one in a loop.

-

To make use of this sequence to increment a counter and sum terms as we -go we need a function that will accept the sum, the counter, and the next -term to add, and that adds the term to the counter and a copy of the -counter to the running sum. This function will do that:

- -
PE1.1 == + [+] dupdip
- -
-
-
-
-
-
In [4]:
-
-
-
define('PE1.1 == + [+] dupdip')
-
- -
-
-
- -
-
-
-
In [5]:
-
-
-
V('0 0 3 PE1.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
        . 0 0 3 PE1.1
-      0 . 0 3 PE1.1
-    0 0 . 3 PE1.1
-  0 0 3 . PE1.1
-  0 0 3 . + [+] dupdip
-    0 3 . [+] dupdip
-0 3 [+] . dupdip
-    0 3 . + 3
-      3 . 3
-    3 3 . 
-
-
-
- -
-
- -
-
-
-
In [6]:
-
-
-
V('0 0 [3 2 1 3 1 2 3] [PE1.1] step')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                            . 0 0 [3 2 1 3 1 2 3] [PE1.1] step
-                          0 . 0 [3 2 1 3 1 2 3] [PE1.1] step
-                        0 0 . [3 2 1 3 1 2 3] [PE1.1] step
-        0 0 [3 2 1 3 1 2 3] . [PE1.1] step
-0 0 [3 2 1 3 1 2 3] [PE1.1] . step
-              0 0 3 [PE1.1] . i [2 1 3 1 2 3] [PE1.1] step
-                      0 0 3 . PE1.1 [2 1 3 1 2 3] [PE1.1] step
-                      0 0 3 . + [+] dupdip [2 1 3 1 2 3] [PE1.1] step
-                        0 3 . [+] dupdip [2 1 3 1 2 3] [PE1.1] step
-                    0 3 [+] . dupdip [2 1 3 1 2 3] [PE1.1] step
-                        0 3 . + 3 [2 1 3 1 2 3] [PE1.1] step
-                          3 . 3 [2 1 3 1 2 3] [PE1.1] step
-                        3 3 . [2 1 3 1 2 3] [PE1.1] step
-          3 3 [2 1 3 1 2 3] . [PE1.1] step
-  3 3 [2 1 3 1 2 3] [PE1.1] . step
-              3 3 2 [PE1.1] . i [1 3 1 2 3] [PE1.1] step
-                      3 3 2 . PE1.1 [1 3 1 2 3] [PE1.1] step
-                      3 3 2 . + [+] dupdip [1 3 1 2 3] [PE1.1] step
-                        3 5 . [+] dupdip [1 3 1 2 3] [PE1.1] step
-                    3 5 [+] . dupdip [1 3 1 2 3] [PE1.1] step
-                        3 5 . + 5 [1 3 1 2 3] [PE1.1] step
-                          8 . 5 [1 3 1 2 3] [PE1.1] step
-                        8 5 . [1 3 1 2 3] [PE1.1] step
-            8 5 [1 3 1 2 3] . [PE1.1] step
-    8 5 [1 3 1 2 3] [PE1.1] . step
-              8 5 1 [PE1.1] . i [3 1 2 3] [PE1.1] step
-                      8 5 1 . PE1.1 [3 1 2 3] [PE1.1] step
-                      8 5 1 . + [+] dupdip [3 1 2 3] [PE1.1] step
-                        8 6 . [+] dupdip [3 1 2 3] [PE1.1] step
-                    8 6 [+] . dupdip [3 1 2 3] [PE1.1] step
-                        8 6 . + 6 [3 1 2 3] [PE1.1] step
-                         14 . 6 [3 1 2 3] [PE1.1] step
-                       14 6 . [3 1 2 3] [PE1.1] step
-             14 6 [3 1 2 3] . [PE1.1] step
-     14 6 [3 1 2 3] [PE1.1] . step
-             14 6 3 [PE1.1] . i [1 2 3] [PE1.1] step
-                     14 6 3 . PE1.1 [1 2 3] [PE1.1] step
-                     14 6 3 . + [+] dupdip [1 2 3] [PE1.1] step
-                       14 9 . [+] dupdip [1 2 3] [PE1.1] step
-                   14 9 [+] . dupdip [1 2 3] [PE1.1] step
-                       14 9 . + 9 [1 2 3] [PE1.1] step
-                         23 . 9 [1 2 3] [PE1.1] step
-                       23 9 . [1 2 3] [PE1.1] step
-               23 9 [1 2 3] . [PE1.1] step
-       23 9 [1 2 3] [PE1.1] . step
-             23 9 1 [PE1.1] . i [2 3] [PE1.1] step
-                     23 9 1 . PE1.1 [2 3] [PE1.1] step
-                     23 9 1 . + [+] dupdip [2 3] [PE1.1] step
-                      23 10 . [+] dupdip [2 3] [PE1.1] step
-                  23 10 [+] . dupdip [2 3] [PE1.1] step
-                      23 10 . + 10 [2 3] [PE1.1] step
-                         33 . 10 [2 3] [PE1.1] step
-                      33 10 . [2 3] [PE1.1] step
-                33 10 [2 3] . [PE1.1] step
-        33 10 [2 3] [PE1.1] . step
-            33 10 2 [PE1.1] . i [3] [PE1.1] step
-                    33 10 2 . PE1.1 [3] [PE1.1] step
-                    33 10 2 . + [+] dupdip [3] [PE1.1] step
-                      33 12 . [+] dupdip [3] [PE1.1] step
-                  33 12 [+] . dupdip [3] [PE1.1] step
-                      33 12 . + 12 [3] [PE1.1] step
-                         45 . 12 [3] [PE1.1] step
-                      45 12 . [3] [PE1.1] step
-                  45 12 [3] . [PE1.1] step
-          45 12 [3] [PE1.1] . step
-            45 12 3 [PE1.1] . i
-                    45 12 3 . PE1.1
-                    45 12 3 . + [+] dupdip
-                      45 15 . [+] dupdip
-                  45 15 [+] . dupdip
-                      45 15 . + 15
-                         60 . 15
-                      60 15 . 
-
-
-
- -
-
- -
-
-
-
-
-

So one step through all seven terms brings the counter to 15 and the total to 60.

- -
-
-
-
-
-
In [7]:
-
-
-
1000 / 15
-
- -
-
-
- -
-
- - -
- -
Out[7]:
- - - - -
-
66
-
- -
- -
-
- -
-
-
-
In [8]:
-
-
-
66 * 15
-
- -
-
-
- -
-
- - -
- -
Out[8]:
- - - - -
-
990
-
- -
- -
-
- -
-
-
-
In [9]:
-
-
-
1000 - 990
-
- -
-
-
- -
-
- - -
- -
Out[9]:
- - - - -
-
10
-
- -
- -
-
- -
-
-
-
-
-

We only want the terms less than 1000.

- -
-
-
-
-
-
In [10]:
-
-
-
999 - 990
-
- -
-
-
- -
-
- - -
- -
Out[10]:
- - - - -
-
9
-
- -
- -
-
- -
-
-
-
-
-

That means we want to run the full list of numbers sixty-six times to get to 990 and then the first four numbers 3 2 1 3 to get to 999.

- -
-
-
-
-
-
In [11]:
-
-
-
define('PE1 == 0 0 66 [[3 2 1 3 1 2 3] [PE1.1] step] times [3 2 1 3] [PE1.1] step pop')
-
- -
-
-
- -
-
-
-
In [12]:
-
-
-
J('PE1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
233168
-
-
-
- -
-
- -
-
-
-
-
-

This form uses no extra storage and produces no unused summands. It's -good but there's one more trick we can apply. The list of seven terms -takes up at least seven bytes. But notice that all of the terms are less -than four, and so each can fit in just two bits. We could store all -seven terms in just fourteen bits and use masking and shifts to pick out -each term as we go. This will use less space and save time loading whole -integer terms from the list.

- -
    3  2  1  3  1  2  3
-0b 11 10 01 11 01 10 11 == 14811
- -
-
-
-
-
-
In [13]:
-
-
-
0b11100111011011
-
- -
-
-
- -
-
- - -
- -
Out[13]:
- - - - -
-
14811
-
- -
- -
-
- -
-
-
-
In [14]:
-
-
-
define('PE1.2 == [3 & PE1.1] dupdip 2 >>')
-
- -
-
-
- -
-
-
-
In [15]:
-
-
-
V('0 0 14811 PE1.2')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                      . 0 0 14811 PE1.2
-                    0 . 0 14811 PE1.2
-                  0 0 . 14811 PE1.2
-            0 0 14811 . PE1.2
-            0 0 14811 . [3 & PE1.1] dupdip 2 >>
-0 0 14811 [3 & PE1.1] . dupdip 2 >>
-            0 0 14811 . 3 & PE1.1 14811 2 >>
-          0 0 14811 3 . & PE1.1 14811 2 >>
-                0 0 3 . PE1.1 14811 2 >>
-                0 0 3 . + [+] dupdip 14811 2 >>
-                  0 3 . [+] dupdip 14811 2 >>
-              0 3 [+] . dupdip 14811 2 >>
-                  0 3 . + 3 14811 2 >>
-                    3 . 3 14811 2 >>
-                  3 3 . 14811 2 >>
-            3 3 14811 . 2 >>
-          3 3 14811 2 . >>
-             3 3 3702 . 
-
-
-
- -
-
- -
-
-
-
In [16]:
-
-
-
V('3 3 3702 PE1.2')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                     . 3 3 3702 PE1.2
-                   3 . 3 3702 PE1.2
-                 3 3 . 3702 PE1.2
-            3 3 3702 . PE1.2
-            3 3 3702 . [3 & PE1.1] dupdip 2 >>
-3 3 3702 [3 & PE1.1] . dupdip 2 >>
-            3 3 3702 . 3 & PE1.1 3702 2 >>
-          3 3 3702 3 . & PE1.1 3702 2 >>
-               3 3 2 . PE1.1 3702 2 >>
-               3 3 2 . + [+] dupdip 3702 2 >>
-                 3 5 . [+] dupdip 3702 2 >>
-             3 5 [+] . dupdip 3702 2 >>
-                 3 5 . + 5 3702 2 >>
-                   8 . 5 3702 2 >>
-                 8 5 . 3702 2 >>
-            8 5 3702 . 2 >>
-          8 5 3702 2 . >>
-             8 5 925 . 
-
-
-
- -
-
- -
-
-
-
In [17]:
-
-
-
V('0 0 14811 7 [PE1.2] times pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                      . 0 0 14811 7 [PE1.2] times pop
-                    0 . 0 14811 7 [PE1.2] times pop
-                  0 0 . 14811 7 [PE1.2] times pop
-            0 0 14811 . 7 [PE1.2] times pop
-          0 0 14811 7 . [PE1.2] times pop
-  0 0 14811 7 [PE1.2] . times pop
-    0 0 14811 [PE1.2] . i 6 [PE1.2] times pop
-            0 0 14811 . PE1.2 6 [PE1.2] times pop
-            0 0 14811 . [3 & PE1.1] dupdip 2 >> 6 [PE1.2] times pop
-0 0 14811 [3 & PE1.1] . dupdip 2 >> 6 [PE1.2] times pop
-            0 0 14811 . 3 & PE1.1 14811 2 >> 6 [PE1.2] times pop
-          0 0 14811 3 . & PE1.1 14811 2 >> 6 [PE1.2] times pop
-                0 0 3 . PE1.1 14811 2 >> 6 [PE1.2] times pop
-                0 0 3 . + [+] dupdip 14811 2 >> 6 [PE1.2] times pop
-                  0 3 . [+] dupdip 14811 2 >> 6 [PE1.2] times pop
-              0 3 [+] . dupdip 14811 2 >> 6 [PE1.2] times pop
-                  0 3 . + 3 14811 2 >> 6 [PE1.2] times pop
-                    3 . 3 14811 2 >> 6 [PE1.2] times pop
-                  3 3 . 14811 2 >> 6 [PE1.2] times pop
-            3 3 14811 . 2 >> 6 [PE1.2] times pop
-          3 3 14811 2 . >> 6 [PE1.2] times pop
-             3 3 3702 . 6 [PE1.2] times pop
-           3 3 3702 6 . [PE1.2] times pop
-   3 3 3702 6 [PE1.2] . times pop
-     3 3 3702 [PE1.2] . i 5 [PE1.2] times pop
-             3 3 3702 . PE1.2 5 [PE1.2] times pop
-             3 3 3702 . [3 & PE1.1] dupdip 2 >> 5 [PE1.2] times pop
- 3 3 3702 [3 & PE1.1] . dupdip 2 >> 5 [PE1.2] times pop
-             3 3 3702 . 3 & PE1.1 3702 2 >> 5 [PE1.2] times pop
-           3 3 3702 3 . & PE1.1 3702 2 >> 5 [PE1.2] times pop
-                3 3 2 . PE1.1 3702 2 >> 5 [PE1.2] times pop
-                3 3 2 . + [+] dupdip 3702 2 >> 5 [PE1.2] times pop
-                  3 5 . [+] dupdip 3702 2 >> 5 [PE1.2] times pop
-              3 5 [+] . dupdip 3702 2 >> 5 [PE1.2] times pop
-                  3 5 . + 5 3702 2 >> 5 [PE1.2] times pop
-                    8 . 5 3702 2 >> 5 [PE1.2] times pop
-                  8 5 . 3702 2 >> 5 [PE1.2] times pop
-             8 5 3702 . 2 >> 5 [PE1.2] times pop
-           8 5 3702 2 . >> 5 [PE1.2] times pop
-              8 5 925 . 5 [PE1.2] times pop
-            8 5 925 5 . [PE1.2] times pop
-    8 5 925 5 [PE1.2] . times pop
-      8 5 925 [PE1.2] . i 4 [PE1.2] times pop
-              8 5 925 . PE1.2 4 [PE1.2] times pop
-              8 5 925 . [3 & PE1.1] dupdip 2 >> 4 [PE1.2] times pop
-  8 5 925 [3 & PE1.1] . dupdip 2 >> 4 [PE1.2] times pop
-              8 5 925 . 3 & PE1.1 925 2 >> 4 [PE1.2] times pop
-            8 5 925 3 . & PE1.1 925 2 >> 4 [PE1.2] times pop
-                8 5 1 . PE1.1 925 2 >> 4 [PE1.2] times pop
-                8 5 1 . + [+] dupdip 925 2 >> 4 [PE1.2] times pop
-                  8 6 . [+] dupdip 925 2 >> 4 [PE1.2] times pop
-              8 6 [+] . dupdip 925 2 >> 4 [PE1.2] times pop
-                  8 6 . + 6 925 2 >> 4 [PE1.2] times pop
-                   14 . 6 925 2 >> 4 [PE1.2] times pop
-                 14 6 . 925 2 >> 4 [PE1.2] times pop
-             14 6 925 . 2 >> 4 [PE1.2] times pop
-           14 6 925 2 . >> 4 [PE1.2] times pop
-             14 6 231 . 4 [PE1.2] times pop
-           14 6 231 4 . [PE1.2] times pop
-   14 6 231 4 [PE1.2] . times pop
-     14 6 231 [PE1.2] . i 3 [PE1.2] times pop
-             14 6 231 . PE1.2 3 [PE1.2] times pop
-             14 6 231 . [3 & PE1.1] dupdip 2 >> 3 [PE1.2] times pop
- 14 6 231 [3 & PE1.1] . dupdip 2 >> 3 [PE1.2] times pop
-             14 6 231 . 3 & PE1.1 231 2 >> 3 [PE1.2] times pop
-           14 6 231 3 . & PE1.1 231 2 >> 3 [PE1.2] times pop
-               14 6 3 . PE1.1 231 2 >> 3 [PE1.2] times pop
-               14 6 3 . + [+] dupdip 231 2 >> 3 [PE1.2] times pop
-                 14 9 . [+] dupdip 231 2 >> 3 [PE1.2] times pop
-             14 9 [+] . dupdip 231 2 >> 3 [PE1.2] times pop
-                 14 9 . + 9 231 2 >> 3 [PE1.2] times pop
-                   23 . 9 231 2 >> 3 [PE1.2] times pop
-                 23 9 . 231 2 >> 3 [PE1.2] times pop
-             23 9 231 . 2 >> 3 [PE1.2] times pop
-           23 9 231 2 . >> 3 [PE1.2] times pop
-              23 9 57 . 3 [PE1.2] times pop
-            23 9 57 3 . [PE1.2] times pop
-    23 9 57 3 [PE1.2] . times pop
-      23 9 57 [PE1.2] . i 2 [PE1.2] times pop
-              23 9 57 . PE1.2 2 [PE1.2] times pop
-              23 9 57 . [3 & PE1.1] dupdip 2 >> 2 [PE1.2] times pop
-  23 9 57 [3 & PE1.1] . dupdip 2 >> 2 [PE1.2] times pop
-              23 9 57 . 3 & PE1.1 57 2 >> 2 [PE1.2] times pop
-            23 9 57 3 . & PE1.1 57 2 >> 2 [PE1.2] times pop
-               23 9 1 . PE1.1 57 2 >> 2 [PE1.2] times pop
-               23 9 1 . + [+] dupdip 57 2 >> 2 [PE1.2] times pop
-                23 10 . [+] dupdip 57 2 >> 2 [PE1.2] times pop
-            23 10 [+] . dupdip 57 2 >> 2 [PE1.2] times pop
-                23 10 . + 10 57 2 >> 2 [PE1.2] times pop
-                   33 . 10 57 2 >> 2 [PE1.2] times pop
-                33 10 . 57 2 >> 2 [PE1.2] times pop
-             33 10 57 . 2 >> 2 [PE1.2] times pop
-           33 10 57 2 . >> 2 [PE1.2] times pop
-             33 10 14 . 2 [PE1.2] times pop
-           33 10 14 2 . [PE1.2] times pop
-   33 10 14 2 [PE1.2] . times pop
-     33 10 14 [PE1.2] . i 1 [PE1.2] times pop
-             33 10 14 . PE1.2 1 [PE1.2] times pop
-             33 10 14 . [3 & PE1.1] dupdip 2 >> 1 [PE1.2] times pop
- 33 10 14 [3 & PE1.1] . dupdip 2 >> 1 [PE1.2] times pop
-             33 10 14 . 3 & PE1.1 14 2 >> 1 [PE1.2] times pop
-           33 10 14 3 . & PE1.1 14 2 >> 1 [PE1.2] times pop
-              33 10 2 . PE1.1 14 2 >> 1 [PE1.2] times pop
-              33 10 2 . + [+] dupdip 14 2 >> 1 [PE1.2] times pop
-                33 12 . [+] dupdip 14 2 >> 1 [PE1.2] times pop
-            33 12 [+] . dupdip 14 2 >> 1 [PE1.2] times pop
-                33 12 . + 12 14 2 >> 1 [PE1.2] times pop
-                   45 . 12 14 2 >> 1 [PE1.2] times pop
-                45 12 . 14 2 >> 1 [PE1.2] times pop
-             45 12 14 . 2 >> 1 [PE1.2] times pop
-           45 12 14 2 . >> 1 [PE1.2] times pop
-              45 12 3 . 1 [PE1.2] times pop
-            45 12 3 1 . [PE1.2] times pop
-    45 12 3 1 [PE1.2] . times pop
-      45 12 3 [PE1.2] . i pop
-              45 12 3 . PE1.2 pop
-              45 12 3 . [3 & PE1.1] dupdip 2 >> pop
-  45 12 3 [3 & PE1.1] . dupdip 2 >> pop
-              45 12 3 . 3 & PE1.1 3 2 >> pop
-            45 12 3 3 . & PE1.1 3 2 >> pop
-              45 12 3 . PE1.1 3 2 >> pop
-              45 12 3 . + [+] dupdip 3 2 >> pop
-                45 15 . [+] dupdip 3 2 >> pop
-            45 15 [+] . dupdip 3 2 >> pop
-                45 15 . + 15 3 2 >> pop
-                   60 . 15 3 2 >> pop
-                60 15 . 3 2 >> pop
-              60 15 3 . 2 >> pop
-            60 15 3 2 . >> pop
-              60 15 0 . pop
-                60 15 . 
-
-
-
- -
-
- -
-
-
-
-
-

And so we have at last:

- -
-
-
-
-
-
In [18]:
-
-
-
define('PE1 == 0 0 66 [14811 7 [PE1.2] times pop] times 14811 4 [PE1.2] times popop')
-
- -
-
-
- -
-
-
-
In [19]:
-
-
-
J('PE1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
233168
-
-
-
- -
-
- -
-
-
-
-
-

Let's refactor.

- -
  14811 7 [PE1.2] times pop
-  14811 4 [PE1.2] times pop
-  14811 n [PE1.2] times pop
-n 14811 swap [PE1.2] times pop
- -
-
-
-
-
-
In [20]:
-
-
-
define('PE1.3 == 14811 swap [PE1.2] times pop')
-
- -
-
-
- -
-
-
-
-
-

Now we can simplify the definition above:

- -
-
-
-
-
-
In [21]:
-
-
-
define('PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop')
-
- -
-
-
- -
-
-
-
In [22]:
-
-
-
J('PE1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
233168
-
-
-
- -
-
- -
-
-
-
-
-

Here's our joy program all in one place. It doesn't make so much sense, but if you have read through the above description of how it was derived I hope it's clear.

- -
PE1.1 == + [+] dupdip
-PE1.2 == [3 & PE1.1] dupdip 2 >>
-PE1.3 == 14811 swap [PE1.2] times pop
-PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
- -
-
-
-
-
-
-
-

Generator Version

It's a little clunky iterating sixty-six times though the seven numbers then four more. In the Generator Programs notebook we derive a generator that can be repeatedly driven by the x combinator to produce a stream of the seven numbers repeating over and over again.

- -
-
-
-
-
-
In [23]:
-
-
-
define('PE1.terms == [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons]')
-
- -
-
-
- -
-
-
-
In [24]:
-
-
-
J('PE1.terms 21 [x] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons]
-
-
-
- -
-
- -
-
-
-
-
-

We know from above that we need sixty-six times seven then four more terms to reach up to but not over one thousand.

- -
-
-
-
-
-
In [25]:
-
-
-
J('7 66 * 4 +')
-
- -
-
-
- -
-
- - -
- -
- - -
-
466
-
-
-
- -
-
- -
-
-
-
-
-

Here they are...

-
-
-
-
-
-
In [26]:
-
-
-
J('PE1.terms 466 [x] times pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3
-
-
-
- -
-
- -
-
-
-
-
-

...and they do sum to 999.

-
-
-
-
-
-
In [27]:
-
-
-
J('[PE1.terms 466 [x] times pop] run sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
999
-
-
-
- -
-
- -
-
-
-
-
-

Now we can use PE1.1 to accumulate the terms as we go, and then pop the generator and the counter from the stack when we're done, leaving just the sum.

- -
-
-
-
-
-
In [28]:
-
-
-
J('0 0 PE1.terms 466 [x [PE1.1] dip] times popop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
233168
-
-
-
- -
-
- -
-
-
-
-
-

A little further analysis renders iteration unnecessary.

Consider finding the sum of the positive integers less than or equal to ten.

- -
-
-
-
-
-
In [29]:
-
-
-
J('[10 9 8 7 6 5 4 3 2 1] sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
55
-
-
-
- -
-
- -
-
-
-
-
-

Instead of summing them, observe:

- -
  10  9  8  7  6
-+  1  2  3  4  5
----- -- -- -- --
-  11 11 11 11 11
-
-  11 * 5 = 55
-
-
-

From the above example we can deduce that the sum of the first N positive integers is:

- -
(N + 1) * N / 2 
-
-
-

(The formula also works for odd values of N, I'll leave that to you if you want to work it out or you can take my word for it.)

- -
-
-
-
-
-
In [30]:
-
-
-
define('F == dup ++ * 2 floordiv')
-
- -
-
-
- -
-
-
-
In [31]:
-
-
-
V('10 F')
-
- -
-
-
- -
-
- - -
- -
- - -
-
      . 10 F
-   10 . F
-   10 . dup ++ * 2 floordiv
-10 10 . ++ * 2 floordiv
-10 11 . * 2 floordiv
-  110 . 2 floordiv
-110 2 . floordiv
-   55 . 
-
-
-
- -
-
- -
-
-
-
-
-

Generalizing to Blocks of Terms

We can apply the same reasoning to the PE1 problem.

-

Between 0 and 990 inclusive there are sixty-six "blocks" of seven terms each, starting with:

- -
[3 5 6 9 10 12 15]
-
-
-

And ending with:

- -
[978 980 981 984 985 987 990]
-
-
-

If we reverse one of these two blocks and sum pairs...

- -
-
-
-
-
-
In [32]:
-
-
-
J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[[978 15] [980 12] [981 10] [984 9] [985 6] [987 5] [990 3]]
-
-
-
- -
-
- -
-
-
-
In [33]:
-
-
-
J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[993 992 991 993 991 992 993]
-
-
-
- -
-
- -
-
-
-
-
-

(Interesting that the sequence of seven numbers appears again in the rightmost digit of each term.)

- -
-
-
-
-
-
In [34]:
-
-
-
J('[ 3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
6945
-
-
-
- -
-
- -
-
-
-
-
-

Since there are sixty-six blocks and we are pairing them up, there must be thirty-three pairs, each of which sums to 6945. We also have these additional unpaired terms between 990 and 1000:

- -
993 995 996 999
-
-
-

So we can give the "sum of all the multiples of 3 or 5 below 1000" like so:

- -
-
-
-
-
-
In [35]:
-
-
-
J('6945 33 * [993 995 996 999] cons sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
233168
-
-
-
- -
-
- -
-
-
-
-
-

It's worth noting, I think, that this same reasoning holds for any two numbers $n$ and $m$ the multiples of which we hope to sum. The multiples would have a cycle of differences of length $k$ and so we could compute the sum of $Nk$ multiples as above.

-

The sequence of differences will always be a palidrome. Consider an interval spanning the least common multiple of $n$ and $m$:

- -
|   |   |   |   |   |   |   |
-|      |      |      |      |
-
-
-

Here we have 4 and 7, and you can read off the sequence of differences directly from the diagram: 4 3 1 4 2 2 4 1 3 4.

-

Geometrically, the actual values of $n$ and $m$ and their lcm don't matter, the pattern they make will always be symmetrical around its midpoint. The same reasoning holds for multiples of more than two numbers.

- -
-
-
-
-
-
-
-

The Simplest Program

-
-
-
-
-
-
-
-

Of course, the simplest joy program for the first Project Euler problem is just:

- -
PE1 == 233168
-
-
-

Fin.

- -
-
-
-
-
- - - - - - diff --git a/docs/3. Developing a Program.ipynb b/docs/3. Developing a Program.ipynb deleted file mode 100644 index 0cb1730..0000000 --- a/docs/3. Developing a Program.ipynb +++ /dev/null @@ -1,1121 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# [Project Euler, first problem: \"Multiples of 3 and 5\"](https://projecteuler.net/problem=1)\n", - "\n", - " If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.\n", - "\n", - " Find the sum of all the multiples of 3 or 5 below 1000." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Let's create a predicate that returns `True` if a number is a multiple of 3 or 5 and `False` otherwise." - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [], - "source": [ - "define('P == [3 % not] dupdip 5 % not or')" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 80 P\n", - " 80 . P\n", - " 80 . [3 % not] dupdip 5 % not or\n", - "80 [3 % not] . dupdip 5 % not or\n", - " 80 . 3 % not 80 5 % not or\n", - " 80 3 . % not 80 5 % not or\n", - " 2 . not 80 5 % not or\n", - " False . 80 5 % not or\n", - " False 80 . 5 % not or\n", - " False 80 5 . % not or\n", - " False 0 . not or\n", - " False True . or\n", - " True . \n" - ] - } - ], - "source": [ - "V('80 P')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Given the predicate function `P` a suitable program is:\n", - "\n", - " PE1 == 1000 range [P] filter sum\n", - "\n", - "This function generates a list of the integers from 0 to 999, filters\n", - "that list by `P`, and then sums the result.\n", - "\n", - "Logically this is fine, but pragmatically we are doing more work than we\n", - "should be; we generate one thousand integers but actually use less than\n", - "half of them. A better solution would be to generate just the multiples\n", - "we want to sum, and to add them as we go rather than storing them and\n", - "adding summing them at the end.\n", - "\n", - "At first I had the idea to use two counters and increase them by three\n", - "and five, respectively. This way we only generate the terms that we\n", - "actually want to sum. We have to proceed by incrementing the counter\n", - "that is lower, or if they are equal, the three counter, and we have to\n", - "take care not to double add numbers like 15 that are multiples of both\n", - "three and five.\n", - "\n", - "This seemed a little clunky, so I tried a different approach.\n", - "\n", - "Consider the first few terms in the series:\n", - "\n", - " 3 5 6 9 10 12 15 18 20 21 ...\n", - "\n", - "Subtract each number from the one after it (subtracting 0 from 3):\n", - "\n", - " 3 5 6 9 10 12 15 18 20 21 24 25 27 30 ...\n", - " 0 3 5 6 9 10 12 15 18 20 21 24 25 27 ...\n", - " -------------------------------------------\n", - " 3 2 1 3 1 2 3 3 2 1 3 1 2 3 ...\n", - "\n", - "You get this lovely repeating palindromic sequence:\n", - "\n", - " 3 2 1 3 1 2 3\n", - "\n", - "To make a counter that increments by factors of 3 and 5 you just add\n", - "these differences to the counter one-by-one in a loop.\n", - "\n", - "\n", - "To make use of this sequence to increment a counter and sum terms as we\n", - "go we need a function that will accept the sum, the counter, and the next\n", - "term to add, and that adds the term to the counter and a copy of the\n", - "counter to the running sum. This function will do that:\n", - "\n", - " PE1.1 == + [+] dupdip" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.1 == + [+] dupdip')" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 0 0 3 PE1.1\n", - " 0 . 0 3 PE1.1\n", - " 0 0 . 3 PE1.1\n", - " 0 0 3 . PE1.1\n", - " 0 0 3 . + [+] dupdip\n", - " 0 3 . [+] dupdip\n", - "0 3 [+] . dupdip\n", - " 0 3 . + 3\n", - " 3 . 3\n", - " 3 3 . \n" - ] - } - ], - "source": [ - "V('0 0 3 PE1.1')" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 0 0 [3 2 1 3 1 2 3] [PE1.1] step\n", - " 0 . 0 [3 2 1 3 1 2 3] [PE1.1] step\n", - " 0 0 . [3 2 1 3 1 2 3] [PE1.1] step\n", - " 0 0 [3 2 1 3 1 2 3] . [PE1.1] step\n", - "0 0 [3 2 1 3 1 2 3] [PE1.1] . step\n", - " 0 0 3 [PE1.1] . i [2 1 3 1 2 3] [PE1.1] step\n", - " 0 0 3 . PE1.1 [2 1 3 1 2 3] [PE1.1] step\n", - " 0 0 3 . + [+] dupdip [2 1 3 1 2 3] [PE1.1] step\n", - " 0 3 . [+] dupdip [2 1 3 1 2 3] [PE1.1] step\n", - " 0 3 [+] . dupdip [2 1 3 1 2 3] [PE1.1] step\n", - " 0 3 . + 3 [2 1 3 1 2 3] [PE1.1] step\n", - " 3 . 3 [2 1 3 1 2 3] [PE1.1] step\n", - " 3 3 . [2 1 3 1 2 3] [PE1.1] step\n", - " 3 3 [2 1 3 1 2 3] . [PE1.1] step\n", - " 3 3 [2 1 3 1 2 3] [PE1.1] . step\n", - " 3 3 2 [PE1.1] . i [1 3 1 2 3] [PE1.1] step\n", - " 3 3 2 . PE1.1 [1 3 1 2 3] [PE1.1] step\n", - " 3 3 2 . + [+] dupdip [1 3 1 2 3] [PE1.1] step\n", - " 3 5 . [+] dupdip [1 3 1 2 3] [PE1.1] step\n", - " 3 5 [+] . dupdip [1 3 1 2 3] [PE1.1] step\n", - " 3 5 . + 5 [1 3 1 2 3] [PE1.1] step\n", - " 8 . 5 [1 3 1 2 3] [PE1.1] step\n", - " 8 5 . [1 3 1 2 3] [PE1.1] step\n", - " 8 5 [1 3 1 2 3] . [PE1.1] step\n", - " 8 5 [1 3 1 2 3] [PE1.1] . step\n", - " 8 5 1 [PE1.1] . i [3 1 2 3] [PE1.1] step\n", - " 8 5 1 . PE1.1 [3 1 2 3] [PE1.1] step\n", - " 8 5 1 . + [+] dupdip [3 1 2 3] [PE1.1] step\n", - " 8 6 . [+] dupdip [3 1 2 3] [PE1.1] step\n", - " 8 6 [+] . dupdip [3 1 2 3] [PE1.1] step\n", - " 8 6 . + 6 [3 1 2 3] [PE1.1] step\n", - " 14 . 6 [3 1 2 3] [PE1.1] step\n", - " 14 6 . [3 1 2 3] [PE1.1] step\n", - " 14 6 [3 1 2 3] . [PE1.1] step\n", - " 14 6 [3 1 2 3] [PE1.1] . step\n", - " 14 6 3 [PE1.1] . i [1 2 3] [PE1.1] step\n", - " 14 6 3 . PE1.1 [1 2 3] [PE1.1] step\n", - " 14 6 3 . + [+] dupdip [1 2 3] [PE1.1] step\n", - " 14 9 . [+] dupdip [1 2 3] [PE1.1] step\n", - " 14 9 [+] . dupdip [1 2 3] [PE1.1] step\n", - " 14 9 . + 9 [1 2 3] [PE1.1] step\n", - " 23 . 9 [1 2 3] [PE1.1] step\n", - " 23 9 . [1 2 3] [PE1.1] step\n", - " 23 9 [1 2 3] . [PE1.1] step\n", - " 23 9 [1 2 3] [PE1.1] . step\n", - " 23 9 1 [PE1.1] . i [2 3] [PE1.1] step\n", - " 23 9 1 . PE1.1 [2 3] [PE1.1] step\n", - " 23 9 1 . + [+] dupdip [2 3] [PE1.1] step\n", - " 23 10 . [+] dupdip [2 3] [PE1.1] step\n", - " 23 10 [+] . dupdip [2 3] [PE1.1] step\n", - " 23 10 . + 10 [2 3] [PE1.1] step\n", - " 33 . 10 [2 3] [PE1.1] step\n", - " 33 10 . [2 3] [PE1.1] step\n", - " 33 10 [2 3] . [PE1.1] step\n", - " 33 10 [2 3] [PE1.1] . step\n", - " 33 10 2 [PE1.1] . i [3] [PE1.1] step\n", - " 33 10 2 . PE1.1 [3] [PE1.1] step\n", - " 33 10 2 . + [+] dupdip [3] [PE1.1] step\n", - " 33 12 . [+] dupdip [3] [PE1.1] step\n", - " 33 12 [+] . dupdip [3] [PE1.1] step\n", - " 33 12 . + 12 [3] [PE1.1] step\n", - " 45 . 12 [3] [PE1.1] step\n", - " 45 12 . [3] [PE1.1] step\n", - " 45 12 [3] . [PE1.1] step\n", - " 45 12 [3] [PE1.1] . step\n", - " 45 12 3 [PE1.1] . i\n", - " 45 12 3 . PE1.1\n", - " 45 12 3 . + [+] dupdip\n", - " 45 15 . [+] dupdip\n", - " 45 15 [+] . dupdip\n", - " 45 15 . + 15\n", - " 60 . 15\n", - " 60 15 . \n" - ] - } - ], - "source": [ - "V('0 0 [3 2 1 3 1 2 3] [PE1.1] step')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "So one `step` through all seven terms brings the counter to 15 and the total to 60." - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "66" - ] - }, - "execution_count": 7, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "1000 / 15" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "990" - ] - }, - "execution_count": 8, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "66 * 15" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "10" - ] - }, - "execution_count": 9, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "1000 - 990" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We only want the terms *less than* 1000." - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "9" - ] - }, - "execution_count": 10, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "999 - 990" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "That means we want to run the full list of numbers sixty-six times to get to 990 and then the first four numbers 3 2 1 3 to get to 999." - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1 == 0 0 66 [[3 2 1 3 1 2 3] [PE1.1] step] times [3 2 1 3] [PE1.1] step pop')" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "233168\n" - ] - } - ], - "source": [ - "J('PE1')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "This form uses no extra storage and produces no unused summands. It's\n", - "good but there's one more trick we can apply. The list of seven terms\n", - "takes up at least seven bytes. But notice that all of the terms are less\n", - "than four, and so each can fit in just two bits. We could store all\n", - "seven terms in just fourteen bits and use masking and shifts to pick out\n", - "each term as we go. This will use less space and save time loading whole\n", - "integer terms from the list.\n", - "\n", - " 3 2 1 3 1 2 3\n", - " 0b 11 10 01 11 01 10 11 == 14811" - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "14811" - ] - }, - "execution_count": 13, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "0b11100111011011" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.2 == [3 & PE1.1] dupdip 2 >>')" - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 0 0 14811 PE1.2\n", - " 0 . 0 14811 PE1.2\n", - " 0 0 . 14811 PE1.2\n", - " 0 0 14811 . PE1.2\n", - " 0 0 14811 . [3 & PE1.1] dupdip 2 >>\n", - "0 0 14811 [3 & PE1.1] . dupdip 2 >>\n", - " 0 0 14811 . 3 & PE1.1 14811 2 >>\n", - " 0 0 14811 3 . & PE1.1 14811 2 >>\n", - " 0 0 3 . PE1.1 14811 2 >>\n", - " 0 0 3 . + [+] dupdip 14811 2 >>\n", - " 0 3 . [+] dupdip 14811 2 >>\n", - " 0 3 [+] . dupdip 14811 2 >>\n", - " 0 3 . + 3 14811 2 >>\n", - " 3 . 3 14811 2 >>\n", - " 3 3 . 14811 2 >>\n", - " 3 3 14811 . 2 >>\n", - " 3 3 14811 2 . >>\n", - " 3 3 3702 . \n" - ] - } - ], - "source": [ - "V('0 0 14811 PE1.2')" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 3 3 3702 PE1.2\n", - " 3 . 3 3702 PE1.2\n", - " 3 3 . 3702 PE1.2\n", - " 3 3 3702 . PE1.2\n", - " 3 3 3702 . [3 & PE1.1] dupdip 2 >>\n", - "3 3 3702 [3 & PE1.1] . dupdip 2 >>\n", - " 3 3 3702 . 3 & PE1.1 3702 2 >>\n", - " 3 3 3702 3 . & PE1.1 3702 2 >>\n", - " 3 3 2 . PE1.1 3702 2 >>\n", - " 3 3 2 . + [+] dupdip 3702 2 >>\n", - " 3 5 . [+] dupdip 3702 2 >>\n", - " 3 5 [+] . dupdip 3702 2 >>\n", - " 3 5 . + 5 3702 2 >>\n", - " 8 . 5 3702 2 >>\n", - " 8 5 . 3702 2 >>\n", - " 8 5 3702 . 2 >>\n", - " 8 5 3702 2 . >>\n", - " 8 5 925 . \n" - ] - } - ], - "source": [ - "V('3 3 3702 PE1.2')" - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 0 0 14811 7 [PE1.2] times pop\n", - " 0 . 0 14811 7 [PE1.2] times pop\n", - " 0 0 . 14811 7 [PE1.2] times pop\n", - " 0 0 14811 . 7 [PE1.2] times pop\n", - " 0 0 14811 7 . [PE1.2] times pop\n", - " 0 0 14811 7 [PE1.2] . times pop\n", - " 0 0 14811 [PE1.2] . i 6 [PE1.2] times pop\n", - " 0 0 14811 . PE1.2 6 [PE1.2] times pop\n", - " 0 0 14811 . [3 & PE1.1] dupdip 2 >> 6 [PE1.2] times pop\n", - "0 0 14811 [3 & PE1.1] . dupdip 2 >> 6 [PE1.2] times pop\n", - " 0 0 14811 . 3 & PE1.1 14811 2 >> 6 [PE1.2] times pop\n", - " 0 0 14811 3 . & PE1.1 14811 2 >> 6 [PE1.2] times pop\n", - " 0 0 3 . PE1.1 14811 2 >> 6 [PE1.2] times pop\n", - " 0 0 3 . + [+] dupdip 14811 2 >> 6 [PE1.2] times pop\n", - " 0 3 . [+] dupdip 14811 2 >> 6 [PE1.2] times pop\n", - " 0 3 [+] . dupdip 14811 2 >> 6 [PE1.2] times pop\n", - " 0 3 . + 3 14811 2 >> 6 [PE1.2] times pop\n", - " 3 . 3 14811 2 >> 6 [PE1.2] times pop\n", - " 3 3 . 14811 2 >> 6 [PE1.2] times pop\n", - " 3 3 14811 . 2 >> 6 [PE1.2] times pop\n", - " 3 3 14811 2 . >> 6 [PE1.2] times pop\n", - " 3 3 3702 . 6 [PE1.2] times pop\n", - " 3 3 3702 6 . [PE1.2] times pop\n", - " 3 3 3702 6 [PE1.2] . times pop\n", - " 3 3 3702 [PE1.2] . i 5 [PE1.2] times pop\n", - " 3 3 3702 . PE1.2 5 [PE1.2] times pop\n", - " 3 3 3702 . [3 & PE1.1] dupdip 2 >> 5 [PE1.2] times pop\n", - " 3 3 3702 [3 & PE1.1] . dupdip 2 >> 5 [PE1.2] times pop\n", - " 3 3 3702 . 3 & PE1.1 3702 2 >> 5 [PE1.2] times pop\n", - " 3 3 3702 3 . & PE1.1 3702 2 >> 5 [PE1.2] times pop\n", - " 3 3 2 . PE1.1 3702 2 >> 5 [PE1.2] times pop\n", - " 3 3 2 . + [+] dupdip 3702 2 >> 5 [PE1.2] times pop\n", - " 3 5 . [+] dupdip 3702 2 >> 5 [PE1.2] times pop\n", - " 3 5 [+] . dupdip 3702 2 >> 5 [PE1.2] times pop\n", - " 3 5 . + 5 3702 2 >> 5 [PE1.2] times pop\n", - " 8 . 5 3702 2 >> 5 [PE1.2] times pop\n", - " 8 5 . 3702 2 >> 5 [PE1.2] times pop\n", - " 8 5 3702 . 2 >> 5 [PE1.2] times pop\n", - " 8 5 3702 2 . >> 5 [PE1.2] times pop\n", - " 8 5 925 . 5 [PE1.2] times pop\n", - " 8 5 925 5 . [PE1.2] times pop\n", - " 8 5 925 5 [PE1.2] . times pop\n", - " 8 5 925 [PE1.2] . i 4 [PE1.2] times pop\n", - " 8 5 925 . PE1.2 4 [PE1.2] times pop\n", - " 8 5 925 . [3 & PE1.1] dupdip 2 >> 4 [PE1.2] times pop\n", - " 8 5 925 [3 & PE1.1] . dupdip 2 >> 4 [PE1.2] times pop\n", - " 8 5 925 . 3 & PE1.1 925 2 >> 4 [PE1.2] times pop\n", - " 8 5 925 3 . & PE1.1 925 2 >> 4 [PE1.2] times pop\n", - " 8 5 1 . PE1.1 925 2 >> 4 [PE1.2] times pop\n", - " 8 5 1 . + [+] dupdip 925 2 >> 4 [PE1.2] times pop\n", - " 8 6 . [+] dupdip 925 2 >> 4 [PE1.2] times pop\n", - " 8 6 [+] . dupdip 925 2 >> 4 [PE1.2] times pop\n", - " 8 6 . + 6 925 2 >> 4 [PE1.2] times pop\n", - " 14 . 6 925 2 >> 4 [PE1.2] times pop\n", - " 14 6 . 925 2 >> 4 [PE1.2] times pop\n", - " 14 6 925 . 2 >> 4 [PE1.2] times pop\n", - " 14 6 925 2 . >> 4 [PE1.2] times pop\n", - " 14 6 231 . 4 [PE1.2] times pop\n", - " 14 6 231 4 . [PE1.2] times pop\n", - " 14 6 231 4 [PE1.2] . times pop\n", - " 14 6 231 [PE1.2] . i 3 [PE1.2] times pop\n", - " 14 6 231 . PE1.2 3 [PE1.2] times pop\n", - " 14 6 231 . [3 & PE1.1] dupdip 2 >> 3 [PE1.2] times pop\n", - " 14 6 231 [3 & PE1.1] . dupdip 2 >> 3 [PE1.2] times pop\n", - " 14 6 231 . 3 & PE1.1 231 2 >> 3 [PE1.2] times pop\n", - " 14 6 231 3 . & PE1.1 231 2 >> 3 [PE1.2] times pop\n", - " 14 6 3 . PE1.1 231 2 >> 3 [PE1.2] times pop\n", - " 14 6 3 . + [+] dupdip 231 2 >> 3 [PE1.2] times pop\n", - " 14 9 . [+] dupdip 231 2 >> 3 [PE1.2] times pop\n", - " 14 9 [+] . dupdip 231 2 >> 3 [PE1.2] times pop\n", - " 14 9 . + 9 231 2 >> 3 [PE1.2] times pop\n", - " 23 . 9 231 2 >> 3 [PE1.2] times pop\n", - " 23 9 . 231 2 >> 3 [PE1.2] times pop\n", - " 23 9 231 . 2 >> 3 [PE1.2] times pop\n", - " 23 9 231 2 . >> 3 [PE1.2] times pop\n", - " 23 9 57 . 3 [PE1.2] times pop\n", - " 23 9 57 3 . [PE1.2] times pop\n", - " 23 9 57 3 [PE1.2] . times pop\n", - " 23 9 57 [PE1.2] . i 2 [PE1.2] times pop\n", - " 23 9 57 . PE1.2 2 [PE1.2] times pop\n", - " 23 9 57 . [3 & PE1.1] dupdip 2 >> 2 [PE1.2] times pop\n", - " 23 9 57 [3 & PE1.1] . dupdip 2 >> 2 [PE1.2] times pop\n", - " 23 9 57 . 3 & PE1.1 57 2 >> 2 [PE1.2] times pop\n", - " 23 9 57 3 . & PE1.1 57 2 >> 2 [PE1.2] times pop\n", - " 23 9 1 . PE1.1 57 2 >> 2 [PE1.2] times pop\n", - " 23 9 1 . + [+] dupdip 57 2 >> 2 [PE1.2] times pop\n", - " 23 10 . [+] dupdip 57 2 >> 2 [PE1.2] times pop\n", - " 23 10 [+] . dupdip 57 2 >> 2 [PE1.2] times pop\n", - " 23 10 . + 10 57 2 >> 2 [PE1.2] times pop\n", - " 33 . 10 57 2 >> 2 [PE1.2] times pop\n", - " 33 10 . 57 2 >> 2 [PE1.2] times pop\n", - " 33 10 57 . 2 >> 2 [PE1.2] times pop\n", - " 33 10 57 2 . >> 2 [PE1.2] times pop\n", - " 33 10 14 . 2 [PE1.2] times pop\n", - " 33 10 14 2 . [PE1.2] times pop\n", - " 33 10 14 2 [PE1.2] . times pop\n", - " 33 10 14 [PE1.2] . i 1 [PE1.2] times pop\n", - " 33 10 14 . PE1.2 1 [PE1.2] times pop\n", - " 33 10 14 . [3 & PE1.1] dupdip 2 >> 1 [PE1.2] times pop\n", - " 33 10 14 [3 & PE1.1] . dupdip 2 >> 1 [PE1.2] times pop\n", - " 33 10 14 . 3 & PE1.1 14 2 >> 1 [PE1.2] times pop\n", - " 33 10 14 3 . & PE1.1 14 2 >> 1 [PE1.2] times pop\n", - " 33 10 2 . PE1.1 14 2 >> 1 [PE1.2] times pop\n", - " 33 10 2 . + [+] dupdip 14 2 >> 1 [PE1.2] times pop\n", - " 33 12 . [+] dupdip 14 2 >> 1 [PE1.2] times pop\n", - " 33 12 [+] . dupdip 14 2 >> 1 [PE1.2] times pop\n", - " 33 12 . + 12 14 2 >> 1 [PE1.2] times pop\n", - " 45 . 12 14 2 >> 1 [PE1.2] times pop\n", - " 45 12 . 14 2 >> 1 [PE1.2] times pop\n", - " 45 12 14 . 2 >> 1 [PE1.2] times pop\n", - " 45 12 14 2 . >> 1 [PE1.2] times pop\n", - " 45 12 3 . 1 [PE1.2] times pop\n", - " 45 12 3 1 . [PE1.2] times pop\n", - " 45 12 3 1 [PE1.2] . times pop\n", - " 45 12 3 [PE1.2] . i pop\n", - " 45 12 3 . PE1.2 pop\n", - " 45 12 3 . [3 & PE1.1] dupdip 2 >> pop\n", - " 45 12 3 [3 & PE1.1] . dupdip 2 >> pop\n", - " 45 12 3 . 3 & PE1.1 3 2 >> pop\n", - " 45 12 3 3 . & PE1.1 3 2 >> pop\n", - " 45 12 3 . PE1.1 3 2 >> pop\n", - " 45 12 3 . + [+] dupdip 3 2 >> pop\n", - " 45 15 . [+] dupdip 3 2 >> pop\n", - " 45 15 [+] . dupdip 3 2 >> pop\n", - " 45 15 . + 15 3 2 >> pop\n", - " 60 . 15 3 2 >> pop\n", - " 60 15 . 3 2 >> pop\n", - " 60 15 3 . 2 >> pop\n", - " 60 15 3 2 . >> pop\n", - " 60 15 0 . pop\n", - " 60 15 . \n" - ] - } - ], - "source": [ - "V('0 0 14811 7 [PE1.2] times pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "And so we have at last:" - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1 == 0 0 66 [14811 7 [PE1.2] times pop] times 14811 4 [PE1.2] times popop')" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "233168\n" - ] - } - ], - "source": [ - "J('PE1')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Let's refactor.\n", - "\n", - " 14811 7 [PE1.2] times pop\n", - " 14811 4 [PE1.2] times pop\n", - " 14811 n [PE1.2] times pop\n", - " n 14811 swap [PE1.2] times pop" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.3 == 14811 swap [PE1.2] times pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we can simplify the definition above:" - ] - }, - { - "cell_type": "code", - "execution_count": 21, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop')" - ] - }, - { - "cell_type": "code", - "execution_count": 22, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "233168\n" - ] - } - ], - "source": [ - "J('PE1')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Here's our joy program all in one place. It doesn't make so much sense, but if you have read through the above description of how it was derived I hope it's clear.\n", - "\n", - " PE1.1 == + [+] dupdip\n", - " PE1.2 == [3 & PE1.1] dupdip 2 >>\n", - " PE1.3 == 14811 swap [PE1.2] times pop\n", - " PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Generator Version\n", - "It's a little clunky iterating sixty-six times though the seven numbers then four more. In the _Generator Programs_ notebook we derive a generator that can be repeatedly driven by the `x` combinator to produce a stream of the seven numbers repeating over and over again." - ] - }, - { - "cell_type": "code", - "execution_count": 23, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.terms == [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons]')" - ] - }, - { - "cell_type": "code", - "execution_count": 24, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons]\n" - ] - } - ], - "source": [ - "J('PE1.terms 21 [x] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We know from above that we need sixty-six times seven then four more terms to reach up to but not over one thousand." - ] - }, - { - "cell_type": "code", - "execution_count": 25, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "466\n" - ] - } - ], - "source": [ - "J('7 66 * 4 +')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Here they are..." - ] - }, - { - "cell_type": "code", - "execution_count": 26, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3\n" - ] - } - ], - "source": [ - "J('PE1.terms 466 [x] times pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### ...and they do sum to 999." - ] - }, - { - "cell_type": "code", - "execution_count": 27, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "999\n" - ] - } - ], - "source": [ - "J('[PE1.terms 466 [x] times pop] run sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we can use `PE1.1` to accumulate the terms as we go, and then `pop` the generator and the counter from the stack when we're done, leaving just the sum." - ] - }, - { - "cell_type": "code", - "execution_count": 28, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "233168\n" - ] - } - ], - "source": [ - "J('0 0 PE1.terms 466 [x [PE1.1] dip] times popop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# A little further analysis renders iteration unnecessary.\n", - "Consider finding the sum of the positive integers less than or equal to ten." - ] - }, - { - "cell_type": "code", - "execution_count": 29, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "55\n" - ] - } - ], - "source": [ - "J('[10 9 8 7 6 5 4 3 2 1] sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Instead of summing them, [observe](https://en.wikipedia.org/wiki/File:Animated_proof_for_the_formula_giving_the_sum_of_the_first_integers_1%2B2%2B...%2Bn.gif):\n", - "\n", - " 10 9 8 7 6\n", - " + 1 2 3 4 5\n", - " ---- -- -- -- --\n", - " 11 11 11 11 11\n", - " \n", - " 11 * 5 = 55\n", - "\n", - "From the above example we can deduce that the sum of the first N positive integers is:\n", - "\n", - " (N + 1) * N / 2 \n", - "\n", - "(The formula also works for odd values of N, I'll leave that to you if you want to work it out or you can take my word for it.)" - ] - }, - { - "cell_type": "code", - "execution_count": 30, - "metadata": {}, - "outputs": [], - "source": [ - "define('F == dup ++ * 2 floordiv')" - ] - }, - { - "cell_type": "code", - "execution_count": 31, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 10 F\n", - " 10 . F\n", - " 10 . dup ++ * 2 floordiv\n", - "10 10 . ++ * 2 floordiv\n", - "10 11 . * 2 floordiv\n", - " 110 . 2 floordiv\n", - "110 2 . floordiv\n", - " 55 . \n" - ] - } - ], - "source": [ - "V('10 F')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Generalizing to Blocks of Terms\n", - "We can apply the same reasoning to the PE1 problem.\n", - "\n", - "Between 0 and 990 inclusive there are sixty-six \"blocks\" of seven terms each, starting with:\n", - "\n", - " [3 5 6 9 10 12 15]\n", - " \n", - "And ending with:\n", - "\n", - " [978 980 981 984 985 987 990]\n", - " \n", - "If we reverse one of these two blocks and sum pairs..." - ] - }, - { - "cell_type": "code", - "execution_count": 32, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[[978 15] [980 12] [981 10] [984 9] [985 6] [987 5] [990 3]]\n" - ] - } - ], - "source": [ - "J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip')" - ] - }, - { - "cell_type": "code", - "execution_count": 33, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[993 992 991 993 991 992 993]\n" - ] - } - ], - "source": [ - "J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "(Interesting that the sequence of seven numbers appears again in the rightmost digit of each term.)" - ] - }, - { - "cell_type": "code", - "execution_count": 34, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6945\n" - ] - } - ], - "source": [ - "J('[ 3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Since there are sixty-six blocks and we are pairing them up, there must be thirty-three pairs, each of which sums to 6945. We also have these additional unpaired terms between 990 and 1000:\n", - "\n", - " 993 995 996 999\n", - " \n", - "So we can give the \"sum of all the multiples of 3 or 5 below 1000\" like so:" - ] - }, - { - "cell_type": "code", - "execution_count": 35, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "233168\n" - ] - } - ], - "source": [ - "J('6945 33 * [993 995 996 999] cons sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "It's worth noting, I think, that this same reasoning holds for any two numbers $n$ and $m$ the multiples of which we hope to sum. The multiples would have a cycle of differences of length $k$ and so we could compute the sum of $Nk$ multiples as above.\n", - "\n", - "The sequence of differences will always be a palidrome. Consider an interval spanning the least common multiple of $n$ and $m$:\n", - "\n", - " | | | | | | | |\n", - " | | | | |\n", - " \n", - "Here we have 4 and 7, and you can read off the sequence of differences directly from the diagram: 4 3 1 4 2 2 4 1 3 4.\n", - " \n", - "Geometrically, the actual values of $n$ and $m$ and their *lcm* don't matter, the pattern they make will always be symmetrical around its midpoint. The same reasoning holds for multiples of more than two numbers." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# The Simplest Program" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Of course, the simplest joy program for the first Project Euler problem is just:\n", - "\n", - " PE1 == 233168\n", - "\n", - "Fin." - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/3. Developing a Program.md b/docs/3. Developing a Program.md deleted file mode 100644 index f68f30a..0000000 --- a/docs/3. Developing a Program.md +++ /dev/null @@ -1,694 +0,0 @@ - -# [Project Euler, first problem: "Multiples of 3 and 5"](https://projecteuler.net/problem=1) - - If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. - - Find the sum of all the multiples of 3 or 5 below 1000. - - -```python -from notebook_preamble import J, V, define -``` - -Let's create a predicate that returns `True` if a number is a multiple of 3 or 5 and `False` otherwise. - - -```python -define('P == [3 % not] dupdip 5 % not or') -``` - - -```python -V('80 P') -``` - - . 80 P - 80 . P - 80 . [3 % not] dupdip 5 % not or - 80 [3 % not] . dupdip 5 % not or - 80 . 3 % not 80 5 % not or - 80 3 . % not 80 5 % not or - 2 . not 80 5 % not or - False . 80 5 % not or - False 80 . 5 % not or - False 80 5 . % not or - False 0 . not or - False True . or - True . - - -Given the predicate function `P` a suitable program is: - - PE1 == 1000 range [P] filter sum - -This function generates a list of the integers from 0 to 999, filters -that list by `P`, and then sums the result. - -Logically this is fine, but pragmatically we are doing more work than we -should be; we generate one thousand integers but actually use less than -half of them. A better solution would be to generate just the multiples -we want to sum, and to add them as we go rather than storing them and -adding summing them at the end. - -At first I had the idea to use two counters and increase them by three -and five, respectively. This way we only generate the terms that we -actually want to sum. We have to proceed by incrementing the counter -that is lower, or if they are equal, the three counter, and we have to -take care not to double add numbers like 15 that are multiples of both -three and five. - -This seemed a little clunky, so I tried a different approach. - -Consider the first few terms in the series: - - 3 5 6 9 10 12 15 18 20 21 ... - -Subtract each number from the one after it (subtracting 0 from 3): - - 3 5 6 9 10 12 15 18 20 21 24 25 27 30 ... - 0 3 5 6 9 10 12 15 18 20 21 24 25 27 ... - ------------------------------------------- - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 ... - -You get this lovely repeating palindromic sequence: - - 3 2 1 3 1 2 3 - -To make a counter that increments by factors of 3 and 5 you just add -these differences to the counter one-by-one in a loop. - - -To make use of this sequence to increment a counter and sum terms as we -go we need a function that will accept the sum, the counter, and the next -term to add, and that adds the term to the counter and a copy of the -counter to the running sum. This function will do that: - - PE1.1 == + [+] dupdip - - -```python -define('PE1.1 == + [+] dupdip') -``` - - -```python -V('0 0 3 PE1.1') -``` - - . 0 0 3 PE1.1 - 0 . 0 3 PE1.1 - 0 0 . 3 PE1.1 - 0 0 3 . PE1.1 - 0 0 3 . + [+] dupdip - 0 3 . [+] dupdip - 0 3 [+] . dupdip - 0 3 . + 3 - 3 . 3 - 3 3 . - - - -```python -V('0 0 [3 2 1 3 1 2 3] [PE1.1] step') -``` - - . 0 0 [3 2 1 3 1 2 3] [PE1.1] step - 0 . 0 [3 2 1 3 1 2 3] [PE1.1] step - 0 0 . [3 2 1 3 1 2 3] [PE1.1] step - 0 0 [3 2 1 3 1 2 3] . [PE1.1] step - 0 0 [3 2 1 3 1 2 3] [PE1.1] . step - 0 0 3 [PE1.1] . i [2 1 3 1 2 3] [PE1.1] step - 0 0 3 . PE1.1 [2 1 3 1 2 3] [PE1.1] step - 0 0 3 . + [+] dupdip [2 1 3 1 2 3] [PE1.1] step - 0 3 . [+] dupdip [2 1 3 1 2 3] [PE1.1] step - 0 3 [+] . dupdip [2 1 3 1 2 3] [PE1.1] step - 0 3 . + 3 [2 1 3 1 2 3] [PE1.1] step - 3 . 3 [2 1 3 1 2 3] [PE1.1] step - 3 3 . [2 1 3 1 2 3] [PE1.1] step - 3 3 [2 1 3 1 2 3] . [PE1.1] step - 3 3 [2 1 3 1 2 3] [PE1.1] . step - 3 3 2 [PE1.1] . i [1 3 1 2 3] [PE1.1] step - 3 3 2 . PE1.1 [1 3 1 2 3] [PE1.1] step - 3 3 2 . + [+] dupdip [1 3 1 2 3] [PE1.1] step - 3 5 . [+] dupdip [1 3 1 2 3] [PE1.1] step - 3 5 [+] . dupdip [1 3 1 2 3] [PE1.1] step - 3 5 . + 5 [1 3 1 2 3] [PE1.1] step - 8 . 5 [1 3 1 2 3] [PE1.1] step - 8 5 . [1 3 1 2 3] [PE1.1] step - 8 5 [1 3 1 2 3] . [PE1.1] step - 8 5 [1 3 1 2 3] [PE1.1] . step - 8 5 1 [PE1.1] . i [3 1 2 3] [PE1.1] step - 8 5 1 . PE1.1 [3 1 2 3] [PE1.1] step - 8 5 1 . + [+] dupdip [3 1 2 3] [PE1.1] step - 8 6 . [+] dupdip [3 1 2 3] [PE1.1] step - 8 6 [+] . dupdip [3 1 2 3] [PE1.1] step - 8 6 . + 6 [3 1 2 3] [PE1.1] step - 14 . 6 [3 1 2 3] [PE1.1] step - 14 6 . [3 1 2 3] [PE1.1] step - 14 6 [3 1 2 3] . [PE1.1] step - 14 6 [3 1 2 3] [PE1.1] . step - 14 6 3 [PE1.1] . i [1 2 3] [PE1.1] step - 14 6 3 . PE1.1 [1 2 3] [PE1.1] step - 14 6 3 . + [+] dupdip [1 2 3] [PE1.1] step - 14 9 . [+] dupdip [1 2 3] [PE1.1] step - 14 9 [+] . dupdip [1 2 3] [PE1.1] step - 14 9 . + 9 [1 2 3] [PE1.1] step - 23 . 9 [1 2 3] [PE1.1] step - 23 9 . [1 2 3] [PE1.1] step - 23 9 [1 2 3] . [PE1.1] step - 23 9 [1 2 3] [PE1.1] . step - 23 9 1 [PE1.1] . i [2 3] [PE1.1] step - 23 9 1 . PE1.1 [2 3] [PE1.1] step - 23 9 1 . + [+] dupdip [2 3] [PE1.1] step - 23 10 . [+] dupdip [2 3] [PE1.1] step - 23 10 [+] . dupdip [2 3] [PE1.1] step - 23 10 . + 10 [2 3] [PE1.1] step - 33 . 10 [2 3] [PE1.1] step - 33 10 . [2 3] [PE1.1] step - 33 10 [2 3] . [PE1.1] step - 33 10 [2 3] [PE1.1] . step - 33 10 2 [PE1.1] . i [3] [PE1.1] step - 33 10 2 . PE1.1 [3] [PE1.1] step - 33 10 2 . + [+] dupdip [3] [PE1.1] step - 33 12 . [+] dupdip [3] [PE1.1] step - 33 12 [+] . dupdip [3] [PE1.1] step - 33 12 . + 12 [3] [PE1.1] step - 45 . 12 [3] [PE1.1] step - 45 12 . [3] [PE1.1] step - 45 12 [3] . [PE1.1] step - 45 12 [3] [PE1.1] . step - 45 12 3 [PE1.1] . i - 45 12 3 . PE1.1 - 45 12 3 . + [+] dupdip - 45 15 . [+] dupdip - 45 15 [+] . dupdip - 45 15 . + 15 - 60 . 15 - 60 15 . - - -So one `step` through all seven terms brings the counter to 15 and the total to 60. - - -```python -1000 / 15 -``` - - - - - 66 - - - - -```python -66 * 15 -``` - - - - - 990 - - - - -```python -1000 - 990 -``` - - - - - 10 - - - -We only want the terms *less than* 1000. - - -```python -999 - 990 -``` - - - - - 9 - - - -That means we want to run the full list of numbers sixty-six times to get to 990 and then the first four numbers 3 2 1 3 to get to 999. - - -```python -define('PE1 == 0 0 66 [[3 2 1 3 1 2 3] [PE1.1] step] times [3 2 1 3] [PE1.1] step pop') -``` - - -```python -J('PE1') -``` - - 233168 - - -This form uses no extra storage and produces no unused summands. It's -good but there's one more trick we can apply. The list of seven terms -takes up at least seven bytes. But notice that all of the terms are less -than four, and so each can fit in just two bits. We could store all -seven terms in just fourteen bits and use masking and shifts to pick out -each term as we go. This will use less space and save time loading whole -integer terms from the list. - - 3 2 1 3 1 2 3 - 0b 11 10 01 11 01 10 11 == 14811 - - -```python -0b11100111011011 -``` - - - - - 14811 - - - - -```python -define('PE1.2 == [3 & PE1.1] dupdip 2 >>') -``` - - -```python -V('0 0 14811 PE1.2') -``` - - . 0 0 14811 PE1.2 - 0 . 0 14811 PE1.2 - 0 0 . 14811 PE1.2 - 0 0 14811 . PE1.2 - 0 0 14811 . [3 & PE1.1] dupdip 2 >> - 0 0 14811 [3 & PE1.1] . dupdip 2 >> - 0 0 14811 . 3 & PE1.1 14811 2 >> - 0 0 14811 3 . & PE1.1 14811 2 >> - 0 0 3 . PE1.1 14811 2 >> - 0 0 3 . + [+] dupdip 14811 2 >> - 0 3 . [+] dupdip 14811 2 >> - 0 3 [+] . dupdip 14811 2 >> - 0 3 . + 3 14811 2 >> - 3 . 3 14811 2 >> - 3 3 . 14811 2 >> - 3 3 14811 . 2 >> - 3 3 14811 2 . >> - 3 3 3702 . - - - -```python -V('3 3 3702 PE1.2') -``` - - . 3 3 3702 PE1.2 - 3 . 3 3702 PE1.2 - 3 3 . 3702 PE1.2 - 3 3 3702 . PE1.2 - 3 3 3702 . [3 & PE1.1] dupdip 2 >> - 3 3 3702 [3 & PE1.1] . dupdip 2 >> - 3 3 3702 . 3 & PE1.1 3702 2 >> - 3 3 3702 3 . & PE1.1 3702 2 >> - 3 3 2 . PE1.1 3702 2 >> - 3 3 2 . + [+] dupdip 3702 2 >> - 3 5 . [+] dupdip 3702 2 >> - 3 5 [+] . dupdip 3702 2 >> - 3 5 . + 5 3702 2 >> - 8 . 5 3702 2 >> - 8 5 . 3702 2 >> - 8 5 3702 . 2 >> - 8 5 3702 2 . >> - 8 5 925 . - - - -```python -V('0 0 14811 7 [PE1.2] times pop') -``` - - . 0 0 14811 7 [PE1.2] times pop - 0 . 0 14811 7 [PE1.2] times pop - 0 0 . 14811 7 [PE1.2] times pop - 0 0 14811 . 7 [PE1.2] times pop - 0 0 14811 7 . [PE1.2] times pop - 0 0 14811 7 [PE1.2] . times pop - 0 0 14811 [PE1.2] . i 6 [PE1.2] times pop - 0 0 14811 . PE1.2 6 [PE1.2] times pop - 0 0 14811 . [3 & PE1.1] dupdip 2 >> 6 [PE1.2] times pop - 0 0 14811 [3 & PE1.1] . dupdip 2 >> 6 [PE1.2] times pop - 0 0 14811 . 3 & PE1.1 14811 2 >> 6 [PE1.2] times pop - 0 0 14811 3 . & PE1.1 14811 2 >> 6 [PE1.2] times pop - 0 0 3 . PE1.1 14811 2 >> 6 [PE1.2] times pop - 0 0 3 . + [+] dupdip 14811 2 >> 6 [PE1.2] times pop - 0 3 . [+] dupdip 14811 2 >> 6 [PE1.2] times pop - 0 3 [+] . dupdip 14811 2 >> 6 [PE1.2] times pop - 0 3 . + 3 14811 2 >> 6 [PE1.2] times pop - 3 . 3 14811 2 >> 6 [PE1.2] times pop - 3 3 . 14811 2 >> 6 [PE1.2] times pop - 3 3 14811 . 2 >> 6 [PE1.2] times pop - 3 3 14811 2 . >> 6 [PE1.2] times pop - 3 3 3702 . 6 [PE1.2] times pop - 3 3 3702 6 . [PE1.2] times pop - 3 3 3702 6 [PE1.2] . times pop - 3 3 3702 [PE1.2] . i 5 [PE1.2] times pop - 3 3 3702 . PE1.2 5 [PE1.2] times pop - 3 3 3702 . [3 & PE1.1] dupdip 2 >> 5 [PE1.2] times pop - 3 3 3702 [3 & PE1.1] . dupdip 2 >> 5 [PE1.2] times pop - 3 3 3702 . 3 & PE1.1 3702 2 >> 5 [PE1.2] times pop - 3 3 3702 3 . & PE1.1 3702 2 >> 5 [PE1.2] times pop - 3 3 2 . PE1.1 3702 2 >> 5 [PE1.2] times pop - 3 3 2 . + [+] dupdip 3702 2 >> 5 [PE1.2] times pop - 3 5 . [+] dupdip 3702 2 >> 5 [PE1.2] times pop - 3 5 [+] . dupdip 3702 2 >> 5 [PE1.2] times pop - 3 5 . + 5 3702 2 >> 5 [PE1.2] times pop - 8 . 5 3702 2 >> 5 [PE1.2] times pop - 8 5 . 3702 2 >> 5 [PE1.2] times pop - 8 5 3702 . 2 >> 5 [PE1.2] times pop - 8 5 3702 2 . >> 5 [PE1.2] times pop - 8 5 925 . 5 [PE1.2] times pop - 8 5 925 5 . [PE1.2] times pop - 8 5 925 5 [PE1.2] . times pop - 8 5 925 [PE1.2] . i 4 [PE1.2] times pop - 8 5 925 . PE1.2 4 [PE1.2] times pop - 8 5 925 . [3 & PE1.1] dupdip 2 >> 4 [PE1.2] times pop - 8 5 925 [3 & PE1.1] . dupdip 2 >> 4 [PE1.2] times pop - 8 5 925 . 3 & PE1.1 925 2 >> 4 [PE1.2] times pop - 8 5 925 3 . & PE1.1 925 2 >> 4 [PE1.2] times pop - 8 5 1 . PE1.1 925 2 >> 4 [PE1.2] times pop - 8 5 1 . + [+] dupdip 925 2 >> 4 [PE1.2] times pop - 8 6 . [+] dupdip 925 2 >> 4 [PE1.2] times pop - 8 6 [+] . dupdip 925 2 >> 4 [PE1.2] times pop - 8 6 . + 6 925 2 >> 4 [PE1.2] times pop - 14 . 6 925 2 >> 4 [PE1.2] times pop - 14 6 . 925 2 >> 4 [PE1.2] times pop - 14 6 925 . 2 >> 4 [PE1.2] times pop - 14 6 925 2 . >> 4 [PE1.2] times pop - 14 6 231 . 4 [PE1.2] times pop - 14 6 231 4 . [PE1.2] times pop - 14 6 231 4 [PE1.2] . times pop - 14 6 231 [PE1.2] . i 3 [PE1.2] times pop - 14 6 231 . PE1.2 3 [PE1.2] times pop - 14 6 231 . [3 & PE1.1] dupdip 2 >> 3 [PE1.2] times pop - 14 6 231 [3 & PE1.1] . dupdip 2 >> 3 [PE1.2] times pop - 14 6 231 . 3 & PE1.1 231 2 >> 3 [PE1.2] times pop - 14 6 231 3 . & PE1.1 231 2 >> 3 [PE1.2] times pop - 14 6 3 . PE1.1 231 2 >> 3 [PE1.2] times pop - 14 6 3 . + [+] dupdip 231 2 >> 3 [PE1.2] times pop - 14 9 . [+] dupdip 231 2 >> 3 [PE1.2] times pop - 14 9 [+] . dupdip 231 2 >> 3 [PE1.2] times pop - 14 9 . + 9 231 2 >> 3 [PE1.2] times pop - 23 . 9 231 2 >> 3 [PE1.2] times pop - 23 9 . 231 2 >> 3 [PE1.2] times pop - 23 9 231 . 2 >> 3 [PE1.2] times pop - 23 9 231 2 . >> 3 [PE1.2] times pop - 23 9 57 . 3 [PE1.2] times pop - 23 9 57 3 . [PE1.2] times pop - 23 9 57 3 [PE1.2] . times pop - 23 9 57 [PE1.2] . i 2 [PE1.2] times pop - 23 9 57 . PE1.2 2 [PE1.2] times pop - 23 9 57 . [3 & PE1.1] dupdip 2 >> 2 [PE1.2] times pop - 23 9 57 [3 & PE1.1] . dupdip 2 >> 2 [PE1.2] times pop - 23 9 57 . 3 & PE1.1 57 2 >> 2 [PE1.2] times pop - 23 9 57 3 . & PE1.1 57 2 >> 2 [PE1.2] times pop - 23 9 1 . PE1.1 57 2 >> 2 [PE1.2] times pop - 23 9 1 . + [+] dupdip 57 2 >> 2 [PE1.2] times pop - 23 10 . [+] dupdip 57 2 >> 2 [PE1.2] times pop - 23 10 [+] . dupdip 57 2 >> 2 [PE1.2] times pop - 23 10 . + 10 57 2 >> 2 [PE1.2] times pop - 33 . 10 57 2 >> 2 [PE1.2] times pop - 33 10 . 57 2 >> 2 [PE1.2] times pop - 33 10 57 . 2 >> 2 [PE1.2] times pop - 33 10 57 2 . >> 2 [PE1.2] times pop - 33 10 14 . 2 [PE1.2] times pop - 33 10 14 2 . [PE1.2] times pop - 33 10 14 2 [PE1.2] . times pop - 33 10 14 [PE1.2] . i 1 [PE1.2] times pop - 33 10 14 . PE1.2 1 [PE1.2] times pop - 33 10 14 . [3 & PE1.1] dupdip 2 >> 1 [PE1.2] times pop - 33 10 14 [3 & PE1.1] . dupdip 2 >> 1 [PE1.2] times pop - 33 10 14 . 3 & PE1.1 14 2 >> 1 [PE1.2] times pop - 33 10 14 3 . & PE1.1 14 2 >> 1 [PE1.2] times pop - 33 10 2 . PE1.1 14 2 >> 1 [PE1.2] times pop - 33 10 2 . + [+] dupdip 14 2 >> 1 [PE1.2] times pop - 33 12 . [+] dupdip 14 2 >> 1 [PE1.2] times pop - 33 12 [+] . dupdip 14 2 >> 1 [PE1.2] times pop - 33 12 . + 12 14 2 >> 1 [PE1.2] times pop - 45 . 12 14 2 >> 1 [PE1.2] times pop - 45 12 . 14 2 >> 1 [PE1.2] times pop - 45 12 14 . 2 >> 1 [PE1.2] times pop - 45 12 14 2 . >> 1 [PE1.2] times pop - 45 12 3 . 1 [PE1.2] times pop - 45 12 3 1 . [PE1.2] times pop - 45 12 3 1 [PE1.2] . times pop - 45 12 3 [PE1.2] . i pop - 45 12 3 . PE1.2 pop - 45 12 3 . [3 & PE1.1] dupdip 2 >> pop - 45 12 3 [3 & PE1.1] . dupdip 2 >> pop - 45 12 3 . 3 & PE1.1 3 2 >> pop - 45 12 3 3 . & PE1.1 3 2 >> pop - 45 12 3 . PE1.1 3 2 >> pop - 45 12 3 . + [+] dupdip 3 2 >> pop - 45 15 . [+] dupdip 3 2 >> pop - 45 15 [+] . dupdip 3 2 >> pop - 45 15 . + 15 3 2 >> pop - 60 . 15 3 2 >> pop - 60 15 . 3 2 >> pop - 60 15 3 . 2 >> pop - 60 15 3 2 . >> pop - 60 15 0 . pop - 60 15 . - - -And so we have at last: - - -```python -define('PE1 == 0 0 66 [14811 7 [PE1.2] times pop] times 14811 4 [PE1.2] times popop') -``` - - -```python -J('PE1') -``` - - 233168 - - -Let's refactor. - - 14811 7 [PE1.2] times pop - 14811 4 [PE1.2] times pop - 14811 n [PE1.2] times pop - n 14811 swap [PE1.2] times pop - - -```python -define('PE1.3 == 14811 swap [PE1.2] times pop') -``` - -Now we can simplify the definition above: - - -```python -define('PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop') -``` - - -```python -J('PE1') -``` - - 233168 - - -Here's our joy program all in one place. It doesn't make so much sense, but if you have read through the above description of how it was derived I hope it's clear. - - PE1.1 == + [+] dupdip - PE1.2 == [3 & PE1.1] dupdip 2 >> - PE1.3 == 14811 swap [PE1.2] times pop - PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop - -# Generator Version -It's a little clunky iterating sixty-six times though the seven numbers then four more. In the _Generator Programs_ notebook we derive a generator that can be repeatedly driven by the `x` combinator to produce a stream of the seven numbers repeating over and over again. - - -```python -define('PE1.terms == [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons]') -``` - - -```python -J('PE1.terms 21 [x] times') -``` - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons] - - -We know from above that we need sixty-six times seven then four more terms to reach up to but not over one thousand. - - -```python -J('7 66 * 4 +') -``` - - 466 - - -### Here they are... - - -```python -J('PE1.terms 466 [x] times pop') -``` - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 - - -### ...and they do sum to 999. - - -```python -J('[PE1.terms 466 [x] times pop] run sum') -``` - - 999 - - -Now we can use `PE1.1` to accumulate the terms as we go, and then `pop` the generator and the counter from the stack when we're done, leaving just the sum. - - -```python -J('0 0 PE1.terms 466 [x [PE1.1] dip] times popop') -``` - - 233168 - - -# A little further analysis renders iteration unnecessary. -Consider finding the sum of the positive integers less than or equal to ten. - - -```python -J('[10 9 8 7 6 5 4 3 2 1] sum') -``` - - 55 - - -Instead of summing them, [observe](https://en.wikipedia.org/wiki/File:Animated_proof_for_the_formula_giving_the_sum_of_the_first_integers_1%2B2%2B...%2Bn.gif): - - 10 9 8 7 6 - + 1 2 3 4 5 - ---- -- -- -- -- - 11 11 11 11 11 - - 11 * 5 = 55 - -From the above example we can deduce that the sum of the first N positive integers is: - - (N + 1) * N / 2 - -(The formula also works for odd values of N, I'll leave that to you if you want to work it out or you can take my word for it.) - - -```python -define('F == dup ++ * 2 floordiv') -``` - - -```python -V('10 F') -``` - - . 10 F - 10 . F - 10 . dup ++ * 2 floordiv - 10 10 . ++ * 2 floordiv - 10 11 . * 2 floordiv - 110 . 2 floordiv - 110 2 . floordiv - 55 . - - -## Generalizing to Blocks of Terms -We can apply the same reasoning to the PE1 problem. - -Between 0 and 990 inclusive there are sixty-six "blocks" of seven terms each, starting with: - - [3 5 6 9 10 12 15] - -And ending with: - - [978 980 981 984 985 987 990] - -If we reverse one of these two blocks and sum pairs... - - -```python -J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip') -``` - - [[978 15] [980 12] [981 10] [984 9] [985 6] [987 5] [990 3]] - - - -```python -J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map') -``` - - [993 992 991 993 991 992 993] - - -(Interesting that the sequence of seven numbers appears again in the rightmost digit of each term.) - - -```python -J('[ 3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map sum') -``` - - 6945 - - -Since there are sixty-six blocks and we are pairing them up, there must be thirty-three pairs, each of which sums to 6945. We also have these additional unpaired terms between 990 and 1000: - - 993 995 996 999 - -So we can give the "sum of all the multiples of 3 or 5 below 1000" like so: - - -```python -J('6945 33 * [993 995 996 999] cons sum') -``` - - 233168 - - -It's worth noting, I think, that this same reasoning holds for any two numbers $n$ and $m$ the multiples of which we hope to sum. The multiples would have a cycle of differences of length $k$ and so we could compute the sum of $Nk$ multiples as above. - -The sequence of differences will always be a palidrome. Consider an interval spanning the least common multiple of $n$ and $m$: - - | | | | | | | | - | | | | | - -Here we have 4 and 7, and you can read off the sequence of differences directly from the diagram: 4 3 1 4 2 2 4 1 3 4. - -Geometrically, the actual values of $n$ and $m$ and their *lcm* don't matter, the pattern they make will always be symmetrical around its midpoint. The same reasoning holds for multiples of more than two numbers. - -# The Simplest Program - -Of course, the simplest joy program for the first Project Euler problem is just: - - PE1 == 233168 - -Fin. diff --git a/docs/3. Developing a Program.rst b/docs/3. Developing a Program.rst deleted file mode 100644 index 29da686..0000000 --- a/docs/3. Developing a Program.rst +++ /dev/null @@ -1,799 +0,0 @@ - -`Project Euler, first problem: "Multiples of 3 and 5" `__ -============================================================================================= - -:: - - If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. - - Find the sum of all the multiples of 3 or 5 below 1000. - -.. code:: ipython2 - - from notebook_preamble import J, V, define - -Let's create a predicate that returns ``True`` if a number is a multiple -of 3 or 5 and ``False`` otherwise. - -.. code:: ipython2 - - define('P == [3 % not] dupdip 5 % not or') - -.. code:: ipython2 - - V('80 P') - - -.. parsed-literal:: - - . 80 P - 80 . P - 80 . [3 % not] dupdip 5 % not or - 80 [3 % not] . dupdip 5 % not or - 80 . 3 % not 80 5 % not or - 80 3 . % not 80 5 % not or - 2 . not 80 5 % not or - False . 80 5 % not or - False 80 . 5 % not or - False 80 5 . % not or - False 0 . not or - False True . or - True . - - -Given the predicate function ``P`` a suitable program is: - -:: - - PE1 == 1000 range [P] filter sum - -This function generates a list of the integers from 0 to 999, filters -that list by ``P``, and then sums the result. - -Logically this is fine, but pragmatically we are doing more work than we -should be; we generate one thousand integers but actually use less than -half of them. A better solution would be to generate just the multiples -we want to sum, and to add them as we go rather than storing them and -adding summing them at the end. - -At first I had the idea to use two counters and increase them by three -and five, respectively. This way we only generate the terms that we -actually want to sum. We have to proceed by incrementing the counter -that is lower, or if they are equal, the three counter, and we have to -take care not to double add numbers like 15 that are multiples of both -three and five. - -This seemed a little clunky, so I tried a different approach. - -Consider the first few terms in the series: - -:: - - 3 5 6 9 10 12 15 18 20 21 ... - -Subtract each number from the one after it (subtracting 0 from 3): - -:: - - 3 5 6 9 10 12 15 18 20 21 24 25 27 30 ... - 0 3 5 6 9 10 12 15 18 20 21 24 25 27 ... - ------------------------------------------- - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 ... - -You get this lovely repeating palindromic sequence: - -:: - - 3 2 1 3 1 2 3 - -To make a counter that increments by factors of 3 and 5 you just add -these differences to the counter one-by-one in a loop. - -To make use of this sequence to increment a counter and sum terms as we -go we need a function that will accept the sum, the counter, and the -next term to add, and that adds the term to the counter and a copy of -the counter to the running sum. This function will do that: - -:: - - PE1.1 == + [+] dupdip - -.. code:: ipython2 - - define('PE1.1 == + [+] dupdip') - -.. code:: ipython2 - - V('0 0 3 PE1.1') - - -.. parsed-literal:: - - . 0 0 3 PE1.1 - 0 . 0 3 PE1.1 - 0 0 . 3 PE1.1 - 0 0 3 . PE1.1 - 0 0 3 . + [+] dupdip - 0 3 . [+] dupdip - 0 3 [+] . dupdip - 0 3 . + 3 - 3 . 3 - 3 3 . - - -.. code:: ipython2 - - V('0 0 [3 2 1 3 1 2 3] [PE1.1] step') - - -.. parsed-literal:: - - . 0 0 [3 2 1 3 1 2 3] [PE1.1] step - 0 . 0 [3 2 1 3 1 2 3] [PE1.1] step - 0 0 . [3 2 1 3 1 2 3] [PE1.1] step - 0 0 [3 2 1 3 1 2 3] . [PE1.1] step - 0 0 [3 2 1 3 1 2 3] [PE1.1] . step - 0 0 3 [PE1.1] . i [2 1 3 1 2 3] [PE1.1] step - 0 0 3 . PE1.1 [2 1 3 1 2 3] [PE1.1] step - 0 0 3 . + [+] dupdip [2 1 3 1 2 3] [PE1.1] step - 0 3 . [+] dupdip [2 1 3 1 2 3] [PE1.1] step - 0 3 [+] . dupdip [2 1 3 1 2 3] [PE1.1] step - 0 3 . + 3 [2 1 3 1 2 3] [PE1.1] step - 3 . 3 [2 1 3 1 2 3] [PE1.1] step - 3 3 . [2 1 3 1 2 3] [PE1.1] step - 3 3 [2 1 3 1 2 3] . [PE1.1] step - 3 3 [2 1 3 1 2 3] [PE1.1] . step - 3 3 2 [PE1.1] . i [1 3 1 2 3] [PE1.1] step - 3 3 2 . PE1.1 [1 3 1 2 3] [PE1.1] step - 3 3 2 . + [+] dupdip [1 3 1 2 3] [PE1.1] step - 3 5 . [+] dupdip [1 3 1 2 3] [PE1.1] step - 3 5 [+] . dupdip [1 3 1 2 3] [PE1.1] step - 3 5 . + 5 [1 3 1 2 3] [PE1.1] step - 8 . 5 [1 3 1 2 3] [PE1.1] step - 8 5 . [1 3 1 2 3] [PE1.1] step - 8 5 [1 3 1 2 3] . [PE1.1] step - 8 5 [1 3 1 2 3] [PE1.1] . step - 8 5 1 [PE1.1] . i [3 1 2 3] [PE1.1] step - 8 5 1 . PE1.1 [3 1 2 3] [PE1.1] step - 8 5 1 . + [+] dupdip [3 1 2 3] [PE1.1] step - 8 6 . [+] dupdip [3 1 2 3] [PE1.1] step - 8 6 [+] . dupdip [3 1 2 3] [PE1.1] step - 8 6 . + 6 [3 1 2 3] [PE1.1] step - 14 . 6 [3 1 2 3] [PE1.1] step - 14 6 . [3 1 2 3] [PE1.1] step - 14 6 [3 1 2 3] . [PE1.1] step - 14 6 [3 1 2 3] [PE1.1] . step - 14 6 3 [PE1.1] . i [1 2 3] [PE1.1] step - 14 6 3 . PE1.1 [1 2 3] [PE1.1] step - 14 6 3 . + [+] dupdip [1 2 3] [PE1.1] step - 14 9 . [+] dupdip [1 2 3] [PE1.1] step - 14 9 [+] . dupdip [1 2 3] [PE1.1] step - 14 9 . + 9 [1 2 3] [PE1.1] step - 23 . 9 [1 2 3] [PE1.1] step - 23 9 . [1 2 3] [PE1.1] step - 23 9 [1 2 3] . [PE1.1] step - 23 9 [1 2 3] [PE1.1] . step - 23 9 1 [PE1.1] . i [2 3] [PE1.1] step - 23 9 1 . PE1.1 [2 3] [PE1.1] step - 23 9 1 . + [+] dupdip [2 3] [PE1.1] step - 23 10 . [+] dupdip [2 3] [PE1.1] step - 23 10 [+] . dupdip [2 3] [PE1.1] step - 23 10 . + 10 [2 3] [PE1.1] step - 33 . 10 [2 3] [PE1.1] step - 33 10 . [2 3] [PE1.1] step - 33 10 [2 3] . [PE1.1] step - 33 10 [2 3] [PE1.1] . step - 33 10 2 [PE1.1] . i [3] [PE1.1] step - 33 10 2 . PE1.1 [3] [PE1.1] step - 33 10 2 . + [+] dupdip [3] [PE1.1] step - 33 12 . [+] dupdip [3] [PE1.1] step - 33 12 [+] . dupdip [3] [PE1.1] step - 33 12 . + 12 [3] [PE1.1] step - 45 . 12 [3] [PE1.1] step - 45 12 . [3] [PE1.1] step - 45 12 [3] . [PE1.1] step - 45 12 [3] [PE1.1] . step - 45 12 3 [PE1.1] . i - 45 12 3 . PE1.1 - 45 12 3 . + [+] dupdip - 45 15 . [+] dupdip - 45 15 [+] . dupdip - 45 15 . + 15 - 60 . 15 - 60 15 . - - -So one ``step`` through all seven terms brings the counter to 15 and the -total to 60. - -.. code:: ipython2 - - 1000 / 15 - - - - -.. parsed-literal:: - - 66 - - - -.. code:: ipython2 - - 66 * 15 - - - - -.. parsed-literal:: - - 990 - - - -.. code:: ipython2 - - 1000 - 990 - - - - -.. parsed-literal:: - - 10 - - - -We only want the terms *less than* 1000. - -.. code:: ipython2 - - 999 - 990 - - - - -.. parsed-literal:: - - 9 - - - -That means we want to run the full list of numbers sixty-six times to -get to 990 and then the first four numbers 3 2 1 3 to get to 999. - -.. code:: ipython2 - - define('PE1 == 0 0 66 [[3 2 1 3 1 2 3] [PE1.1] step] times [3 2 1 3] [PE1.1] step pop') - -.. code:: ipython2 - - J('PE1') - - -.. parsed-literal:: - - 233168 - - -This form uses no extra storage and produces no unused summands. It's -good but there's one more trick we can apply. The list of seven terms -takes up at least seven bytes. But notice that all of the terms are less -than four, and so each can fit in just two bits. We could store all -seven terms in just fourteen bits and use masking and shifts to pick out -each term as we go. This will use less space and save time loading whole -integer terms from the list. - -:: - - 3 2 1 3 1 2 3 - 0b 11 10 01 11 01 10 11 == 14811 - -.. code:: ipython2 - - 0b11100111011011 - - - - -.. parsed-literal:: - - 14811 - - - -.. code:: ipython2 - - define('PE1.2 == [3 & PE1.1] dupdip 2 >>') - -.. code:: ipython2 - - V('0 0 14811 PE1.2') - - -.. parsed-literal:: - - . 0 0 14811 PE1.2 - 0 . 0 14811 PE1.2 - 0 0 . 14811 PE1.2 - 0 0 14811 . PE1.2 - 0 0 14811 . [3 & PE1.1] dupdip 2 >> - 0 0 14811 [3 & PE1.1] . dupdip 2 >> - 0 0 14811 . 3 & PE1.1 14811 2 >> - 0 0 14811 3 . & PE1.1 14811 2 >> - 0 0 3 . PE1.1 14811 2 >> - 0 0 3 . + [+] dupdip 14811 2 >> - 0 3 . [+] dupdip 14811 2 >> - 0 3 [+] . dupdip 14811 2 >> - 0 3 . + 3 14811 2 >> - 3 . 3 14811 2 >> - 3 3 . 14811 2 >> - 3 3 14811 . 2 >> - 3 3 14811 2 . >> - 3 3 3702 . - - -.. code:: ipython2 - - V('3 3 3702 PE1.2') - - -.. parsed-literal:: - - . 3 3 3702 PE1.2 - 3 . 3 3702 PE1.2 - 3 3 . 3702 PE1.2 - 3 3 3702 . PE1.2 - 3 3 3702 . [3 & PE1.1] dupdip 2 >> - 3 3 3702 [3 & PE1.1] . dupdip 2 >> - 3 3 3702 . 3 & PE1.1 3702 2 >> - 3 3 3702 3 . & PE1.1 3702 2 >> - 3 3 2 . PE1.1 3702 2 >> - 3 3 2 . + [+] dupdip 3702 2 >> - 3 5 . [+] dupdip 3702 2 >> - 3 5 [+] . dupdip 3702 2 >> - 3 5 . + 5 3702 2 >> - 8 . 5 3702 2 >> - 8 5 . 3702 2 >> - 8 5 3702 . 2 >> - 8 5 3702 2 . >> - 8 5 925 . - - -.. code:: ipython2 - - V('0 0 14811 7 [PE1.2] times pop') - - -.. parsed-literal:: - - . 0 0 14811 7 [PE1.2] times pop - 0 . 0 14811 7 [PE1.2] times pop - 0 0 . 14811 7 [PE1.2] times pop - 0 0 14811 . 7 [PE1.2] times pop - 0 0 14811 7 . [PE1.2] times pop - 0 0 14811 7 [PE1.2] . times pop - 0 0 14811 [PE1.2] . i 6 [PE1.2] times pop - 0 0 14811 . PE1.2 6 [PE1.2] times pop - 0 0 14811 . [3 & PE1.1] dupdip 2 >> 6 [PE1.2] times pop - 0 0 14811 [3 & PE1.1] . dupdip 2 >> 6 [PE1.2] times pop - 0 0 14811 . 3 & PE1.1 14811 2 >> 6 [PE1.2] times pop - 0 0 14811 3 . & PE1.1 14811 2 >> 6 [PE1.2] times pop - 0 0 3 . PE1.1 14811 2 >> 6 [PE1.2] times pop - 0 0 3 . + [+] dupdip 14811 2 >> 6 [PE1.2] times pop - 0 3 . [+] dupdip 14811 2 >> 6 [PE1.2] times pop - 0 3 [+] . dupdip 14811 2 >> 6 [PE1.2] times pop - 0 3 . + 3 14811 2 >> 6 [PE1.2] times pop - 3 . 3 14811 2 >> 6 [PE1.2] times pop - 3 3 . 14811 2 >> 6 [PE1.2] times pop - 3 3 14811 . 2 >> 6 [PE1.2] times pop - 3 3 14811 2 . >> 6 [PE1.2] times pop - 3 3 3702 . 6 [PE1.2] times pop - 3 3 3702 6 . [PE1.2] times pop - 3 3 3702 6 [PE1.2] . times pop - 3 3 3702 [PE1.2] . i 5 [PE1.2] times pop - 3 3 3702 . PE1.2 5 [PE1.2] times pop - 3 3 3702 . [3 & PE1.1] dupdip 2 >> 5 [PE1.2] times pop - 3 3 3702 [3 & PE1.1] . dupdip 2 >> 5 [PE1.2] times pop - 3 3 3702 . 3 & PE1.1 3702 2 >> 5 [PE1.2] times pop - 3 3 3702 3 . & PE1.1 3702 2 >> 5 [PE1.2] times pop - 3 3 2 . PE1.1 3702 2 >> 5 [PE1.2] times pop - 3 3 2 . + [+] dupdip 3702 2 >> 5 [PE1.2] times pop - 3 5 . [+] dupdip 3702 2 >> 5 [PE1.2] times pop - 3 5 [+] . dupdip 3702 2 >> 5 [PE1.2] times pop - 3 5 . + 5 3702 2 >> 5 [PE1.2] times pop - 8 . 5 3702 2 >> 5 [PE1.2] times pop - 8 5 . 3702 2 >> 5 [PE1.2] times pop - 8 5 3702 . 2 >> 5 [PE1.2] times pop - 8 5 3702 2 . >> 5 [PE1.2] times pop - 8 5 925 . 5 [PE1.2] times pop - 8 5 925 5 . [PE1.2] times pop - 8 5 925 5 [PE1.2] . times pop - 8 5 925 [PE1.2] . i 4 [PE1.2] times pop - 8 5 925 . PE1.2 4 [PE1.2] times pop - 8 5 925 . [3 & PE1.1] dupdip 2 >> 4 [PE1.2] times pop - 8 5 925 [3 & PE1.1] . dupdip 2 >> 4 [PE1.2] times pop - 8 5 925 . 3 & PE1.1 925 2 >> 4 [PE1.2] times pop - 8 5 925 3 . & PE1.1 925 2 >> 4 [PE1.2] times pop - 8 5 1 . PE1.1 925 2 >> 4 [PE1.2] times pop - 8 5 1 . + [+] dupdip 925 2 >> 4 [PE1.2] times pop - 8 6 . [+] dupdip 925 2 >> 4 [PE1.2] times pop - 8 6 [+] . dupdip 925 2 >> 4 [PE1.2] times pop - 8 6 . + 6 925 2 >> 4 [PE1.2] times pop - 14 . 6 925 2 >> 4 [PE1.2] times pop - 14 6 . 925 2 >> 4 [PE1.2] times pop - 14 6 925 . 2 >> 4 [PE1.2] times pop - 14 6 925 2 . >> 4 [PE1.2] times pop - 14 6 231 . 4 [PE1.2] times pop - 14 6 231 4 . [PE1.2] times pop - 14 6 231 4 [PE1.2] . times pop - 14 6 231 [PE1.2] . i 3 [PE1.2] times pop - 14 6 231 . PE1.2 3 [PE1.2] times pop - 14 6 231 . [3 & PE1.1] dupdip 2 >> 3 [PE1.2] times pop - 14 6 231 [3 & PE1.1] . dupdip 2 >> 3 [PE1.2] times pop - 14 6 231 . 3 & PE1.1 231 2 >> 3 [PE1.2] times pop - 14 6 231 3 . & PE1.1 231 2 >> 3 [PE1.2] times pop - 14 6 3 . PE1.1 231 2 >> 3 [PE1.2] times pop - 14 6 3 . + [+] dupdip 231 2 >> 3 [PE1.2] times pop - 14 9 . [+] dupdip 231 2 >> 3 [PE1.2] times pop - 14 9 [+] . dupdip 231 2 >> 3 [PE1.2] times pop - 14 9 . + 9 231 2 >> 3 [PE1.2] times pop - 23 . 9 231 2 >> 3 [PE1.2] times pop - 23 9 . 231 2 >> 3 [PE1.2] times pop - 23 9 231 . 2 >> 3 [PE1.2] times pop - 23 9 231 2 . >> 3 [PE1.2] times pop - 23 9 57 . 3 [PE1.2] times pop - 23 9 57 3 . [PE1.2] times pop - 23 9 57 3 [PE1.2] . times pop - 23 9 57 [PE1.2] . i 2 [PE1.2] times pop - 23 9 57 . PE1.2 2 [PE1.2] times pop - 23 9 57 . [3 & PE1.1] dupdip 2 >> 2 [PE1.2] times pop - 23 9 57 [3 & PE1.1] . dupdip 2 >> 2 [PE1.2] times pop - 23 9 57 . 3 & PE1.1 57 2 >> 2 [PE1.2] times pop - 23 9 57 3 . & PE1.1 57 2 >> 2 [PE1.2] times pop - 23 9 1 . PE1.1 57 2 >> 2 [PE1.2] times pop - 23 9 1 . + [+] dupdip 57 2 >> 2 [PE1.2] times pop - 23 10 . [+] dupdip 57 2 >> 2 [PE1.2] times pop - 23 10 [+] . dupdip 57 2 >> 2 [PE1.2] times pop - 23 10 . + 10 57 2 >> 2 [PE1.2] times pop - 33 . 10 57 2 >> 2 [PE1.2] times pop - 33 10 . 57 2 >> 2 [PE1.2] times pop - 33 10 57 . 2 >> 2 [PE1.2] times pop - 33 10 57 2 . >> 2 [PE1.2] times pop - 33 10 14 . 2 [PE1.2] times pop - 33 10 14 2 . [PE1.2] times pop - 33 10 14 2 [PE1.2] . times pop - 33 10 14 [PE1.2] . i 1 [PE1.2] times pop - 33 10 14 . PE1.2 1 [PE1.2] times pop - 33 10 14 . [3 & PE1.1] dupdip 2 >> 1 [PE1.2] times pop - 33 10 14 [3 & PE1.1] . dupdip 2 >> 1 [PE1.2] times pop - 33 10 14 . 3 & PE1.1 14 2 >> 1 [PE1.2] times pop - 33 10 14 3 . & PE1.1 14 2 >> 1 [PE1.2] times pop - 33 10 2 . PE1.1 14 2 >> 1 [PE1.2] times pop - 33 10 2 . + [+] dupdip 14 2 >> 1 [PE1.2] times pop - 33 12 . [+] dupdip 14 2 >> 1 [PE1.2] times pop - 33 12 [+] . dupdip 14 2 >> 1 [PE1.2] times pop - 33 12 . + 12 14 2 >> 1 [PE1.2] times pop - 45 . 12 14 2 >> 1 [PE1.2] times pop - 45 12 . 14 2 >> 1 [PE1.2] times pop - 45 12 14 . 2 >> 1 [PE1.2] times pop - 45 12 14 2 . >> 1 [PE1.2] times pop - 45 12 3 . 1 [PE1.2] times pop - 45 12 3 1 . [PE1.2] times pop - 45 12 3 1 [PE1.2] . times pop - 45 12 3 [PE1.2] . i pop - 45 12 3 . PE1.2 pop - 45 12 3 . [3 & PE1.1] dupdip 2 >> pop - 45 12 3 [3 & PE1.1] . dupdip 2 >> pop - 45 12 3 . 3 & PE1.1 3 2 >> pop - 45 12 3 3 . & PE1.1 3 2 >> pop - 45 12 3 . PE1.1 3 2 >> pop - 45 12 3 . + [+] dupdip 3 2 >> pop - 45 15 . [+] dupdip 3 2 >> pop - 45 15 [+] . dupdip 3 2 >> pop - 45 15 . + 15 3 2 >> pop - 60 . 15 3 2 >> pop - 60 15 . 3 2 >> pop - 60 15 3 . 2 >> pop - 60 15 3 2 . >> pop - 60 15 0 . pop - 60 15 . - - -And so we have at last: - -.. code:: ipython2 - - define('PE1 == 0 0 66 [14811 7 [PE1.2] times pop] times 14811 4 [PE1.2] times popop') - -.. code:: ipython2 - - J('PE1') - - -.. parsed-literal:: - - 233168 - - -Let's refactor. - -:: - - 14811 7 [PE1.2] times pop - 14811 4 [PE1.2] times pop - 14811 n [PE1.2] times pop - n 14811 swap [PE1.2] times pop - -.. code:: ipython2 - - define('PE1.3 == 14811 swap [PE1.2] times pop') - -Now we can simplify the definition above: - -.. code:: ipython2 - - define('PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop') - -.. code:: ipython2 - - J('PE1') - - -.. parsed-literal:: - - 233168 - - -Here's our joy program all in one place. It doesn't make so much sense, -but if you have read through the above description of how it was derived -I hope it's clear. - -:: - - PE1.1 == + [+] dupdip - PE1.2 == [3 & PE1.1] dupdip 2 >> - PE1.3 == 14811 swap [PE1.2] times pop - PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop - -Generator Version -================= - -It's a little clunky iterating sixty-six times though the seven numbers -then four more. In the *Generator Programs* notebook we derive a -generator that can be repeatedly driven by the ``x`` combinator to -produce a stream of the seven numbers repeating over and over again. - -.. code:: ipython2 - - define('PE1.terms == [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons]') - -.. code:: ipython2 - - J('PE1.terms 21 [x] times') - - -.. parsed-literal:: - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [dup [pop 14811] [] branch [3 &] dupdip 2 >>] dip rest cons] - - -We know from above that we need sixty-six times seven then four more -terms to reach up to but not over one thousand. - -.. code:: ipython2 - - J('7 66 * 4 +') - - -.. parsed-literal:: - - 466 - - -Here they are... -~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('PE1.terms 466 [x] times pop') - - -.. parsed-literal:: - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 - - -...and they do sum to 999. -~~~~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - J('[PE1.terms 466 [x] times pop] run sum') - - -.. parsed-literal:: - - 999 - - -Now we can use ``PE1.1`` to accumulate the terms as we go, and then -``pop`` the generator and the counter from the stack when we're done, -leaving just the sum. - -.. code:: ipython2 - - J('0 0 PE1.terms 466 [x [PE1.1] dip] times popop') - - -.. parsed-literal:: - - 233168 - - -A little further analysis renders iteration unnecessary. -======================================================== - -Consider finding the sum of the positive integers less than or equal to -ten. - -.. code:: ipython2 - - J('[10 9 8 7 6 5 4 3 2 1] sum') - - -.. parsed-literal:: - - 55 - - -Instead of summing them, -`observe `__: - -:: - - 10 9 8 7 6 - + 1 2 3 4 5 - ---- -- -- -- -- - 11 11 11 11 11 - - 11 * 5 = 55 - -From the above example we can deduce that the sum of the first N -positive integers is: - -:: - - (N + 1) * N / 2 - -(The formula also works for odd values of N, I'll leave that to you if -you want to work it out or you can take my word for it.) - -.. code:: ipython2 - - define('F == dup ++ * 2 floordiv') - -.. code:: ipython2 - - V('10 F') - - -.. parsed-literal:: - - . 10 F - 10 . F - 10 . dup ++ * 2 floordiv - 10 10 . ++ * 2 floordiv - 10 11 . * 2 floordiv - 110 . 2 floordiv - 110 2 . floordiv - 55 . - - -Generalizing to Blocks of Terms -------------------------------- - -We can apply the same reasoning to the PE1 problem. - -Between 0 and 990 inclusive there are sixty-six "blocks" of seven terms -each, starting with: - -:: - - [3 5 6 9 10 12 15] - -And ending with: - -:: - - [978 980 981 984 985 987 990] - -If we reverse one of these two blocks and sum pairs... - -.. code:: ipython2 - - J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip') - - -.. parsed-literal:: - - [[978 15] [980 12] [981 10] [984 9] [985 6] [987 5] [990 3]] - - -.. code:: ipython2 - - J('[3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map') - - -.. parsed-literal:: - - [993 992 991 993 991 992 993] - - -(Interesting that the sequence of seven numbers appears again in the -rightmost digit of each term.) - -.. code:: ipython2 - - J('[ 3 5 6 9 10 12 15] reverse [978 980 981 984 985 987 990] zip [sum] map sum') - - -.. parsed-literal:: - - 6945 - - -Since there are sixty-six blocks and we are pairing them up, there must -be thirty-three pairs, each of which sums to 6945. We also have these -additional unpaired terms between 990 and 1000: - -:: - - 993 995 996 999 - -So we can give the "sum of all the multiples of 3 or 5 below 1000" like -so: - -.. code:: ipython2 - - J('6945 33 * [993 995 996 999] cons sum') - - -.. parsed-literal:: - - 233168 - - -It's worth noting, I think, that this same reasoning holds for any two -numbers :math:`n` and :math:`m` the multiples of which we hope to sum. -The multiples would have a cycle of differences of length :math:`k` and -so we could compute the sum of :math:`Nk` multiples as above. - -The sequence of differences will always be a palidrome. Consider an -interval spanning the least common multiple of :math:`n` and :math:`m`: - -:: - - | | | | | | | | - | | | | | - -Here we have 4 and 7, and you can read off the sequence of differences -directly from the diagram: 4 3 1 4 2 2 4 1 3 4. - -Geometrically, the actual values of :math:`n` and :math:`m` and their -*lcm* don't matter, the pattern they make will always be symmetrical -around its midpoint. The same reasoning holds for multiples of more than -two numbers. - -The Simplest Program -==================== - -Of course, the simplest joy program for the first Project Euler problem -is just: - -:: - - PE1 == 233168 - -Fin. diff --git a/docs/Advent of Code 2017 December 1st.html b/docs/Advent of Code 2017 December 1st.html deleted file mode 100644 index b085073..0000000 --- a/docs/Advent of Code 2017 December 1st.html +++ /dev/null @@ -1,12432 +0,0 @@ - - - -Advent of Code 2017 December 1st - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Advent of Code 2017

December 1st

[Given] a sequence of digits (your puzzle input) and find the sum of all digits that match the next digit in the list. The list is circular, so the digit after the last digit is the first digit in the list.

-

For example:

-
    -
  • 1122 produces a sum of 3 (1 + 2) because the first digit (1) matches the second digit and the third digit (2) matches the fourth digit.
    • -
  • 1111 produces 4 because each digit (all 1) matches the next.
    • -
  • 1234 produces 0 because no digit matches the next.
    • -
  • 91212129 produces 9 because the only digit that matches the next one is the last digit, 9.
    • -
- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import J, V, define
-
- -
-
-
- -
-
-
-
-
-

I'll assume the input is a Joy sequence of integers (as opposed to a string or something else.)

-

We might proceed by creating a word that makes a copy of the sequence with the first item moved to the last, and zips it with the original to make a list of pairs, and a another word that adds (one of) each pair to a total if the pair matches.

- -
AoC2017.1 == pair_up total_matches
-
-
-

Let's derive pair_up:

- -
     [a b c] pair_up
--------------------------
-   [[a b] [b c] [c a]]
- -
-
-
-
-
-
-
-

Straightforward (although the order of each pair is reversed, due to the way zip works, but it doesn't matter for this program):

- -
[a b c] dup
-[a b c] [a b c] uncons swap
-[a b c] [b c] a unit concat
-[a b c] [b c a] zip
-[[b a] [c b] [a c]]
- -
-
-
-
-
-
In [2]:
-
-
-
define('pair_up == dup uncons swap unit concat zip')
-
- -
-
-
- -
-
-
-
In [3]:
-
-
-
J('[1 2 3] pair_up')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[[2 1] [3 2] [1 3]]
-
-
-
- -
-
- -
-
-
-
In [4]:
-
-
-
J('[1 2 2 3] pair_up')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[[2 1] [2 2] [3 2] [1 3]]
-
-
-
- -
-
- -
-
-
-
-
-

Now we need to derive total_matches. It will be a step function:

- -
total_matches == 0 swap [F] step
-
-
-

Where F will have the pair to work with, and it will basically be a branch or ifte.

- -
total [n m] F
-
-
-

It will probably be easier to write if we dequote the pair:

- -
   total [n m] i F′
-----------------------
-     total n m F′
-
-
-

Now F′ becomes just:

- -
total n m [=] [pop +] [popop] ifte
-
-
-

So:

- -
F == i [=] [pop +] [popop] ifte
-
-
-

And thus:

- -
total_matches == 0 swap [i [=] [pop +] [popop] ifte] step
- -
-
-
-
-
-
In [5]:
-
-
-
define('total_matches == 0 swap [i [=] [pop +] [popop] ifte] step')
-
- -
-
-
- -
-
-
-
In [6]:
-
-
-
J('[1 2 3] pair_up total_matches')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0
-
-
-
- -
-
- -
-
-
-
In [7]:
-
-
-
J('[1 2 2 3] pair_up total_matches')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
-
-

Now we can define our main program and evaluate it on the examples.

- -
-
-
-
-
-
In [8]:
-
-
-
define('AoC2017.1 == pair_up total_matches')
-
- -
-
-
- -
-
-
-
In [9]:
-
-
-
J('[1 1 2 2] AoC2017.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3
-
-
-
- -
-
- -
-
-
-
In [10]:
-
-
-
J('[1 1 1 1] AoC2017.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4
-
-
-
- -
-
- -
-
-
-
In [11]:
-
-
-
J('[1 2 3 4] AoC2017.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0
-
-
-
- -
-
- -
-
-
-
In [12]:
-
-
-
J('[9 1 2 1 2 1 2 9] AoC2017.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
9
-
-
-
- -
-
- -
-
-
-
In [13]:
-
-
-
J('[9 1 2 1 2 1 2 9] AoC2017.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
9
-
-
-
- -
-
- -
-
-
-
-
- -
      pair_up == dup uncons swap unit concat zip
-total_matches == 0 swap [i [=] [pop +] [popop] ifte] step
-
-    AoC2017.1 == pair_up total_matches
- -
-
-
-
-
-
-
-

Now the paired digit is "halfway" round.

- -
[a b c d] dup size 2 / [drop] [take reverse] cleave concat zip
- -
-
-
-
-
-
In [14]:
-
-
-
J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave concat zip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[[3 1] [4 2] [1 3] [2 4]]
-
-
-
- -
-
- -
-
-
-
-
-

I realized that each pair is repeated...

- -
-
-
-
-
-
In [15]:
-
-
-
J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave  zip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 2 3 4] [[1 3] [2 4]]
-
-
-
- -
-
- -
-
-
-
In [16]:
-
-
-
define('AoC2017.1.extra == dup size 2 / [drop] [take reverse] cleave  zip swap pop total_matches 2 *')
-
- -
-
-
- -
-
-
-
In [17]:
-
-
-
J('[1 2 1 2] AoC2017.1.extra')
-
- -
-
-
- -
-
- - -
- -
- - -
-
6
-
-
-
- -
-
- -
-
-
-
In [18]:
-
-
-
J('[1 2 2 1] AoC2017.1.extra')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0
-
-
-
- -
-
- -
-
-
-
In [19]:
-
-
-
J('[1 2 3 4 2 5] AoC2017.1.extra')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4
-
-
-
- -
-
- -
-
-
-
-
-

Refactor FTW

With Joy a great deal of the heuristics from Forth programming carry over nicely. For example, refactoring into small, well-scoped commands with mnemonic names...

- -
         rotate_seq == uncons swap unit concat
-            pair_up == dup rotate_seq zip
-       add_if_match == [=] [pop +] [popop] ifte
-      total_matches == [i add_if_match] step_zero
-
-          AoC2017.1 == pair_up total_matches
-
-       half_of_size == dup size 2 /
-           split_at == [drop] [take reverse] cleave
-      pair_up.extra == half_of_size split_at zip swap pop
-
-    AoC2017.1.extra == pair_up.extra total_matches 2 *
- -
-
-
-
-
- - - - - - diff --git a/docs/Advent of Code 2017 December 1st.ipynb b/docs/Advent of Code 2017 December 1st.ipynb deleted file mode 100644 index c83a62d..0000000 --- a/docs/Advent of Code 2017 December 1st.ipynb +++ /dev/null @@ -1,455 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Advent of Code 2017\n", - "\n", - "## December 1st\n", - "\n", - "\\[Given\\] a sequence of digits (your puzzle input) and find the sum of all digits that match the next digit in the list. The list is circular, so the digit after the last digit is the first digit in the list.\n", - "\n", - "For example:\n", - "\n", - "* 1122 produces a sum of 3 (1 + 2) because the first digit (1) matches the second digit and the third digit (2) matches the fourth digit.\n", - "* 1111 produces 4 because each digit (all 1) matches the next.\n", - "* 1234 produces 0 because no digit matches the next.\n", - "* 91212129 produces 9 because the only digit that matches the next one is the last digit, 9." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "I'll assume the input is a Joy sequence of integers (as opposed to a string or something else.)\n", - "\n", - "We might proceed by creating a word that makes a copy of the sequence with the first item moved to the last, and zips it with the original to make a list of pairs, and a another word that adds (one of) each pair to a total if the pair matches.\n", - "\n", - " AoC2017.1 == pair_up total_matches\n", - "\n", - "Let's derive `pair_up`:\n", - "\n", - " [a b c] pair_up\n", - " -------------------------\n", - " [[a b] [b c] [c a]]\n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Straightforward (although the order of each pair is reversed, due to the way `zip` works, but it doesn't matter for this program):\n", - "\n", - " [a b c] dup\n", - " [a b c] [a b c] uncons swap\n", - " [a b c] [b c] a unit concat\n", - " [a b c] [b c a] zip\n", - " [[b a] [c b] [a c]]" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [], - "source": [ - "define('pair_up == dup uncons swap unit concat zip')" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[[2 1] [3 2] [1 3]]\n" - ] - } - ], - "source": [ - "J('[1 2 3] pair_up')" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[[2 1] [2 2] [3 2] [1 3]]\n" - ] - } - ], - "source": [ - "J('[1 2 2 3] pair_up')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we need to derive `total_matches`. It will be a `step` function:\n", - "\n", - " total_matches == 0 swap [F] step\n", - "\n", - "Where `F` will have the pair to work with, and it will basically be a `branch` or `ifte`.\n", - "\n", - " total [n m] F\n", - "\n", - "It will probably be easier to write if we dequote the pair:\n", - "\n", - " total [n m] i F′\n", - " ----------------------\n", - " total n m F′\n", - "\n", - "Now `F′` becomes just:\n", - "\n", - " total n m [=] [pop +] [popop] ifte\n", - "\n", - "So:\n", - "\n", - " F == i [=] [pop +] [popop] ifte\n", - "\n", - "And thus:\n", - "\n", - " total_matches == 0 swap [i [=] [pop +] [popop] ifte] step" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [], - "source": [ - "define('total_matches == 0 swap [i [=] [pop +] [popop] ifte] step')" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0\n" - ] - } - ], - "source": [ - "J('[1 2 3] pair_up total_matches')" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('[1 2 2 3] pair_up total_matches')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we can define our main program and evaluate it on the examples." - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [], - "source": [ - "define('AoC2017.1 == pair_up total_matches')" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3\n" - ] - } - ], - "source": [ - "J('[1 1 2 2] AoC2017.1')" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4\n" - ] - } - ], - "source": [ - "J('[1 1 1 1] AoC2017.1')" - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] AoC2017.1')" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9\n" - ] - } - ], - "source": [ - "J('[9 1 2 1 2 1 2 9] AoC2017.1')" - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9\n" - ] - } - ], - "source": [ - "J('[9 1 2 1 2 1 2 9] AoC2017.1')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " pair_up == dup uncons swap unit concat zip\n", - " total_matches == 0 swap [i [=] [pop +] [popop] ifte] step\n", - "\n", - " AoC2017.1 == pair_up total_matches" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now the paired digit is \"halfway\" round.\n", - "\n", - " [a b c d] dup size 2 / [drop] [take reverse] cleave concat zip" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[[3 1] [4 2] [1 3] [2 4]]\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave concat zip')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "I realized that each pair is repeated..." - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 2 3 4] [[1 3] [2 4]]\n" - ] - } - ], - "source": [ - "J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave zip')" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [], - "source": [ - "define('AoC2017.1.extra == dup size 2 / [drop] [take reverse] cleave zip swap pop total_matches 2 *')" - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6\n" - ] - } - ], - "source": [ - "J('[1 2 1 2] AoC2017.1.extra')" - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0\n" - ] - } - ], - "source": [ - "J('[1 2 2 1] AoC2017.1.extra')" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4\n" - ] - } - ], - "source": [ - "J('[1 2 3 4 2 5] AoC2017.1.extra')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Refactor FTW\n", - "\n", - "With Joy a great deal of the heuristics from Forth programming carry over nicely. For example, refactoring into small, well-scoped commands with mnemonic names...\n", - "\n", - " rotate_seq == uncons swap unit concat\n", - " pair_up == dup rotate_seq zip\n", - " add_if_match == [=] [pop +] [popop] ifte\n", - " total_matches == [i add_if_match] step_zero\n", - "\n", - " AoC2017.1 == pair_up total_matches\n", - "\n", - " half_of_size == dup size 2 /\n", - " split_at == [drop] [take reverse] cleave\n", - " pair_up.extra == half_of_size split_at zip swap pop\n", - "\n", - " AoC2017.1.extra == pair_up.extra total_matches 2 *\n" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Advent of Code 2017 December 1st.md b/docs/Advent of Code 2017 December 1st.md deleted file mode 100644 index c08b171..0000000 --- a/docs/Advent of Code 2017 December 1st.md +++ /dev/null @@ -1,228 +0,0 @@ - -# Advent of Code 2017 - -## December 1st - -\[Given\] a sequence of digits (your puzzle input) and find the sum of all digits that match the next digit in the list. The list is circular, so the digit after the last digit is the first digit in the list. - -For example: - -* 1122 produces a sum of 3 (1 + 2) because the first digit (1) matches the second digit and the third digit (2) matches the fourth digit. -* 1111 produces 4 because each digit (all 1) matches the next. -* 1234 produces 0 because no digit matches the next. -* 91212129 produces 9 because the only digit that matches the next one is the last digit, 9. - - -```python -from notebook_preamble import J, V, define -``` - -I'll assume the input is a Joy sequence of integers (as opposed to a string or something else.) - -We might proceed by creating a word that makes a copy of the sequence with the first item moved to the last, and zips it with the original to make a list of pairs, and a another word that adds (one of) each pair to a total if the pair matches. - - AoC2017.1 == pair_up total_matches - -Let's derive `pair_up`: - - [a b c] pair_up - ------------------------- - [[a b] [b c] [c a]] - - -Straightforward (although the order of each pair is reversed, due to the way `zip` works, but it doesn't matter for this program): - - [a b c] dup - [a b c] [a b c] uncons swap - [a b c] [b c] a unit concat - [a b c] [b c a] zip - [[b a] [c b] [a c]] - - -```python -define('pair_up == dup uncons swap unit concat zip') -``` - - -```python -J('[1 2 3] pair_up') -``` - - [[2 1] [3 2] [1 3]] - - - -```python -J('[1 2 2 3] pair_up') -``` - - [[2 1] [2 2] [3 2] [1 3]] - - -Now we need to derive `total_matches`. It will be a `step` function: - - total_matches == 0 swap [F] step - -Where `F` will have the pair to work with, and it will basically be a `branch` or `ifte`. - - total [n m] F - -It will probably be easier to write if we dequote the pair: - - total [n m] i F′ - ---------------------- - total n m F′ - -Now `F′` becomes just: - - total n m [=] [pop +] [popop] ifte - -So: - - F == i [=] [pop +] [popop] ifte - -And thus: - - total_matches == 0 swap [i [=] [pop +] [popop] ifte] step - - -```python -define('total_matches == 0 swap [i [=] [pop +] [popop] ifte] step') -``` - - -```python -J('[1 2 3] pair_up total_matches') -``` - - 0 - - - -```python -J('[1 2 2 3] pair_up total_matches') -``` - - 2 - - -Now we can define our main program and evaluate it on the examples. - - -```python -define('AoC2017.1 == pair_up total_matches') -``` - - -```python -J('[1 1 2 2] AoC2017.1') -``` - - 3 - - - -```python -J('[1 1 1 1] AoC2017.1') -``` - - 4 - - - -```python -J('[1 2 3 4] AoC2017.1') -``` - - 0 - - - -```python -J('[9 1 2 1 2 1 2 9] AoC2017.1') -``` - - 9 - - - -```python -J('[9 1 2 1 2 1 2 9] AoC2017.1') -``` - - 9 - - - pair_up == dup uncons swap unit concat zip - total_matches == 0 swap [i [=] [pop +] [popop] ifte] step - - AoC2017.1 == pair_up total_matches - -Now the paired digit is "halfway" round. - - [a b c d] dup size 2 / [drop] [take reverse] cleave concat zip - - -```python -J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave concat zip') -``` - - [[3 1] [4 2] [1 3] [2 4]] - - -I realized that each pair is repeated... - - -```python -J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave zip') -``` - - [1 2 3 4] [[1 3] [2 4]] - - - -```python -define('AoC2017.1.extra == dup size 2 / [drop] [take reverse] cleave zip swap pop total_matches 2 *') -``` - - -```python -J('[1 2 1 2] AoC2017.1.extra') -``` - - 6 - - - -```python -J('[1 2 2 1] AoC2017.1.extra') -``` - - 0 - - - -```python -J('[1 2 3 4 2 5] AoC2017.1.extra') -``` - - 4 - - -# Refactor FTW - -With Joy a great deal of the heuristics from Forth programming carry over nicely. For example, refactoring into small, well-scoped commands with mnemonic names... - - rotate_seq == uncons swap unit concat - pair_up == dup rotate_seq zip - add_if_match == [=] [pop +] [popop] ifte - total_matches == [i add_if_match] step_zero - - AoC2017.1 == pair_up total_matches - - half_of_size == dup size 2 / - split_at == [drop] [take reverse] cleave - pair_up.extra == half_of_size split_at zip swap pop - - AoC2017.1.extra == pair_up.extra total_matches 2 * - diff --git a/docs/Advent of Code 2017 December 1st.rst b/docs/Advent of Code 2017 December 1st.rst deleted file mode 100644 index d5bb543..0000000 --- a/docs/Advent of Code 2017 December 1st.rst +++ /dev/null @@ -1,288 +0,0 @@ - -Advent of Code 2017 -=================== - -December 1st ------------- - -[Given] a sequence of digits (your puzzle input) and find the sum of all -digits that match the next digit in the list. The list is circular, so -the digit after the last digit is the first digit in the list. - -For example: - -- 1122 produces a sum of 3 (1 + 2) because the first digit (1) matches - the second digit and the third digit (2) matches the fourth digit. -- 1111 produces 4 because each digit (all 1) matches the next. -- 1234 produces 0 because no digit matches the next. -- 91212129 produces 9 because the only digit that matches the next one - is the last digit, 9. - -.. code:: ipython2 - - from notebook_preamble import J, V, define - -I'll assume the input is a Joy sequence of integers (as opposed to a -string or something else.) - -We might proceed by creating a word that makes a copy of the sequence -with the first item moved to the last, and zips it with the original to -make a list of pairs, and a another word that adds (one of) each pair to -a total if the pair matches. - -:: - - AoC2017.1 == pair_up total_matches - -Let's derive ``pair_up``: - -:: - - [a b c] pair_up - ------------------------- - [[a b] [b c] [c a]] - -Straightforward (although the order of each pair is reversed, due to the -way ``zip`` works, but it doesn't matter for this program): - -:: - - [a b c] dup - [a b c] [a b c] uncons swap - [a b c] [b c] a unit concat - [a b c] [b c a] zip - [[b a] [c b] [a c]] - -.. code:: ipython2 - - define('pair_up == dup uncons swap unit concat zip') - -.. code:: ipython2 - - J('[1 2 3] pair_up') - - -.. parsed-literal:: - - [[2 1] [3 2] [1 3]] - - -.. code:: ipython2 - - J('[1 2 2 3] pair_up') - - -.. parsed-literal:: - - [[2 1] [2 2] [3 2] [1 3]] - - -Now we need to derive ``total_matches``. It will be a ``step`` function: - -:: - - total_matches == 0 swap [F] step - -Where ``F`` will have the pair to work with, and it will basically be a -``branch`` or ``ifte``. - -:: - - total [n m] F - -It will probably be easier to write if we dequote the pair: - -:: - - total [n m] i F′ - ---------------------- - total n m F′ - -Now ``F′`` becomes just: - -:: - - total n m [=] [pop +] [popop] ifte - -So: - -:: - - F == i [=] [pop +] [popop] ifte - -And thus: - -:: - - total_matches == 0 swap [i [=] [pop +] [popop] ifte] step - -.. code:: ipython2 - - define('total_matches == 0 swap [i [=] [pop +] [popop] ifte] step') - -.. code:: ipython2 - - J('[1 2 3] pair_up total_matches') - - -.. parsed-literal:: - - 0 - - -.. code:: ipython2 - - J('[1 2 2 3] pair_up total_matches') - - -.. parsed-literal:: - - 2 - - -Now we can define our main program and evaluate it on the examples. - -.. code:: ipython2 - - define('AoC2017.1 == pair_up total_matches') - -.. code:: ipython2 - - J('[1 1 2 2] AoC2017.1') - - -.. parsed-literal:: - - 3 - - -.. code:: ipython2 - - J('[1 1 1 1] AoC2017.1') - - -.. parsed-literal:: - - 4 - - -.. code:: ipython2 - - J('[1 2 3 4] AoC2017.1') - - -.. parsed-literal:: - - 0 - - -.. code:: ipython2 - - J('[9 1 2 1 2 1 2 9] AoC2017.1') - - -.. parsed-literal:: - - 9 - - -.. code:: ipython2 - - J('[9 1 2 1 2 1 2 9] AoC2017.1') - - -.. parsed-literal:: - - 9 - - -:: - - pair_up == dup uncons swap unit concat zip - total_matches == 0 swap [i [=] [pop +] [popop] ifte] step - - AoC2017.1 == pair_up total_matches - -Now the paired digit is "halfway" round. - -:: - - [a b c d] dup size 2 / [drop] [take reverse] cleave concat zip - -.. code:: ipython2 - - J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave concat zip') - - -.. parsed-literal:: - - [[3 1] [4 2] [1 3] [2 4]] - - -I realized that each pair is repeated... - -.. code:: ipython2 - - J('[1 2 3 4] dup size 2 / [drop] [take reverse] cleave zip') - - -.. parsed-literal:: - - [1 2 3 4] [[1 3] [2 4]] - - -.. code:: ipython2 - - define('AoC2017.1.extra == dup size 2 / [drop] [take reverse] cleave zip swap pop total_matches 2 *') - -.. code:: ipython2 - - J('[1 2 1 2] AoC2017.1.extra') - - -.. parsed-literal:: - - 6 - - -.. code:: ipython2 - - J('[1 2 2 1] AoC2017.1.extra') - - -.. parsed-literal:: - - 0 - - -.. code:: ipython2 - - J('[1 2 3 4 2 5] AoC2017.1.extra') - - -.. parsed-literal:: - - 4 - - -Refactor FTW -============ - -With Joy a great deal of the heuristics from Forth programming carry -over nicely. For example, refactoring into small, well-scoped commands -with mnemonic names... - -:: - - rotate_seq == uncons swap unit concat - pair_up == dup rotate_seq zip - add_if_match == [=] [pop +] [popop] ifte - total_matches == [i add_if_match] step_zero - - AoC2017.1 == pair_up total_matches - - half_of_size == dup size 2 / - split_at == [drop] [take reverse] cleave - pair_up.extra == half_of_size split_at zip swap pop - - AoC2017.1.extra == pair_up.extra total_matches 2 * diff --git a/docs/Advent of Code 2017 December 2nd.html b/docs/Advent of Code 2017 December 2nd.html deleted file mode 100644 index 6f72cc2..0000000 --- a/docs/Advent of Code 2017 December 2nd.html +++ /dev/null @@ -1,12487 +0,0 @@ - - - -Advent of Code 2017 December 2nd - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Advent of Code 2017

December 2nd

For each row, determine the difference between the largest value and the smallest value; the checksum is the sum of all of these differences.

-

For example, given the following spreadsheet:

- -
5 1 9 5
-7 5 3
-2 4 6 8
-
-
-
    -
  • The first row's largest and smallest values are 9 and 1, and their difference is 8.
    • -
  • The second row's largest and smallest values are 7 and 3, and their difference is 4.
    • -
  • The third row's difference is 6.
    • -
-

In this example, the spreadsheet's checksum would be 8 + 4 + 6 = 18.

- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import J, V, define
-
- -
-
-
- -
-
-
-
-
-

I'll assume the input is a Joy sequence of sequences of integers.

- -
[[5 1 9 5]
- [7 5 3]
- [2 4 6 8]]
-
-
-

So, obviously, the initial form will be a step function:

- -
AoC2017.2 == 0 swap [F +] step
- -
-
-
-
-
-
-
-

This function F must get the max and min of a row of numbers and subtract. We can define a helper function maxmin which does this:

- -
-
-
-
-
-
In [2]:
-
-
-
define('maxmin == [max] [min] cleave')
-
- -
-
-
- -
-
-
-
In [3]:
-
-
-
J('[1 2 3] maxmin')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 1
-
-
-
- -
-
- -
-
-
-
-
-

Then F just does that then subtracts the min from the max:

- -
F == maxmin -
-
-
-

So:

- -
-
-
-
-
-
In [4]:
-
-
-
define('AoC2017.2 == [maxmin - +] step_zero')
-
- -
-
-
- -
-
-
-
In [5]:
-
-
-
J('''
-
-[[5 1 9 5]
- [7 5 3]
- [2 4 6 8]] AoC2017.2
-
-''')
-
- -
-
-
- -
-
- - -
- -
- - -
-
18
-
-
-
- -
-
- -
-
-
-
-
-

...find the only two numbers in each row where one evenly divides the other - that is, where the result of the division operation is a whole number. They would like you to find those numbers on each line, divide them, and add up each line's result.

-

For example, given the following spreadsheet:

- -
5 9 2 8
-9 4 7 3
-3 8 6 5
-
-
-
    -
  • In the first row, the only two numbers that evenly divide are 8 and 2; the result of this division is 4.
    • -
  • In the second row, the two numbers are 9 and 3; the result is 3.
    • -
  • In the third row, the result is 2.
    • -
-

In this example, the sum of the results would be 4 + 3 + 2 = 9.

-

What is the sum of each row's result in your puzzle input?

- -
-
-
-
-
-
In [6]:
-
-
-
J('[5 9 2 8] sort reverse')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[9 8 5 2]
-
-
-
- -
-
- -
-
-
-
In [7]:
-
-
-
J('[9 8 5 2] uncons [swap [divmod] cons] dupdip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[8 5 2] [9 divmod] [8 5 2]
-
-
-
- -
-
- -
-
-
-
-
- -
[9 8 5 2] uncons [swap [divmod] cons F] dupdip G
-  [8 5 2]            [9 divmod]      F [8 5 2] G
- -
-
-
-
-
-
In [8]:
-
-
-
V('[8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                      . [8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip
-                              [8 5 2] . [9 divmod] [uncons swap] dip dup [i not] dip
-                   [8 5 2] [9 divmod] . [uncons swap] dip dup [i not] dip
-     [8 5 2] [9 divmod] [uncons swap] . dip dup [i not] dip
-                              [8 5 2] . uncons swap [9 divmod] dup [i not] dip
-                              8 [5 2] . swap [9 divmod] dup [i not] dip
-                              [5 2] 8 . [9 divmod] dup [i not] dip
-                   [5 2] 8 [9 divmod] . dup [i not] dip
-        [5 2] 8 [9 divmod] [9 divmod] . [i not] dip
-[5 2] 8 [9 divmod] [9 divmod] [i not] . dip
-                   [5 2] 8 [9 divmod] . i not [9 divmod]
-                              [5 2] 8 . 9 divmod not [9 divmod]
-                            [5 2] 8 9 . divmod not [9 divmod]
-                            [5 2] 1 1 . not [9 divmod]
-                        [5 2] 1 False . [9 divmod]
-             [5 2] 1 False [9 divmod] . 
-
-
-
- -
-
- -
-
-
-
-
-

Tricky

Let's think.

-

Given a sorted sequence (from highest to lowest) we want to

-
    -
  • for head, tail in sequence
      -
    • for term in tail:
        -
      • check if the head % term == 0
          -
        • if so compute head / term and terminate loop
          • -
        • else continue
          • -
        -
        • -
      -
      • -
    -
    • -
- -
-
-
-
-
-
-
-

So we want a loop I think

-
[a b c d] True [Q] loop
-[a b c d] Q    [Q] loop
-
-
-

Q should either leave the result and False, or the rest and True.

- -
   [a b c d] Q
------------------
-    result 0
-
-   [a b c d] Q
------------------
-    [b c d] 1
- -
-
-
-
-
-
-
-

This suggests that Q should start with:

- -
[a b c d] uncons dup roll<
-[b c d] [b c d] a
-
-
-

Now we just have to pop it if we don't need it.

- -
[b c d] [b c d] a [P] [T] [cons] app2 popdd [E] primrec
-[b c d] [b c d] [a P] [a T]                 [E] primrec
-
-
-
- -
w/ Q == [% not] [T] [F] primrec
-
-        [a b c d] uncons
-        a [b c d] tuck
-[b c d] a [b c d] uncons
-[b c d] a b [c d] roll>
-[b c d] [c d] a b Q
-[b c d] [c d] a b [% not] [T] [F] primrec
-
-[b c d] [c d] a b T
-[b c d] [c d] a b / roll> popop 0
-
-[b c d] [c d] a b F                   Q
-[b c d] [c d] a b pop swap uncons ... Q
-[b c d] [c d] a       swap uncons ... Q
-[b c d] a [c d]            uncons ... Q
-[b c d] a c [d]                   roll> Q
-[b c d] [d] a c Q
-
-Q == [% not] [/ roll> popop 0] [pop swap uncons roll>] primrec
-
-uncons tuck uncons roll> Q
- -
-
-
-
-
-
In [9]:
-
-
-
J('[8 5 3 2] 9 [swap] [% not] [cons] app2 popdd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[8 5 3 2] [9 swap] [9 % not]
-
-
-
- -
-
- -
-
-
-
-
-
- -
        [a b c d] uncons
-        a [b c d] tuck
-[b c d] a [b c d] [not] [popop 1] [Q] ifte
-
-[b c d] a [] popop 1
-[b c d] 1
-
-[b c d] a [b c d] Q 
-
-
-   a [...] Q
----------------
-   result 0
-
-   a [...] Q
----------------
-       1
-
-
-w/ Q == [first % not] [first / 0] [rest [not] [popop 1]] [ifte]
-
-
-
-a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte]
-a [b c d]  first % not
-a b % not
-a%b not
-bool(a%b)
-
-a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte]
-a [b c d]                first / 0
-a b / 0
-a/b 0
-
-a [b c d] [first % not] [first / 0] [rest [not] [popop 1]]   [ifte]
-a [b c d]                            rest [not] [popop 1] [Q] ifte
-a [c d]                                   [not] [popop 1] [Q] ifte
-a [c d]                                   [not] [popop 1] [Q] ifte
-
-a [c d] [not] [popop 1] [Q] ifte
-a [c d]  not
-
-a [] popop 1
-1
-
-a [c d] Q
-
-
-uncons tuck [first % not] [first / 0] [rest [not] [popop 1]] [ifte]
- -
-
-
-
-
-
-
-

I finally sat down with a piece of paper and blocked it out.

First, I made a function G that expects a number and a sequence of candidates and return the result or zero:

- -
   n [...] G
----------------
-    result
-
-   n [...] G
----------------
-       0
-
-
-

It's a recursive function that conditionally executes the recursive part of its recursive branch

- -
[Pg] [E] [R1 [Pi] [T]] [ifte] genrec
-
-
-

The recursive branch is the else-part of the inner ifte:

- -
G == [Pg] [E] [R1 [Pi] [T]]   [ifte] genrec
-  == [Pg] [E] [R1 [Pi] [T] [G] ifte] ifte
-
-
-

But this is in hindsight. Going forward I derived:

- -
G == [first % not]
-     [first /]
-     [rest [not] [popop 0]]
-     [ifte] genrec
-
-
-

The predicate detects if the n can be evenly divided by the first item in the list. If so, the then-part returns the result. Otherwise, we have:

- -
n [m ...] rest [not] [popop 0] [G] ifte
-n [...]        [not] [popop 0] [G] ifte
-
-
-

This ifte guards against empty sequences and returns zero in that case, otherwise it executes G.

- -
-
-
-
-
-
In [10]:
-
-
-
define('G == [first % not] [first /] [rest [not] [popop 0]] [ifte] genrec')
-
- -
-
-
- -
-
-
-
-
-

Now we need a word that uses G on each (head, tail) pair of a sequence until it finds a (non-zero) result. It's going to be designed to work on a stack that has some candidate n, a sequence of possible divisors, and a result that is zero to signal to continue (a non-zero value implies that it is the discovered result):

- -
   n [...] p find-result
----------------------------
-          result
-
-
-

It applies G using nullary because if it fails with one candidate it needs the list to get the next one (the list is otherwise consumed by G.)

- -
find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec
-
-n [...] p [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec
-
-
-

The base-case is trivial, return the (non-zero) result. The recursive branch...

- -
n [...] p roll< popop uncons [G] nullary find-result
-[...] p n       popop uncons [G] nullary find-result
-[...]                 uncons [G] nullary find-result
-m [..]                       [G] nullary find-result
-m [..] p                                 find-result
-
-
-

The puzzle states that the input is well-formed, meaning that we can expect a result before the row sequence empties and so do not need to guard the uncons.

- -
-
-
-
-
-
In [11]:
-
-
-
define('find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec')
-
- -
-
-
- -
-
-
-
In [14]:
-
-
-
J('[11 9 8 7 3 2] 0 tuck find-result')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3.0
-
-
-
- -
-
- -
-
-
-
-
-

In order to get the thing started, we need to sort the list in descending order, then prime the find-result function with a dummy candidate value and zero ("continue") flag.

- -
-
-
-
-
-
In [12]:
-
-
-
define('prep-row == sort reverse 0 tuck')
-
- -
-
-
- -
-
-
-
-
-

Now we can define our program.

- -
-
-
-
-
-
In [13]:
-
-
-
define('AoC20017.2.extra == [prep-row find-result +] step_zero')
-
- -
-
-
- -
-
-
-
In [15]:
-
-
-
J('''
-
-[[5 9 2 8]
- [9 4 7 3]
- [3 8 6 5]] AoC20017.2.extra
-
-''')
-
- -
-
-
- -
-
- - -
- -
- - -
-
9.0
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/Advent of Code 2017 December 2nd.ipynb b/docs/Advent of Code 2017 December 2nd.ipynb deleted file mode 100644 index 871349d..0000000 --- a/docs/Advent of Code 2017 December 2nd.ipynb +++ /dev/null @@ -1,554 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Advent of Code 2017\n", - "\n", - "## December 2nd\n", - "\n", - "For each row, determine the difference between the largest value and the smallest value; the checksum is the sum of all of these differences.\n", - "\n", - "For example, given the following spreadsheet:\n", - "\n", - " 5 1 9 5\n", - " 7 5 3\n", - " 2 4 6 8\n", - "\n", - "* The first row's largest and smallest values are 9 and 1, and their difference is 8.\n", - "* The second row's largest and smallest values are 7 and 3, and their difference is 4.\n", - "* The third row's difference is 6.\n", - "\n", - "In this example, the spreadsheet's checksum would be 8 + 4 + 6 = 18." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "I'll assume the input is a Joy sequence of sequences of integers.\n", - "\n", - " [[5 1 9 5]\n", - " [7 5 3]\n", - " [2 4 6 8]]\n", - "\n", - "So, obviously, the initial form will be a `step` function:\n", - "\n", - " AoC2017.2 == 0 swap [F +] step" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "This function `F` must get the `max` and `min` of a row of numbers and subtract. We can define a helper function `maxmin` which does this:" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [], - "source": [ - "define('maxmin == [max] [min] cleave')" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 1\n" - ] - } - ], - "source": [ - "J('[1 2 3] maxmin')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Then `F` just does that then subtracts the min from the max:\n", - "\n", - " F == maxmin -\n", - "\n", - "So:" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [], - "source": [ - "define('AoC2017.2 == [maxmin - +] step_zero')" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "18\n" - ] - } - ], - "source": [ - "J('''\n", - "\n", - "[[5 1 9 5]\n", - " [7 5 3]\n", - " [2 4 6 8]] AoC2017.2\n", - "\n", - "''')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "...find the only two numbers in each row where one evenly divides the other - that is, where the result of the division operation is a whole number. They would like you to find those numbers on each line, divide them, and add up each line's result.\n", - "\n", - "For example, given the following spreadsheet:\n", - "\n", - " 5 9 2 8\n", - " 9 4 7 3\n", - " 3 8 6 5\n", - "\n", - "* In the first row, the only two numbers that evenly divide are 8 and 2; the result of this division is 4.\n", - "* In the second row, the two numbers are 9 and 3; the result is 3.\n", - "* In the third row, the result is 2.\n", - "\n", - "In this example, the sum of the results would be 4 + 3 + 2 = 9.\n", - "\n", - "What is the sum of each row's result in your puzzle input?" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[9 8 5 2]\n" - ] - } - ], - "source": [ - "J('[5 9 2 8] sort reverse')" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[8 5 2] [9 divmod] [8 5 2]\n" - ] - } - ], - "source": [ - "J('[9 8 5 2] uncons [swap [divmod] cons] dupdip')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "\n", - " [9 8 5 2] uncons [swap [divmod] cons F] dupdip G\n", - " [8 5 2] [9 divmod] F [8 5 2] G\n", - "\n" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip\n", - " [8 5 2] . [9 divmod] [uncons swap] dip dup [i not] dip\n", - " [8 5 2] [9 divmod] . [uncons swap] dip dup [i not] dip\n", - " [8 5 2] [9 divmod] [uncons swap] . dip dup [i not] dip\n", - " [8 5 2] . uncons swap [9 divmod] dup [i not] dip\n", - " 8 [5 2] . swap [9 divmod] dup [i not] dip\n", - " [5 2] 8 . [9 divmod] dup [i not] dip\n", - " [5 2] 8 [9 divmod] . dup [i not] dip\n", - " [5 2] 8 [9 divmod] [9 divmod] . [i not] dip\n", - "[5 2] 8 [9 divmod] [9 divmod] [i not] . dip\n", - " [5 2] 8 [9 divmod] . i not [9 divmod]\n", - " [5 2] 8 . 9 divmod not [9 divmod]\n", - " [5 2] 8 9 . divmod not [9 divmod]\n", - " [5 2] 1 1 . not [9 divmod]\n", - " [5 2] 1 False . [9 divmod]\n", - " [5 2] 1 False [9 divmod] . \n" - ] - } - ], - "source": [ - "V('[8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Tricky\n", - "\n", - "Let's think.\n", - "\n", - "Given a *sorted* sequence (from highest to lowest) we want to \n", - "* for head, tail in sequence\n", - " * for term in tail:\n", - " * check if the head % term == 0\n", - " * if so compute head / term and terminate loop\n", - " * else continue" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### So we want a `loop` I think\n", - "\n", - " [a b c d] True [Q] loop\n", - " [a b c d] Q [Q] loop\n", - "\n", - "`Q` should either leave the result and False, or the `rest` and True.\n", - "\n", - " [a b c d] Q\n", - " -----------------\n", - " result 0\n", - "\n", - " [a b c d] Q\n", - " -----------------\n", - " [b c d] 1" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "This suggests that `Q` should start with:\n", - "\n", - " [a b c d] uncons dup roll<\n", - " [b c d] [b c d] a\n", - "\n", - "Now we just have to `pop` it if we don't need it.\n", - "\n", - " [b c d] [b c d] a [P] [T] [cons] app2 popdd [E] primrec\n", - " [b c d] [b c d] [a P] [a T] [E] primrec\n", - "\n", - "-------------------\n", - "\n", - " w/ Q == [% not] [T] [F] primrec\n", - "\n", - " [a b c d] uncons\n", - " a [b c d] tuck\n", - " [b c d] a [b c d] uncons\n", - " [b c d] a b [c d] roll>\n", - " [b c d] [c d] a b Q\n", - " [b c d] [c d] a b [% not] [T] [F] primrec\n", - "\n", - " [b c d] [c d] a b T\n", - " [b c d] [c d] a b / roll> popop 0\n", - "\n", - " [b c d] [c d] a b F Q\n", - " [b c d] [c d] a b pop swap uncons ... Q\n", - " [b c d] [c d] a swap uncons ... Q\n", - " [b c d] a [c d] uncons ... Q\n", - " [b c d] a c [d] roll> Q\n", - " [b c d] [d] a c Q\n", - "\n", - " Q == [% not] [/ roll> popop 0] [pop swap uncons roll>] primrec\n", - " \n", - " uncons tuck uncons roll> Q" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[8 5 3 2] [9 swap] [9 % not]\n" - ] - } - ], - "source": [ - "J('[8 5 3 2] 9 [swap] [% not] [cons] app2 popdd')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "-------------------\n", - "\n", - " [a b c d] uncons\n", - " a [b c d] tuck\n", - " [b c d] a [b c d] [not] [popop 1] [Q] ifte\n", - "\n", - " [b c d] a [] popop 1\n", - " [b c d] 1\n", - "\n", - " [b c d] a [b c d] Q \n", - "\n", - "\n", - " a [...] Q\n", - " ---------------\n", - " result 0\n", - "\n", - " a [...] Q\n", - " ---------------\n", - " 1\n", - "\n", - "\n", - " w/ Q == [first % not] [first / 0] [rest [not] [popop 1]] [ifte]\n", - "\n", - "\n", - "\n", - " a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte]\n", - " a [b c d] first % not\n", - " a b % not\n", - " a%b not\n", - " bool(a%b)\n", - "\n", - " a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte]\n", - " a [b c d] first / 0\n", - " a b / 0\n", - " a/b 0\n", - "\n", - " a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte]\n", - " a [b c d] rest [not] [popop 1] [Q] ifte\n", - " a [c d] [not] [popop 1] [Q] ifte\n", - " a [c d] [not] [popop 1] [Q] ifte\n", - "\n", - " a [c d] [not] [popop 1] [Q] ifte\n", - " a [c d] not\n", - "\n", - " a [] popop 1\n", - " 1\n", - "\n", - " a [c d] Q\n", - "\n", - "\n", - " uncons tuck [first % not] [first / 0] [rest [not] [popop 1]] [ifte]\n", - " \n", - " \n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### I finally sat down with a piece of paper and blocked it out.\n", - "\n", - "First, I made a function `G` that expects a number and a sequence of candidates and return the result or zero:\n", - "\n", - " n [...] G\n", - " ---------------\n", - " result\n", - "\n", - " n [...] G\n", - " ---------------\n", - " 0\n", - "\n", - "It's a recursive function that conditionally executes the recursive part of its recursive branch\n", - "\n", - " [Pg] [E] [R1 [Pi] [T]] [ifte] genrec\n", - "\n", - "The recursive branch is the else-part of the inner `ifte`:\n", - "\n", - " G == [Pg] [E] [R1 [Pi] [T]] [ifte] genrec\n", - " == [Pg] [E] [R1 [Pi] [T] [G] ifte] ifte\n", - "\n", - "But this is in hindsight. Going forward I derived:\n", - "\n", - " G == [first % not]\n", - " [first /]\n", - " [rest [not] [popop 0]]\n", - " [ifte] genrec\n", - "\n", - "The predicate detects if the `n` can be evenly divided by the `first` item in the list. If so, the then-part returns the result. Otherwise, we have:\n", - "\n", - " n [m ...] rest [not] [popop 0] [G] ifte\n", - " n [...] [not] [popop 0] [G] ifte\n", - "\n", - "This `ifte` guards against empty sequences and returns zero in that case, otherwise it executes `G`." - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [], - "source": [ - "define('G == [first % not] [first /] [rest [not] [popop 0]] [ifte] genrec')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we need a word that uses `G` on each (head, tail) pair of a sequence until it finds a (non-zero) result. It's going to be designed to work on a stack that has some candidate `n`, a sequence of possible divisors, and a result that is zero to signal to continue (a non-zero value implies that it is the discovered result):\n", - "\n", - " n [...] p find-result\n", - " ---------------------------\n", - " result\n", - "\n", - "It applies `G` using `nullary` because if it fails with one candidate it needs the list to get the next one (the list is otherwise consumed by `G`.)\n", - "\n", - " find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec\n", - "\n", - " n [...] p [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec\n", - "\n", - "The base-case is trivial, return the (non-zero) result. The recursive branch...\n", - "\n", - " n [...] p roll< popop uncons [G] nullary find-result\n", - " [...] p n popop uncons [G] nullary find-result\n", - " [...] uncons [G] nullary find-result\n", - " m [..] [G] nullary find-result\n", - " m [..] p find-result\n", - "\n", - "The puzzle states that the input is well-formed, meaning that we can expect a result before the row sequence empties and so do not need to guard the `uncons`." - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [], - "source": [ - "define('find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3.0\n" - ] - } - ], - "source": [ - "J('[11 9 8 7 3 2] 0 tuck find-result')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "In order to get the thing started, we need to `sort` the list in descending order, then prime the `find-result` function with a dummy candidate value and zero (\"continue\") flag." - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [], - "source": [ - "define('prep-row == sort reverse 0 tuck')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we can define our program." - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [], - "source": [ - "define('AoC20017.2.extra == [prep-row find-result +] step_zero')" - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9.0\n" - ] - } - ], - "source": [ - "J('''\n", - "\n", - "[[5 9 2 8]\n", - " [9 4 7 3]\n", - " [3 8 6 5]] AoC20017.2.extra\n", - "\n", - "''')" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Advent of Code 2017 December 2nd.md b/docs/Advent of Code 2017 December 2nd.md deleted file mode 100644 index 28b6908..0000000 --- a/docs/Advent of Code 2017 December 2nd.md +++ /dev/null @@ -1,361 +0,0 @@ - -# Advent of Code 2017 - -## December 2nd - -For each row, determine the difference between the largest value and the smallest value; the checksum is the sum of all of these differences. - -For example, given the following spreadsheet: - - 5 1 9 5 - 7 5 3 - 2 4 6 8 - -* The first row's largest and smallest values are 9 and 1, and their difference is 8. -* The second row's largest and smallest values are 7 and 3, and their difference is 4. -* The third row's difference is 6. - -In this example, the spreadsheet's checksum would be 8 + 4 + 6 = 18. - - -```python -from notebook_preamble import J, V, define -``` - -I'll assume the input is a Joy sequence of sequences of integers. - - [[5 1 9 5] - [7 5 3] - [2 4 6 8]] - -So, obviously, the initial form will be a `step` function: - - AoC2017.2 == 0 swap [F +] step - -This function `F` must get the `max` and `min` of a row of numbers and subtract. We can define a helper function `maxmin` which does this: - - -```python -define('maxmin == [max] [min] cleave') -``` - - -```python -J('[1 2 3] maxmin') -``` - - 3 1 - - -Then `F` just does that then subtracts the min from the max: - - F == maxmin - - -So: - - -```python -define('AoC2017.2 == [maxmin - +] step_zero') -``` - - -```python -J(''' - -[[5 1 9 5] - [7 5 3] - [2 4 6 8]] AoC2017.2 - -''') -``` - - 18 - - -...find the only two numbers in each row where one evenly divides the other - that is, where the result of the division operation is a whole number. They would like you to find those numbers on each line, divide them, and add up each line's result. - -For example, given the following spreadsheet: - - 5 9 2 8 - 9 4 7 3 - 3 8 6 5 - -* In the first row, the only two numbers that evenly divide are 8 and 2; the result of this division is 4. -* In the second row, the two numbers are 9 and 3; the result is 3. -* In the third row, the result is 2. - -In this example, the sum of the results would be 4 + 3 + 2 = 9. - -What is the sum of each row's result in your puzzle input? - - -```python -J('[5 9 2 8] sort reverse') -``` - - [9 8 5 2] - - - -```python -J('[9 8 5 2] uncons [swap [divmod] cons] dupdip') -``` - - [8 5 2] [9 divmod] [8 5 2] - - - - [9 8 5 2] uncons [swap [divmod] cons F] dupdip G - [8 5 2] [9 divmod] F [8 5 2] G - - - - -```python -V('[8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip') -``` - - . [8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip - [8 5 2] . [9 divmod] [uncons swap] dip dup [i not] dip - [8 5 2] [9 divmod] . [uncons swap] dip dup [i not] dip - [8 5 2] [9 divmod] [uncons swap] . dip dup [i not] dip - [8 5 2] . uncons swap [9 divmod] dup [i not] dip - 8 [5 2] . swap [9 divmod] dup [i not] dip - [5 2] 8 . [9 divmod] dup [i not] dip - [5 2] 8 [9 divmod] . dup [i not] dip - [5 2] 8 [9 divmod] [9 divmod] . [i not] dip - [5 2] 8 [9 divmod] [9 divmod] [i not] . dip - [5 2] 8 [9 divmod] . i not [9 divmod] - [5 2] 8 . 9 divmod not [9 divmod] - [5 2] 8 9 . divmod not [9 divmod] - [5 2] 1 1 . not [9 divmod] - [5 2] 1 False . [9 divmod] - [5 2] 1 False [9 divmod] . - - -## Tricky - -Let's think. - -Given a *sorted* sequence (from highest to lowest) we want to -* for head, tail in sequence - * for term in tail: - * check if the head % term == 0 - * if so compute head / term and terminate loop - * else continue - -### So we want a `loop` I think - - [a b c d] True [Q] loop - [a b c d] Q [Q] loop - -`Q` should either leave the result and False, or the `rest` and True. - - [a b c d] Q - ----------------- - result 0 - - [a b c d] Q - ----------------- - [b c d] 1 - -This suggests that `Q` should start with: - - [a b c d] uncons dup roll< - [b c d] [b c d] a - -Now we just have to `pop` it if we don't need it. - - [b c d] [b c d] a [P] [T] [cons] app2 popdd [E] primrec - [b c d] [b c d] [a P] [a T] [E] primrec - -------------------- - - w/ Q == [% not] [T] [F] primrec - - [a b c d] uncons - a [b c d] tuck - [b c d] a [b c d] uncons - [b c d] a b [c d] roll> - [b c d] [c d] a b Q - [b c d] [c d] a b [% not] [T] [F] primrec - - [b c d] [c d] a b T - [b c d] [c d] a b / roll> popop 0 - - [b c d] [c d] a b F Q - [b c d] [c d] a b pop swap uncons ... Q - [b c d] [c d] a swap uncons ... Q - [b c d] a [c d] uncons ... Q - [b c d] a c [d] roll> Q - [b c d] [d] a c Q - - Q == [% not] [/ roll> popop 0] [pop swap uncons roll>] primrec - - uncons tuck uncons roll> Q - - -```python -J('[8 5 3 2] 9 [swap] [% not] [cons] app2 popdd') -``` - - [8 5 3 2] [9 swap] [9 % not] - - -------------------- - - [a b c d] uncons - a [b c d] tuck - [b c d] a [b c d] [not] [popop 1] [Q] ifte - - [b c d] a [] popop 1 - [b c d] 1 - - [b c d] a [b c d] Q - - - a [...] Q - --------------- - result 0 - - a [...] Q - --------------- - 1 - - - w/ Q == [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - - - - a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - a [b c d] first % not - a b % not - a%b not - bool(a%b) - - a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - a [b c d] first / 0 - a b / 0 - a/b 0 - - a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - a [b c d] rest [not] [popop 1] [Q] ifte - a [c d] [not] [popop 1] [Q] ifte - a [c d] [not] [popop 1] [Q] ifte - - a [c d] [not] [popop 1] [Q] ifte - a [c d] not - - a [] popop 1 - 1 - - a [c d] Q - - - uncons tuck [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - - - - -### I finally sat down with a piece of paper and blocked it out. - -First, I made a function `G` that expects a number and a sequence of candidates and return the result or zero: - - n [...] G - --------------- - result - - n [...] G - --------------- - 0 - -It's a recursive function that conditionally executes the recursive part of its recursive branch - - [Pg] [E] [R1 [Pi] [T]] [ifte] genrec - -The recursive branch is the else-part of the inner `ifte`: - - G == [Pg] [E] [R1 [Pi] [T]] [ifte] genrec - == [Pg] [E] [R1 [Pi] [T] [G] ifte] ifte - -But this is in hindsight. Going forward I derived: - - G == [first % not] - [first /] - [rest [not] [popop 0]] - [ifte] genrec - -The predicate detects if the `n` can be evenly divided by the `first` item in the list. If so, the then-part returns the result. Otherwise, we have: - - n [m ...] rest [not] [popop 0] [G] ifte - n [...] [not] [popop 0] [G] ifte - -This `ifte` guards against empty sequences and returns zero in that case, otherwise it executes `G`. - - -```python -define('G == [first % not] [first /] [rest [not] [popop 0]] [ifte] genrec') -``` - -Now we need a word that uses `G` on each (head, tail) pair of a sequence until it finds a (non-zero) result. It's going to be designed to work on a stack that has some candidate `n`, a sequence of possible divisors, and a result that is zero to signal to continue (a non-zero value implies that it is the discovered result): - - n [...] p find-result - --------------------------- - result - -It applies `G` using `nullary` because if it fails with one candidate it needs the list to get the next one (the list is otherwise consumed by `G`.) - - find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec - - n [...] p [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec - -The base-case is trivial, return the (non-zero) result. The recursive branch... - - n [...] p roll< popop uncons [G] nullary find-result - [...] p n popop uncons [G] nullary find-result - [...] uncons [G] nullary find-result - m [..] [G] nullary find-result - m [..] p find-result - -The puzzle states that the input is well-formed, meaning that we can expect a result before the row sequence empties and so do not need to guard the `uncons`. - - -```python -define('find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec') -``` - - -```python -J('[11 9 8 7 3 2] 0 tuck find-result') -``` - - 3.0 - - -In order to get the thing started, we need to `sort` the list in descending order, then prime the `find-result` function with a dummy candidate value and zero ("continue") flag. - - -```python -define('prep-row == sort reverse 0 tuck') -``` - -Now we can define our program. - - -```python -define('AoC20017.2.extra == [prep-row find-result +] step_zero') -``` - - -```python -J(''' - -[[5 9 2 8] - [9 4 7 3] - [3 8 6 5]] AoC20017.2.extra - -''') -``` - - 9.0 - diff --git a/docs/Advent of Code 2017 December 2nd.rst b/docs/Advent of Code 2017 December 2nd.rst deleted file mode 100644 index 7b85b26..0000000 --- a/docs/Advent of Code 2017 December 2nd.rst +++ /dev/null @@ -1,432 +0,0 @@ - -Advent of Code 2017 -=================== - -December 2nd ------------- - -For each row, determine the difference between the largest value and the -smallest value; the checksum is the sum of all of these differences. - -For example, given the following spreadsheet: - -:: - - 5 1 9 5 - 7 5 3 - 2 4 6 8 - -- The first row's largest and smallest values are 9 and 1, and their - difference is 8. -- The second row's largest and smallest values are 7 and 3, and their - difference is 4. -- The third row's difference is 6. - -In this example, the spreadsheet's checksum would be 8 + 4 + 6 = 18. - -.. code:: ipython2 - - from notebook_preamble import J, V, define - -I'll assume the input is a Joy sequence of sequences of integers. - -:: - - [[5 1 9 5] - [7 5 3] - [2 4 6 8]] - -So, obviously, the initial form will be a ``step`` function: - -:: - - AoC2017.2 == 0 swap [F +] step - -This function ``F`` must get the ``max`` and ``min`` of a row of numbers -and subtract. We can define a helper function ``maxmin`` which does -this: - -.. code:: ipython2 - - define('maxmin == [max] [min] cleave') - -.. code:: ipython2 - - J('[1 2 3] maxmin') - - -.. parsed-literal:: - - 3 1 - - -Then ``F`` just does that then subtracts the min from the max: - -:: - - F == maxmin - - -So: - -.. code:: ipython2 - - define('AoC2017.2 == [maxmin - +] step_zero') - -.. code:: ipython2 - - J(''' - - [[5 1 9 5] - [7 5 3] - [2 4 6 8]] AoC2017.2 - - ''') - - -.. parsed-literal:: - - 18 - - -...find the only two numbers in each row where one evenly divides the -other - that is, where the result of the division operation is a whole -number. They would like you to find those numbers on each line, divide -them, and add up each line's result. - -For example, given the following spreadsheet: - -:: - - 5 9 2 8 - 9 4 7 3 - 3 8 6 5 - -- In the first row, the only two numbers that evenly divide are 8 and - 2; the result of this division is 4. -- In the second row, the two numbers are 9 and 3; the result is 3. -- In the third row, the result is 2. - -In this example, the sum of the results would be 4 + 3 + 2 = 9. - -What is the sum of each row's result in your puzzle input? - -.. code:: ipython2 - - J('[5 9 2 8] sort reverse') - - -.. parsed-literal:: - - [9 8 5 2] - - -.. code:: ipython2 - - J('[9 8 5 2] uncons [swap [divmod] cons] dupdip') - - -.. parsed-literal:: - - [8 5 2] [9 divmod] [8 5 2] - - -:: - - [9 8 5 2] uncons [swap [divmod] cons F] dupdip G - [8 5 2] [9 divmod] F [8 5 2] G - -.. code:: ipython2 - - V('[8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip') - - -.. parsed-literal:: - - . [8 5 2] [9 divmod] [uncons swap] dip dup [i not] dip - [8 5 2] . [9 divmod] [uncons swap] dip dup [i not] dip - [8 5 2] [9 divmod] . [uncons swap] dip dup [i not] dip - [8 5 2] [9 divmod] [uncons swap] . dip dup [i not] dip - [8 5 2] . uncons swap [9 divmod] dup [i not] dip - 8 [5 2] . swap [9 divmod] dup [i not] dip - [5 2] 8 . [9 divmod] dup [i not] dip - [5 2] 8 [9 divmod] . dup [i not] dip - [5 2] 8 [9 divmod] [9 divmod] . [i not] dip - [5 2] 8 [9 divmod] [9 divmod] [i not] . dip - [5 2] 8 [9 divmod] . i not [9 divmod] - [5 2] 8 . 9 divmod not [9 divmod] - [5 2] 8 9 . divmod not [9 divmod] - [5 2] 1 1 . not [9 divmod] - [5 2] 1 False . [9 divmod] - [5 2] 1 False [9 divmod] . - - -Tricky ------- - -Let's think. - -Given a *sorted* sequence (from highest to lowest) we want to \* for -head, tail in sequence \* for term in tail: \* check if the head % term -== 0 \* if so compute head / term and terminate loop \* else continue - -So we want a ``loop`` I think -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - [a b c d] True [Q] loop - [a b c d] Q [Q] loop - -``Q`` should either leave the result and False, or the ``rest`` and -True. - -:: - - [a b c d] Q - ----------------- - result 0 - - [a b c d] Q - ----------------- - [b c d] 1 - -This suggests that ``Q`` should start with: - -:: - - [a b c d] uncons dup roll< - [b c d] [b c d] a - -Now we just have to ``pop`` it if we don't need it. - -:: - - [b c d] [b c d] a [P] [T] [cons] app2 popdd [E] primrec - [b c d] [b c d] [a P] [a T] [E] primrec - --------------- - -:: - - w/ Q == [% not] [T] [F] primrec - - [a b c d] uncons - a [b c d] tuck - [b c d] a [b c d] uncons - [b c d] a b [c d] roll> - [b c d] [c d] a b Q - [b c d] [c d] a b [% not] [T] [F] primrec - - [b c d] [c d] a b T - [b c d] [c d] a b / roll> popop 0 - - [b c d] [c d] a b F Q - [b c d] [c d] a b pop swap uncons ... Q - [b c d] [c d] a swap uncons ... Q - [b c d] a [c d] uncons ... Q - [b c d] a c [d] roll> Q - [b c d] [d] a c Q - - Q == [% not] [/ roll> popop 0] [pop swap uncons roll>] primrec - - uncons tuck uncons roll> Q - -.. code:: ipython2 - - J('[8 5 3 2] 9 [swap] [% not] [cons] app2 popdd') - - -.. parsed-literal:: - - [8 5 3 2] [9 swap] [9 % not] - - --------------- - -:: - - [a b c d] uncons - a [b c d] tuck - [b c d] a [b c d] [not] [popop 1] [Q] ifte - - [b c d] a [] popop 1 - [b c d] 1 - - [b c d] a [b c d] Q - - - a [...] Q - --------------- - result 0 - - a [...] Q - --------------- - 1 - - - w/ Q == [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - - - - a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - a [b c d] first % not - a b % not - a%b not - bool(a%b) - - a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - a [b c d] first / 0 - a b / 0 - a/b 0 - - a [b c d] [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - a [b c d] rest [not] [popop 1] [Q] ifte - a [c d] [not] [popop 1] [Q] ifte - a [c d] [not] [popop 1] [Q] ifte - - a [c d] [not] [popop 1] [Q] ifte - a [c d] not - - a [] popop 1 - 1 - - a [c d] Q - - - uncons tuck [first % not] [first / 0] [rest [not] [popop 1]] [ifte] - -I finally sat down with a piece of paper and blocked it out. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -First, I made a function ``G`` that expects a number and a sequence of -candidates and return the result or zero: - -:: - - n [...] G - --------------- - result - - n [...] G - --------------- - 0 - -It's a recursive function that conditionally executes the recursive part -of its recursive branch - -:: - - [Pg] [E] [R1 [Pi] [T]] [ifte] genrec - -The recursive branch is the else-part of the inner ``ifte``: - -:: - - G == [Pg] [E] [R1 [Pi] [T]] [ifte] genrec - == [Pg] [E] [R1 [Pi] [T] [G] ifte] ifte - -But this is in hindsight. Going forward I derived: - -:: - - G == [first % not] - [first /] - [rest [not] [popop 0]] - [ifte] genrec - -The predicate detects if the ``n`` can be evenly divided by the -``first`` item in the list. If so, the then-part returns the result. -Otherwise, we have: - -:: - - n [m ...] rest [not] [popop 0] [G] ifte - n [...] [not] [popop 0] [G] ifte - -This ``ifte`` guards against empty sequences and returns zero in that -case, otherwise it executes ``G``. - -.. code:: ipython2 - - define('G == [first % not] [first /] [rest [not] [popop 0]] [ifte] genrec') - -Now we need a word that uses ``G`` on each (head, tail) pair of a -sequence until it finds a (non-zero) result. It's going to be designed -to work on a stack that has some candidate ``n``, a sequence of possible -divisors, and a result that is zero to signal to continue (a non-zero -value implies that it is the discovered result): - -:: - - n [...] p find-result - --------------------------- - result - -It applies ``G`` using ``nullary`` because if it fails with one -candidate it needs the list to get the next one (the list is otherwise -consumed by ``G``.) - -:: - - find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec - - n [...] p [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec - -The base-case is trivial, return the (non-zero) result. The recursive -branch... - -:: - - n [...] p roll< popop uncons [G] nullary find-result - [...] p n popop uncons [G] nullary find-result - [...] uncons [G] nullary find-result - m [..] [G] nullary find-result - m [..] p find-result - -The puzzle states that the input is well-formed, meaning that we can -expect a result before the row sequence empties and so do not need to -guard the ``uncons``. - -.. code:: ipython2 - - define('find-result == [0 >] [roll> popop] [roll< popop uncons [G] nullary] primrec') - -.. code:: ipython2 - - J('[11 9 8 7 3 2] 0 tuck find-result') - - -.. parsed-literal:: - - 3.0 - - -In order to get the thing started, we need to ``sort`` the list in -descending order, then prime the ``find-result`` function with a dummy -candidate value and zero ("continue") flag. - -.. code:: ipython2 - - define('prep-row == sort reverse 0 tuck') - -Now we can define our program. - -.. code:: ipython2 - - define('AoC20017.2.extra == [prep-row find-result +] step_zero') - -.. code:: ipython2 - - J(''' - - [[5 9 2 8] - [9 4 7 3] - [3 8 6 5]] AoC20017.2.extra - - ''') - - -.. parsed-literal:: - - 9.0 - diff --git a/docs/Advent of Code 2017 December 3rd.html b/docs/Advent of Code 2017 December 3rd.html deleted file mode 100644 index fb13cb1..0000000 --- a/docs/Advent of Code 2017 December 3rd.html +++ /dev/null @@ -1,13592 +0,0 @@ - - - -Advent of Code 2017 December 3rd - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Advent of Code 2017

December 3rd

You come across an experimental new kind of memory stored on an infinite two-dimensional grid.

-

Each square on the grid is allocated in a spiral pattern starting at a location marked 1 and then counting up while spiraling outward. For example, the first few squares are allocated like this:

- -
17  16  15  14  13
-18   5   4   3  12
-19   6   1   2  11
-20   7   8   9  10
-21  22  23---> ...
-
-
-

While this is very space-efficient (no squares are skipped), requested data must be carried back to square 1 (the location of the only access port for this memory system) by programs that can only move up, down, left, or right. They always take the shortest path: the Manhattan Distance between the location of the data and square 1.

-

For example:

-
    -
  • Data from square 1 is carried 0 steps, since it's at the access port.
    • -
  • Data from square 12 is carried 3 steps, such as: down, left, left.
    • -
  • Data from square 23 is carried only 2 steps: up twice.
    • -
  • Data from square 1024 must be carried 31 steps.
    • -
-

How many steps are required to carry the data from the square identified in your puzzle input all the way to the access port?

- -
-
-
-
-
-
-
-

Analysis

I freely admit that I worked out the program I wanted to write using graph paper and some Python doodles. There's no point in trying to write a Joy program until I'm sure I understand the problem well enough.

-

The first thing I did was to write a column of numbers from 1 to n (32 as it happens) and next to them the desired output number, to look for patterns directly:

- -
1  0
-2  1
-3  2
-4  1
-5  2
-6  1
-7  2
-8  1
-9  2
-10 3
-11 2
-12 3
-13 4
-14 3
-15 2
-16 3
-17 4
-18 3
-19 2
-20 3
-21 4
-22 3
-23 2
-24 3
-25 4
-26 5
-27 4
-28 3
-29 4
-30 5
-31 6
-32 5
- -
-
-
-
-
-
-
-

There are four groups repeating for a given "rank", then the pattern enlarges and four groups repeat again, etc.

- -
        1 2
-      3 2 3 4
-    5 4 3 4 5 6
-  7 6 5 4 5 6 7 8
-9 8 7 6 5 6 7 8 9 10
-
-
-

Four of this pyramid interlock to tile the plane extending from the initial "1" square.

- -
         2   3   |    4  5   |    6  7   |    8  9
-      10 11 12 13|14 15 16 17|18 19 20 21|22 23 24 25
-
-
-

And so on.

- -
-
-
-
-
-
-
-

We can figure out the pattern for a row of the pyramid at a given "rank" $k$:

-

$2k - 1, 2k - 2, ..., k, k + 1, k + 2, ..., 2k$

-

or

-

$k + (k - 1), k + (k - 2), ..., k, k + 1, k + 2, ..., k + k$

-

This shows that the series consists at each place of $k$ plus some number that begins at $k - 1$, decreases to zero, then increases to $k$. Each row has $2k$ members.

- -
-
-
-
-
-
-
-

Let's figure out how, given an index into a row, we can calculate the value there. The index will be from 0 to $k - 1$.

-

Let's look at an example, with $k = 4$:

- -
0 1 2 3 4 5 6 7
-7 6 5 4 5 6 7 8
- -
-
-
-
-
-
In [1]:
-
-
-
k = 4
-
- -
-
-
- -
-
-
-
-
-

Subtract $k$ from the index and take the absolute value:

- -
-
-
-
-
-
In [2]:
-
-
-
for n in range(2 * k):
-    print abs(n - k),
-
- -
-
-
- -
-
- - -
- -
- - -
-
4 3 2 1 0 1 2 3
-
-
-
- -
-
- -
-
-
-
-
-

Not quite. Subtract $k - 1$ from the index and take the absolute value:

- -
-
-
-
-
-
In [3]:
-
-
-
for n in range(2 * k):
-    print abs(n - (k - 1)),
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 0 1 2 3 4
-
-
-
- -
-
- -
-
-
-
-
-

Great, now add $k$...

- -
-
-
-
-
-
In [4]:
-
-
-
for n in range(2 * k):
-    print abs(n - (k - 1)) + k,
-
- -
-
-
- -
-
- - -
- -
- - -
-
7 6 5 4 5 6 7 8
-
-
-
- -
-
- -
-
-
-
-
-

So to write a function that can give us the value of a row at a given index:

- -
-
-
-
-
-
In [5]:
-
-
-
def row_value(k, i):
-    i %= (2 * k)  # wrap the index at the row boundary.
-    return abs(i - (k - 1)) + k
-
- -
-
-
- -
-
-
-
In [6]:
-
-
-
k = 5
-for i in range(2 * k):
-    print row_value(k, i),
-
- -
-
-
- -
-
- - -
- -
- - -
-
9 8 7 6 5 6 7 8 9 10
-
-
-
- -
-
- -
-
-
-
-
-

(I'm leaving out details of how I figured this all out and just giving the relevent bits. It took a little while to zero in of the aspects of the pattern that were important for the task.)

- -
-
-
-
-
-
-
-

Finding the rank and offset of a number.

Now that we can compute the desired output value for a given rank and the offset (index) into that rank, we need to determine how to find the rank and offset of a number.

-

The rank is easy to find by iteratively stripping off the amount already covered by previous ranks until you find the one that brackets the target number. Because each row is $2k$ places and there are $4$ per rank each rank contains $8k$ places. Counting the initial square we have:

-

$corner_k = 1 + \sum_{n=1}^k 8n$

-

I'm not mathematically sophisticated enough to turn this directly into a formula (but Sympy is, see below.) I'm going to write a simple Python function to iterate and search:

- -
-
-
-
-
-
In [7]:
-
-
-
def rank_and_offset(n):
-    assert n >= 2  # Guard the domain.
-    n -= 2  # Subtract two,
-            # one for the initial square,
-            # and one because we are counting from 1 instead of 0.
-    k = 1
-    while True:
-        m = 8 * k  # The number of places total in this rank, 4(2k).
-        if n < m:
-            return k, n % (2 * k)
-        n -= m  # Remove this rank's worth.
-        k += 1
-
- -
-
-
- -
-
-
-
In [8]:
-
-
-
for n in range(2, 51):
-    print n, rank_and_offset(n)
-
- -
-
-
- -
-
- - -
- -
- - -
-
2 (1, 0)
-3 (1, 1)
-4 (1, 0)
-5 (1, 1)
-6 (1, 0)
-7 (1, 1)
-8 (1, 0)
-9 (1, 1)
-10 (2, 0)
-11 (2, 1)
-12 (2, 2)
-13 (2, 3)
-14 (2, 0)
-15 (2, 1)
-16 (2, 2)
-17 (2, 3)
-18 (2, 0)
-19 (2, 1)
-20 (2, 2)
-21 (2, 3)
-22 (2, 0)
-23 (2, 1)
-24 (2, 2)
-25 (2, 3)
-26 (3, 0)
-27 (3, 1)
-28 (3, 2)
-29 (3, 3)
-30 (3, 4)
-31 (3, 5)
-32 (3, 0)
-33 (3, 1)
-34 (3, 2)
-35 (3, 3)
-36 (3, 4)
-37 (3, 5)
-38 (3, 0)
-39 (3, 1)
-40 (3, 2)
-41 (3, 3)
-42 (3, 4)
-43 (3, 5)
-44 (3, 0)
-45 (3, 1)
-46 (3, 2)
-47 (3, 3)
-48 (3, 4)
-49 (3, 5)
-50 (4, 0)
-
-
-
- -
-
- -
-
-
-
In [9]:
-
-
-
for n in range(2, 51):
-    k, i = rank_and_offset(n)
-    print n, row_value(k, i)
-
- -
-
-
- -
-
- - -
- -
- - -
-
2 1
-3 2
-4 1
-5 2
-6 1
-7 2
-8 1
-9 2
-10 3
-11 2
-12 3
-13 4
-14 3
-15 2
-16 3
-17 4
-18 3
-19 2
-20 3
-21 4
-22 3
-23 2
-24 3
-25 4
-26 5
-27 4
-28 3
-29 4
-30 5
-31 6
-32 5
-33 4
-34 3
-35 4
-36 5
-37 6
-38 5
-39 4
-40 3
-41 4
-42 5
-43 6
-44 5
-45 4
-46 3
-47 4
-48 5
-49 6
-50 7
-
-
-
- -
-
- -
-
-
-
-
-

Putting it all together

-
-
-
-
-
-
In [10]:
-
-
-
def row_value(k, i):
-    return abs(i - (k - 1)) + k
-
-
-def rank_and_offset(n):
-    n -= 2  # Subtract two,
-            # one for the initial square,
-            # and one because we are counting from 1 instead of 0.
-    k = 1
-    while True:
-        m = 8 * k  # The number of places total in this rank, 4(2k).
-        if n < m:
-            return k, n % (2 * k)
-        n -= m  # Remove this rank's worth.
-        k += 1
-
-
-def aoc20173(n):
-    if n <= 1:
-        return 0
-    k, i = rank_and_offset(n)
-    return row_value(k, i)
-
- -
-
-
- -
-
-
-
In [11]:
-
-
-
aoc20173(23)
-
- -
-
-
- -
-
- - -
- -
Out[11]:
- - - - -
-
2
-
- -
- -
-
- -
-
-
-
In [12]:
-
-
-
aoc20173(23000)
-
- -
-
-
- -
-
- - -
- -
Out[12]:
- - - - -
-
105
-
- -
- -
-
- -
-
-
-
In [13]:
-
-
-
aoc20173(23000000000000)
-
- -
-
-
- -
-
- - -
- -
Out[13]:
- - - - -
-
4572225
-
- -
- -
-
- -
-
-
-
-
-

Sympy to the Rescue

Find the rank for large numbers

Using e.g. Sympy we can find the rank directly by solving for the roots of an equation. For large numbers this will (eventually) be faster than iterating as rank_and_offset() does.

- -
-
-
-
-
-
In [14]:
-
-
-
from sympy import floor, lambdify, solve, symbols
-from sympy import init_printing
-init_printing() 
-
- -
-
-
- -
-
-
-
In [15]:
-
-
-
k = symbols('k')
-
- -
-
-
- -
-
-
-
-
-

Since

-

$1 + 2 + 3 + ... + N = \frac{N(N + 1)}{2}$

-

and

-

$\sum_{n=1}^k 8n = 8(\sum_{n=1}^k n) = 8\frac{k(k + 1)}{2}$

-

We want:

- -
-
-
-
-
-
In [16]:
-
-
-
E = 2 + 8 * k * (k + 1) / 2  # For the reason for adding 2 see above.
-
-E
-
- -
-
-
- -
-
- - -
- -
Out[16]:
- - - - -
-$$4 k \left(k + 1\right) + 2$$ -
- -
- -
-
- -
-
-
-
-
-

We can write a function to solve for $k$ given some $n$...

- -
-
-
-
-
-
In [17]:
-
-
-
def rank_of(n):
-    return floor(max(solve(E - n, k))) + 1
-
- -
-
-
- -
-
-
-
-
-

First solve() for $E - n = 0$ which has two solutions (because the equation is quadratic so it has two roots) and since we only care about the larger one we use max() to select it. It will generally not be a nice integer (unless $n$ is the number of an end-corner of a rank) so we take the floor() and add 1 to get the integer rank of $n$. (Taking the ceiling() gives off-by-one errors on the rank boundaries. I don't know why. I'm basically like a monkey doing math here.) =-D

-

It gives correct answers:

- -
-
-
-
-
-
In [18]:
-
-
-
for n in (9, 10, 25, 26, 49, 50):
-    print n, rank_of(n)
-
- -
-
-
- -
-
- - -
- -
- - -
-
9 1
-10 2
-25 2
-26 3
-49 3
-50 4
-
-
-
- -
-
- -
-
-
-
-
-

And it runs much faster (at least for large numbers):

- -
-
-
-
-
-
In [19]:
-
-
-
%time rank_of(23000000000000)  # Compare runtime with rank_and_offset()!
-
- -
-
-
- -
-
- - -
- -
- - -
-
CPU times: user 68 ms, sys: 8 ms, total: 76 ms
-Wall time: 73.8 ms
-
-
-
- -
- -
Out[19]:
- - - - -
-$$2397916$$ -
- -
- -
-
- -
-
-
-
In [20]:
-
-
-
%time rank_and_offset(23000000000000)
-
- -
-
-
- -
-
- - -
- -
- - -
-
CPU times: user 308 ms, sys: 0 ns, total: 308 ms
-Wall time: 306 ms
-
-
-
- -
- -
Out[20]:
- - - - -
-$$\left ( 2397916, \quad 223606\right )$$ -
- -
- -
-
- -
-
-
-
-
-

After finding the rank you would still have to find the actual value of the rank's first corner and subtract it (plus 2) from the number and compute the offset as above and then the final output, but this overhead is partially shared by the other method, and overshadowed by the time it (the other iterative method) would take for really big inputs.

-

The fun thing to do here would be to graph the actual runtime of both methods against each other to find the trade-off point.

- -
-
-
-
-
-
-
-

It took me a second to realize I could do this...

Sympy is a symbolic math library, and it supports symbolic manipulation of equations. I can put in $y$ (instead of a value) and ask it to solve for $k$.

- -
-
-
-
-
-
In [21]:
-
-
-
y = symbols('y')
-
- -
-
-
- -
-
-
-
In [22]:
-
-
-
g, f = solve(E - y, k)
-
- -
-
-
- -
-
-
-
-
-

The equation is quadratic so there are two roots, we are interested in the greater one...

- -
-
-
-
-
-
In [23]:
-
-
-
g
-
- -
-
-
- -
-
- - -
- -
Out[23]:
- - - - -
-$$- \frac{1}{2} \sqrt{y - 1} - \frac{1}{2}$$ -
- -
- -
-
- -
-
-
-
In [24]:
-
-
-
f
-
- -
-
-
- -
-
- - -
- -
Out[24]:
- - - - -
-$$\frac{1}{2} \sqrt{y - 1} - \frac{1}{2}$$ -
- -
- -
-
- -
-
-
-
-
-

Now we can take the floor(), add 1, and lambdify() the equation to get a Python function that calculates the rank directly.

- -
-
-
-
-
-
In [25]:
-
-
-
floor(f) + 1
-
- -
-
-
- -
-
- - -
- -
Out[25]:
- - - - -
-$$\lfloor{\frac{1}{2} \sqrt{y - 1} - \frac{1}{2}}\rfloor + 1$$ -
- -
- -
-
- -
-
-
-
In [26]:
-
-
-
F = lambdify(y, floor(f) + 1)
-
- -
-
-
- -
-
-
-
In [27]:
-
-
-
for n in (9, 10, 25, 26, 49, 50):
-    print n, int(F(n))
-
- -
-
-
- -
-
- - -
- -
- - -
-
9 1
-10 2
-25 2
-26 3
-49 3
-50 4
-
-
-
- -
-
- -
-
-
-
-
-

It's pretty fast.

- -
-
-
-
-
-
In [28]:
-
-
-
%time int(F(23000000000000))  # The clear winner.
-
- -
-
-
- -
-
- - -
- -
- - -
-
CPU times: user 0 ns, sys: 0 ns, total: 0 ns
-Wall time: 11.9 µs
-
-
-
- -
- -
Out[28]:
- - - - -
-$$2397916$$ -
- -
- -
-
- -
-
-
-
-
-

Knowing the equation we could write our own function manually, but the speed is no better.

- -
-
-
-
-
-
In [29]:
-
-
-
from math import floor as mfloor, sqrt
-
-def mrank_of(n):
-    return int(mfloor(sqrt(23000000000000 - 1) / 2 - 0.5) + 1)
-
- -
-
-
- -
-
-
-
In [30]:
-
-
-
%time mrank_of(23000000000000)
-
- -
-
-
- -
-
- - -
- -
- - -
-
CPU times: user 0 ns, sys: 0 ns, total: 0 ns
-Wall time: 12.9 µs
-
-
-
- -
- -
Out[30]:
- - - - -
-$$2397916$$ -
- -
- -
-
- -
-
-
-
-
-

Given $n$ and a rank, compute the offset.

Now that we have a fast way to get the rank, we still need to use it to compute the offset into a pyramid row.

- -
-
-
-
-
-
In [31]:
-
-
-
def offset_of(n, k):
-    return (n - 2 + 4 * k * (k - 1)) % (2 * k)
-
- -
-
-
- -
-
-
-
-
-

(Note the sneaky way the sign changes from $k(k + 1)$ to $k(k - 1)$. This is because we want to subract the $(k - 1)$th rank's total places (its own and those of lesser rank) from our $n$ of rank $k$. Substituting $k - 1$ for $k$ in $k(k + 1)$ gives $(k - 1)(k - 1 + 1)$, which of course simplifies to $k(k - 1)$.)

- -
-
-
-
-
-
In [32]:
-
-
-
offset_of(23000000000000, 2397916)
-
- -
-
-
- -
-
- - -
- -
Out[32]:
- - - - -
-$$223606$$ -
- -
- -
-
- -
-
-
-
-
-

So, we can compute the rank, then the offset, then the row value.

- -
-
-
-
-
-
In [33]:
-
-
-
def rank_of(n):
-    return int(mfloor(sqrt(n - 1) / 2 - 0.5) + 1)
-
-
-def offset_of(n, k):
-    return (n - 2 + 4 * k * (k - 1)) % (2 * k)
-
-
-def row_value(k, i):
-    return abs(i - (k - 1)) + k
-
-
-def aoc20173(n):
-    k = rank_of(n)
-    i = offset_of(n, k)
-    return row_value(k, i)
-
- -
-
-
- -
-
-
-
In [34]:
-
-
-
aoc20173(23)
-
- -
-
-
- -
-
- - -
- -
Out[34]:
- - - - -
-$$2$$ -
- -
- -
-
- -
-
-
-
In [35]:
-
-
-
aoc20173(23000)
-
- -
-
-
- -
-
- - -
- -
Out[35]:
- - - - -
-$$105$$ -
- -
- -
-
- -
-
-
-
In [36]:
-
-
-
aoc20173(23000000000000)
-
- -
-
-
- -
-
- - -
- -
Out[36]:
- - - - -
-$$4572225$$ -
- -
- -
-
- -
-
-
-
In [37]:
-
-
-
%time aoc20173(23000000000000000000000000)  # Fast for large values.
-
- -
-
-
- -
-
- - -
- -
- - -
-
CPU times: user 0 ns, sys: 0 ns, total: 0 ns
-Wall time: 20 µs
-
-
-
- -
- -
Out[37]:
- - - - -
-$$2690062495969$$ -
- -
- -
-
- -
-
-
-
-
-

A Joy Version

At this point I feel confident that I can implement a concise version of this code in Joy. ;-)

- -
-
-
-
-
-
In [38]:
-
-
-
from notebook_preamble import J, V, define
-
- -
-
-
- -
-
-
-
-
-

rank_of

-
   n rank_of
----------------
-      k
-
-
-

The translation is straightforward.

- -
int(floor(sqrt(n - 1) / 2 - 0.5) + 1)
-
-rank_of == -- sqrt 2 / 0.5 - floor ++
- -
-
-
-
-
-
In [39]:
-
-
-
define('rank_of == -- sqrt 2 / 0.5 - floor ++')
-
- -
-
-
- -
-
-
-
-
-

offset_of

-
   n k offset_of
--------------------
-         i
-
-(n - 2 + 4 * k * (k - 1)) % (2 * k)
-
-
-

A little tricky...

- -
n k dup 2 *
-n k k 2 *
-n k k*2 [Q] dip %
-n k Q k*2 %
-
-n k dup --
-n k k --
-n k k-1 4 * * 2 + -
-n k*k-1*4     2 + -
-n k*k-1*4+2       -
-n-k*k-1*4+2
-
-n-k*k-1*4+2 k*2 %
-n-k*k-1*4+2%k*2
-
-
-

Ergo:

- -
offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %
- -
-
-
-
-
-
In [40]:
-
-
-
define('offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %')
-
- -
-
-
- -
-
-
-
-
-

row_value

-
   k i row_value
--------------------
-        n
-
-abs(i - (k - 1)) + k
-
-k i over -- - abs +
-k i k    -- - abs +
-k i k-1     - abs +
-k i-k-1       abs +
-k |i-k-1|         +
-k+|i-k-1|
- -
-
-
-
-
-
In [41]:
-
-
-
define('row_value == over -- - abs +')
-
- -
-
-
- -
-
-
-
-
-

aoc2017.3

-
   n aoc2017.3
------------------
-        m
-
-n dup rank_of
-n k [offset_of] dupdip
-n k offset_of k
-i             k swap row_value
-k i row_value
-m
- -
-
-
-
-
-
In [42]:
-
-
-
define('aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value')
-
- -
-
-
- -
-
-
-
In [43]:
-
-
-
J('23 aoc2017.3')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
In [44]:
-
-
-
J('23000 aoc2017.3')
-
- -
-
-
- -
-
- - -
- -
- - -
-
105
-
-
-
- -
-
- -
-
-
-
In [45]:
-
-
-
V('23000000000000 aoc2017.3')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                    . 23000000000000 aoc2017.3
-                                     23000000000000 . aoc2017.3
-                                     23000000000000 . dup rank_of [offset_of] dupdip swap row_value
-                      23000000000000 23000000000000 . rank_of [offset_of] dupdip swap row_value
-                      23000000000000 23000000000000 . -- sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value
-                      23000000000000 22999999999999 . sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value
-                   23000000000000 4795831.523312615 . 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value
-                 23000000000000 4795831.523312615 2 . / 0.5 - floor ++ [offset_of] dupdip swap row_value
-                  23000000000000 2397915.7616563076 . 0.5 - floor ++ [offset_of] dupdip swap row_value
-              23000000000000 2397915.7616563076 0.5 . - floor ++ [offset_of] dupdip swap row_value
-                  23000000000000 2397915.2616563076 . floor ++ [offset_of] dupdip swap row_value
-                             23000000000000 2397915 . ++ [offset_of] dupdip swap row_value
-                             23000000000000 2397916 . [offset_of] dupdip swap row_value
-                 23000000000000 2397916 [offset_of] . dupdip swap row_value
-                             23000000000000 2397916 . offset_of 2397916 swap row_value
-                             23000000000000 2397916 . dup 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value
-                     23000000000000 2397916 2397916 . 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value
-                   23000000000000 2397916 2397916 2 . * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value
-                     23000000000000 2397916 4795832 . [dup -- 4 * * 2 + -] dip % 2397916 swap row_value
-23000000000000 2397916 4795832 [dup -- 4 * * 2 + -] . dip % 2397916 swap row_value
-                             23000000000000 2397916 . dup -- 4 * * 2 + - 4795832 % 2397916 swap row_value
-                     23000000000000 2397916 2397916 . -- 4 * * 2 + - 4795832 % 2397916 swap row_value
-                     23000000000000 2397916 2397915 . 4 * * 2 + - 4795832 % 2397916 swap row_value
-                   23000000000000 2397916 2397915 4 . * * 2 + - 4795832 % 2397916 swap row_value
-                     23000000000000 2397916 9591660 . * 2 + - 4795832 % 2397916 swap row_value
-                      23000000000000 22999994980560 . 2 + - 4795832 % 2397916 swap row_value
-                    23000000000000 22999994980560 2 . + - 4795832 % 2397916 swap row_value
-                      23000000000000 22999994980562 . - 4795832 % 2397916 swap row_value
-                                            5019438 . 4795832 % 2397916 swap row_value
-                                    5019438 4795832 . % 2397916 swap row_value
-                                             223606 . 2397916 swap row_value
-                                     223606 2397916 . swap row_value
-                                     2397916 223606 . row_value
-                                     2397916 223606 . over -- - abs +
-                             2397916 223606 2397916 . -- - abs +
-                             2397916 223606 2397915 . - abs +
-                                   2397916 -2174309 . abs +
-                                    2397916 2174309 . +
-                                            4572225 . 
-
-
-
- -
-
- -
-
-
-
-
- -
  rank_of == -- sqrt 2 / 0.5 - floor ++
-offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %
-row_value == over -- - abs +
-
-aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value
- -
-
-
-
-
- - - - - - diff --git a/docs/Advent of Code 2017 December 3rd.ipynb b/docs/Advent of Code 2017 December 3rd.ipynb deleted file mode 100644 index cdb7d80..0000000 --- a/docs/Advent of Code 2017 December 3rd.ipynb +++ /dev/null @@ -1,1426 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Advent of Code 2017\n", - "\n", - "## December 3rd\n", - "\n", - "You come across an experimental new kind of memory stored on an infinite two-dimensional grid.\n", - "\n", - "Each square on the grid is allocated in a spiral pattern starting at a location marked 1 and then counting up while spiraling outward. For example, the first few squares are allocated like this:\n", - "\n", - " 17 16 15 14 13\n", - " 18 5 4 3 12\n", - " 19 6 1 2 11\n", - " 20 7 8 9 10\n", - " 21 22 23---> ...\n", - "\n", - "While this is very space-efficient (no squares are skipped), requested data must be carried back to square 1 (the location of the only access port for this memory system) by programs that can only move up, down, left, or right. They always take the shortest path: the Manhattan Distance between the location of the data and square 1.\n", - "\n", - "For example:\n", - "\n", - "* Data from square 1 is carried 0 steps, since it's at the access port.\n", - "* Data from square 12 is carried 3 steps, such as: down, left, left.\n", - "* Data from square 23 is carried only 2 steps: up twice.\n", - "* Data from square 1024 must be carried 31 steps.\n", - "\n", - "How many steps are required to carry the data from the square identified in your puzzle input all the way to the access port?" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Analysis\n", - "\n", - "I freely admit that I worked out the program I wanted to write using graph paper and some Python doodles. There's no point in trying to write a Joy program until I'm sure I understand the problem well enough.\n", - "\n", - "The first thing I did was to write a column of numbers from 1 to n (32 as it happens) and next to them the desired output number, to look for patterns directly:\n", - "\n", - " 1 0\n", - " 2 1\n", - " 3 2\n", - " 4 1\n", - " 5 2\n", - " 6 1\n", - " 7 2\n", - " 8 1\n", - " 9 2\n", - " 10 3\n", - " 11 2\n", - " 12 3\n", - " 13 4\n", - " 14 3\n", - " 15 2\n", - " 16 3\n", - " 17 4\n", - " 18 3\n", - " 19 2\n", - " 20 3\n", - " 21 4\n", - " 22 3\n", - " 23 2\n", - " 24 3\n", - " 25 4\n", - " 26 5\n", - " 27 4\n", - " 28 3\n", - " 29 4\n", - " 30 5\n", - " 31 6\n", - " 32 5" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "There are four groups repeating for a given \"rank\", then the pattern enlarges and four groups repeat again, etc.\n", - "\n", - " 1 2\n", - " 3 2 3 4\n", - " 5 4 3 4 5 6\n", - " 7 6 5 4 5 6 7 8\n", - " 9 8 7 6 5 6 7 8 9 10\n", - "\n", - "Four of this pyramid interlock to tile the plane extending from the initial \"1\" square.\n", - "\n", - "\n", - " 2 3 | 4 5 | 6 7 | 8 9\n", - " 10 11 12 13|14 15 16 17|18 19 20 21|22 23 24 25\n", - "\n", - "And so on." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We can figure out the pattern for a row of the pyramid at a given \"rank\" $k$:\n", - "\n", - "$2k - 1, 2k - 2, ..., k, k + 1, k + 2, ..., 2k$\n", - "\n", - "or\n", - "\n", - "$k + (k - 1), k + (k - 2), ..., k, k + 1, k + 2, ..., k + k$\n", - "\n", - "This shows that the series consists at each place of $k$ plus some number that begins at $k - 1$, decreases to zero, then increases to $k$. Each row has $2k$ members." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Let's figure out how, given an index into a row, we can calculate the value there. The index will be from 0 to $k - 1$. \n", - "\n", - " Let's look at an example, with $k = 4$:\n", - "\n", - " 0 1 2 3 4 5 6 7\n", - " 7 6 5 4 5 6 7 8" - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "k = 4" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Subtract $k$ from the index and take the absolute value:" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4 3 2 1 0 1 2 3\n" - ] - } - ], - "source": [ - "for n in range(2 * k):\n", - " print abs(n - k)," - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Not quite. Subtract $k - 1$ from the index and take the absolute value:" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 0 1 2 3 4\n" - ] - } - ], - "source": [ - "for n in range(2 * k):\n", - " print abs(n - (k - 1))," - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Great, now add $k$..." - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "7 6 5 4 5 6 7 8\n" - ] - } - ], - "source": [ - "for n in range(2 * k):\n", - " print abs(n - (k - 1)) + k," - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "So to write a function that can give us the value of a row at a given index:" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [], - "source": [ - "def row_value(k, i):\n", - " i %= (2 * k) # wrap the index at the row boundary.\n", - " return abs(i - (k - 1)) + k" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9 8 7 6 5 6 7 8 9 10\n" - ] - } - ], - "source": [ - "k = 5\n", - "for i in range(2 * k):\n", - " print row_value(k, i)," - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "(I'm leaving out details of how I figured this all out and just giving the relevent bits. It took a little while to zero in of the aspects of the pattern that were important for the task.)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Finding the rank and offset of a number.\n", - "Now that we can compute the desired output value for a given rank and the offset (index) into that rank, we need to determine how to find the rank and offset of a number.\n", - "\n", - "The rank is easy to find by iteratively stripping off the amount already covered by previous ranks until you find the one that brackets the target number. Because each row is $2k$ places and there are $4$ per rank each rank contains $8k$ places. Counting the initial square we have:\n", - "\n", - "$corner_k = 1 + \\sum_{n=1}^k 8n$\n", - "\n", - "I'm not mathematically sophisticated enough to turn this directly into a formula (but Sympy is, see below.) I'm going to write a simple Python function to iterate and search:" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [], - "source": [ - "def rank_and_offset(n):\n", - " assert n >= 2 # Guard the domain.\n", - " n -= 2 # Subtract two,\n", - " # one for the initial square,\n", - " # and one because we are counting from 1 instead of 0.\n", - " k = 1\n", - " while True:\n", - " m = 8 * k # The number of places total in this rank, 4(2k).\n", - " if n < m:\n", - " return k, n % (2 * k)\n", - " n -= m # Remove this rank's worth.\n", - " k += 1" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2 (1, 0)\n", - "3 (1, 1)\n", - "4 (1, 0)\n", - "5 (1, 1)\n", - "6 (1, 0)\n", - "7 (1, 1)\n", - "8 (1, 0)\n", - "9 (1, 1)\n", - "10 (2, 0)\n", - "11 (2, 1)\n", - "12 (2, 2)\n", - "13 (2, 3)\n", - "14 (2, 0)\n", - "15 (2, 1)\n", - "16 (2, 2)\n", - "17 (2, 3)\n", - "18 (2, 0)\n", - "19 (2, 1)\n", - "20 (2, 2)\n", - "21 (2, 3)\n", - "22 (2, 0)\n", - "23 (2, 1)\n", - "24 (2, 2)\n", - "25 (2, 3)\n", - "26 (3, 0)\n", - "27 (3, 1)\n", - "28 (3, 2)\n", - "29 (3, 3)\n", - "30 (3, 4)\n", - "31 (3, 5)\n", - "32 (3, 0)\n", - "33 (3, 1)\n", - "34 (3, 2)\n", - "35 (3, 3)\n", - "36 (3, 4)\n", - "37 (3, 5)\n", - "38 (3, 0)\n", - "39 (3, 1)\n", - "40 (3, 2)\n", - "41 (3, 3)\n", - "42 (3, 4)\n", - "43 (3, 5)\n", - "44 (3, 0)\n", - "45 (3, 1)\n", - "46 (3, 2)\n", - "47 (3, 3)\n", - "48 (3, 4)\n", - "49 (3, 5)\n", - "50 (4, 0)\n" - ] - } - ], - "source": [ - "for n in range(2, 51):\n", - " print n, rank_and_offset(n)" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2 1\n", - "3 2\n", - "4 1\n", - "5 2\n", - "6 1\n", - "7 2\n", - "8 1\n", - "9 2\n", - "10 3\n", - "11 2\n", - "12 3\n", - "13 4\n", - "14 3\n", - "15 2\n", - "16 3\n", - "17 4\n", - "18 3\n", - "19 2\n", - "20 3\n", - "21 4\n", - "22 3\n", - "23 2\n", - "24 3\n", - "25 4\n", - "26 5\n", - "27 4\n", - "28 3\n", - "29 4\n", - "30 5\n", - "31 6\n", - "32 5\n", - "33 4\n", - "34 3\n", - "35 4\n", - "36 5\n", - "37 6\n", - "38 5\n", - "39 4\n", - "40 3\n", - "41 4\n", - "42 5\n", - "43 6\n", - "44 5\n", - "45 4\n", - "46 3\n", - "47 4\n", - "48 5\n", - "49 6\n", - "50 7\n" - ] - } - ], - "source": [ - "for n in range(2, 51):\n", - " k, i = rank_and_offset(n)\n", - " print n, row_value(k, i)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Putting it all together" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [], - "source": [ - "def row_value(k, i):\n", - " return abs(i - (k - 1)) + k\n", - "\n", - "\n", - "def rank_and_offset(n):\n", - " n -= 2 # Subtract two,\n", - " # one for the initial square,\n", - " # and one because we are counting from 1 instead of 0.\n", - " k = 1\n", - " while True:\n", - " m = 8 * k # The number of places total in this rank, 4(2k).\n", - " if n < m:\n", - " return k, n % (2 * k)\n", - " n -= m # Remove this rank's worth.\n", - " k += 1\n", - "\n", - "\n", - "def aoc20173(n):\n", - " if n <= 1:\n", - " return 0\n", - " k, i = rank_and_offset(n)\n", - " return row_value(k, i)" - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "data": { - "text/plain": [ - "2" - ] - }, - "execution_count": 11, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "aoc20173(23)" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "data": { - "text/plain": [ - "105" - ] - }, - "execution_count": 12, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "aoc20173(23000)" - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "data": { - "text/plain": [ - "4572225" - ] - }, - "execution_count": 13, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "aoc20173(23000000000000)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Sympy to the Rescue\n", - "### Find the rank for large numbers\n", - "Using e.g. Sympy we can find the rank directly by solving for the roots of an equation. For large numbers this will (eventually) be faster than iterating as `rank_and_offset()` does." - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [], - "source": [ - "from sympy import floor, lambdify, solve, symbols\n", - "from sympy import init_printing\n", - "init_printing() " - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [], - "source": [ - "k = symbols('k')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Since\n", - "\n", - "$1 + 2 + 3 + ... + N = \\frac{N(N + 1)}{2}$\n", - "\n", - "and\n", - "\n", - "$\\sum_{n=1}^k 8n = 8(\\sum_{n=1}^k n) = 8\\frac{k(k + 1)}{2}$\n", - "\n", - "We want:" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAHwAAAAUBAMAAAC9l0S6AAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAMpndu3bvImbNiRBU\nq0Qb3U6NAAAACXBIWXMAAA7EAAAOxAGVKw4bAAACAElEQVQ4EW1UzWsTQRx9NB+bzSZt6D/gHvRS\nKOZQWhAK6UHrsRShhyIW2rvBiznp0ltPxdJLDi2h9aIXc7C0emlA6k38wKKXYsA/IFZEhITG95vZ\nj5klD3bmvff7vczsMBvARsOWiSrUE26zSeD1uracGrw7Vbscqm9p99H1BWXNcNzRRZdruL7mxvi+\nDbwxtFDvE151Oec2OAz4EJt8JjrCBGd68r78YLy4pFXkltvIr9Fq7ALjfV2b49Rjr0YYBx7Q8tZs\nN19F+ZJWi/FiVdUcmQ7Dtnh1Hcd+6Ic/6vZVvFBn3PVL9yt8D58tOzj7rDut1XFgx6ky3PMRGD/t\nrPQCIMvHG+Se/IOCHd/SZvTuVL0W9y7xj0ftE+pMByj1V72AnLDj77SZuJhnd0XiN31Vy3eBsd+6\n7UWzOdts7ikhR4drQk13zAfeQuLz95akKPHM+W2hAnt1FTfdZYoPFxd/z70r50r6ZfOn3add4YQd\n/6nN2C35eCzWBgq/vEGRLBsA2zzHFhTseProeNdXpO0PyjVcSrzoA18xUWmRE3Z8SpuR69x6OS3X\n5PnwezbA8irpOPVd5G7ISRFRfPrhXgA8U17susPhUOIm5NImiOLKUTdSmOUmzcLkk0lwnFDjk7Fc\ns4NnV7e1odIfrFGKqVOLaZospo1RujHKFG/0n9V/fdOG1o/ONcUAAAAASUVORK5CYII=\n", - "text/latex": [ - "$$4 k \\left(k + 1\\right) + 2$$" - ], - "text/plain": [ - "4⋅k⋅(k + 1) + 2" - ] - }, - "execution_count": 16, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "E = 2 + 8 * k * (k + 1) / 2 # For the reason for adding 2 see above.\n", - "\n", - "E" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We can write a function to solve for $k$ given some $n$..." - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": {}, - "outputs": [], - "source": [ - "def rank_of(n):\n", - " return floor(max(solve(E - n, k))) + 1" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "First `solve()` for $E - n = 0$ which has two solutions (because the equation is quadratic so it has two roots) and since we only care about the larger one we use `max()` to select it. It will generally not be a nice integer (unless $n$ is the number of an end-corner of a rank) so we take the `floor()` and add 1 to get the integer rank of $n$. (Taking the `ceiling()` gives off-by-one errors on the rank boundaries. I don't know why. I'm basically like a monkey doing math here.) =-D\n", - "\n", - "It gives correct answers:" - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9 1\n", - "10 2\n", - "25 2\n", - "26 3\n", - "49 3\n", - "50 4\n" - ] - } - ], - "source": [ - "for n in (9, 10, 25, 26, 49, 50):\n", - " print n, rank_of(n)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "And it runs much faster (at least for large numbers):" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "CPU times: user 68 ms, sys: 8 ms, total: 76 ms\n", - "Wall time: 73.8 ms\n" - ] - }, - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAEcAAAAPBAMAAABElc8tAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAIpm7MhCriUTv3c12\nVGZoascqAAAACXBIWXMAAA7EAAAOxAGVKw4bAAABkUlEQVQoFY2QPUscURSGn4l7d4y7q6ONxGqZ\ngEbSCFZWTmfpYCHEFK6CRdIoJmQaYacNBBJJ4wcqKNhYaKNYBFeCnYKLjdhNK4j5NrKbOHlnxx+Q\nAzP33nOf+77nHCy338MKXlUxPW8cMps9QcBIMMF92HOvYRT7lg4KdzyLrHla4zi+Mas8cuDCB7PP\nU5iCRU6r1HgBkzzQZSn7gWzRTE4LairSD0sw7b0NTZ06lLHB9tp2sL/CqaD3egQVXxCyMz+U1o53\njPeR/5lCA0o0YlsvxmZYllKoRB8PpXSbQvWhz0mO5t/Que7Li0oktyjxyt01IFOPWBFDS0k/e4Hc\nYaFchXGdPnH+N4Vin14Z4epTiz5XR2UPjnVoPRm6r6kGX0LIF6EdBiVC0vSGVsj+SmvaEhTBGZYj\n0Qa0p+ndNKBcKYU0PClliuSdj7DtXDqZb5D5Lrd5hp0UGlZN0BXMvuSawh+O/ecSLgjK75oD6SXD\nzM4YdVeJ4xrN7uMQ232iGyvpeNYNoXttL9K221PiP+If4oN7f8ioQFsAAAAASUVORK5CYII=\n", - "text/latex": [ - "$$2397916$$" - ], - "text/plain": [ - "2397916" - ] - }, - "execution_count": 19, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "%time rank_of(23000000000000) # Compare runtime with rank_and_offset()!" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "CPU times: user 308 ms, sys: 0 ns, total: 308 ms\n", - "Wall time: 306 ms\n" - ] - }, - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAALAAAAAUBAMAAADfFKqVAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAIma7zZnddlTvRIky\nEKtZsEGBAAAACXBIWXMAAA7EAAAOxAGVKw4bAAADLElEQVQ4Ea2VT2hcVRjFf28yfzNzZ6ZIC9LN\nQwpSXDQahCpiYzdCqWagnYUGw4h/EAo1QkMXin0b3biYqYqkwcJsrLiQBHQMMmJm46qLeUJUumlS\nQaG0UhvHWGrT6bn3PYszuBih3+Lcf+ee993zvncfeD73PBJlSd4HO488Abvb++GH9iUKx2fabczM\nt3bVRfvNTty723jVyQ4RtL8IIL/yjbY8ZHmWfUntU5gNVptehbpv3uf+cqLf79/mgu+dhuxZMdaa\nqSk1A3GR/E0c7CS7iTnEUZKBeTFmr0GiQjEk18jcoFQrNihWUsp0g8vwCxdntyX3KGMTA6oa/AZn\nIjgVsMVYhUn2wpcxOz9HukyuRvHW+CLrU6Up8r/ndbAOPViFjITHrw+ravwRXOs4+KxpeixZ256E\nehixTYNdkNyWsBbq/voEGdv7FPMHnOo44bGGZoZjOpSwA/m1yWN2/TYsBTH7EPNuS1qZmWPklPFN\nTejkHyrjphMuHV553pGG4PVQExZ+XKZ3fr5p/pTwXMxu8YijLy3jffWCfCC5KSd858O074TXD5IL\nHGsAxv/W0MLuV0LT81nw1O8ux+w9vObYxy1+3eRp3rsB6xok57KrQSS8TcoWx1CkNzThIL9o+iHP\nfa+MJRyx32XR8lMVi7mzJE6el8cn7OjBt1Yjj0s1EtafoajasQPOhFuw73MJy4qI3Y2E58ErM6Zk\nKcrtlyKNa6HLOD1FQv4MRcbmYmEHHAhelrCvl1cPYnbXWZGtsKO0HQknNzBi2HhWO/UYFfd/ZPyO\nTcWCXDgQqOr3NScFYcw+517ed/BGboL09cRpumUKOhN7ywXVrxUuyLWGe9K/oFAhU3bwgUqj3JXH\n9gM5+g97Dy25cKw9W0v41Ocyz5iDqksrfCJc8yNhrnAh0EcwELvarV9x8ADZvygumwXSgfkYx4YZ\nzqkAdDnU+KT6OLSqTT1oQRr5qoo3dbn3s+1ehVfDAeHpfn8LB+PVI9rTmu1gVt7uxGwO2096pMiO\nyIvEPNVGZSRddIP8j9AlxMOj8X8ajRaz1tTqoh8l/FFIdzk2W88X3OPQr+kOAx0PXfbg7EwAAAAA\nSUVORK5CYII=\n", - "text/latex": [ - "$$\\left ( 2397916, \\quad 223606\\right )$$" - ], - "text/plain": [ - "(2397916, 223606)" - ] - }, - "execution_count": 20, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "%time rank_and_offset(23000000000000)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "After finding the rank you would still have to find the actual value of the rank's first corner and subtract it (plus 2) from the number and compute the offset as above and then the final output, but this overhead is partially shared by the other method, and overshadowed by the time it (the other iterative method) would take for really big inputs.\n", - "\n", - "The fun thing to do here would be to graph the actual runtime of both methods against each other to find the trade-off point." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### It took me a second to realize I could do this...\n", - "Sympy is a *symbolic* math library, and it supports symbolic manipulation of equations. I can put in $y$ (instead of a value) and ask it to solve for $k$." - ] - }, - { - "cell_type": "code", - "execution_count": 21, - "metadata": {}, - "outputs": [], - "source": [ - "y = symbols('y')" - ] - }, - { - "cell_type": "code", - "execution_count": 22, - "metadata": {}, - "outputs": [], - "source": [ - "g, f = solve(E - y, k)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The equation is quadratic so there are two roots, we are interested in the greater one..." - ] - }, - { - "cell_type": "code", - "execution_count": 23, - "metadata": {}, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAIkAAAAqBAMAAAB1gmW6AAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAEM3dMlTvq5l2ZiK7\niUTiBfEGAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAB6klEQVRIDe2Uv0vDQBTHv9eiTU2pRQdxsqLo\n4CI6CEKxo5tObqKOThYHEUEUlyKIOklFwf4J4iQ42EEQt86C6Ca62IogqKh3lzQ/nkm8BEdvuL73\nve/ny/WlDfDXayoTJdFNseW1CCk/qaMIKQClaK/2/ShF+/8UYwLuuex8eS86LTdFnpleoXafPjAl\ncedDUTkw5YS6/XqSUlzoL9vWbbsMrNwUsbIsESK12qQX1jTnpfpr7V5HHcW6l+yvXXseJcOlsMG/\nSEmWgc5N6GQOIe8S51epTiFZc19JPYUJcB/QJzeQqiimtA2L1QvI/14Nek6AfCwM82jd5bXlAIy7\nsB6BDOWF0aRE6VyPfbxrqfIt/Y6JvPOokeLWvLuZMhDP8DMtiz1iUZ9L8yAwLehUAZeRU5KfQLeg\ntUr6LXIK+0DTuqDZaundnaItPa+4lZ/d6daFFHeOY8fGKZ/Mr6tBmUZWwO2dqM+r91JaRJfsZeO3\nWZRpSGTQPCvqVG1ASqO4kp+Bm0WZLv5sEi+iTr8WpPRQysvPwM2iTFesbqZgTIFuRNtUQ0HceH0c\nWoJSYVKW96lqlSEKSo2EYG0robR1+0i9olRJHXU4CcV/92eOU8WSUuPAgSLqsBFKz90U+Ush5KJU\njL/8wqcY1Dcp15UsZrvPlwAAAABJRU5ErkJggg==\n", - "text/latex": [ - "$$- \\frac{1}{2} \\sqrt{y - 1} - \\frac{1}{2}$$" - ], - "text/plain": [ - " _______ \n", - " ╲╱ y - 1 1\n", - "- ───────── - ─\n", - " 2 2" - ] - }, - "execution_count": 23, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "g" - ] - }, - { - "cell_type": "code", - "execution_count": 24, - "metadata": {}, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAHgAAAAqBAMAAACKDIIdAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAVO8Qq5l2zWYiuzKJ\nRN0MreaOAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAB9ElEQVRIDe2Vu0vDUBTGvzRNSrSNILgX3TVD\nwU2LD3DRVqgIOthF0akdXETQbi4OVXDQoTg46aCLexedCvY/aEHBRVQQfOCj3nOrmCa3ubGuHmjP\nyXe+3z1tb24K/C06rVZ4pYdR6miiFTiWeuAjM63A0P/h322Y8AfTauK4d6wthPccpmaXQni8mduh\ni2Aj6zA1u6zDqb7l3I9DK//UXpU29DTm6ve7lF8Ik0Kvv4OnVgWw34MXzglgwN/BGxCyPuFF9nSY\nT2PbalzE3+QqEFaiyDSy8sk0TE8DW1oWhz5hfgzugUKRASZ7WYE0HllW125ZXJ+w8mtyPwm3qyR0\ncIwqishGlL1vUlnJt79StoXsOyvPzHxJwDT0KGVbyGD0AkqRgAO0xSnbQgpnygjxHZpBJWcDqZTC\ng/vo4kzsfC7fCDcePHtvZ+aIX2ovWPnSp+19cW1MHbJ9UOO4KJPBeIvEKQez6jtl74ghzFxBC4Eo\nNx6H+Kc1c21pb5C6w0A3EKgiWN/WyghnIguzcpb2JnGC0MM3bDpvDa811i2CWZj1Pzx938vt7t1Z\npFWK7o5cibxxz5XcKXCYcRK1pKAll6a4ZV5uFDh0PlJJYlfQlEldMPLAKbAkc7r77UnoeRg3pVTV\n3ZQphdLZBBBiD5QW4PVa7QOfZ0qXehvwRMIAAAAASUVORK5CYII=\n", - "text/latex": [ - "$$\\frac{1}{2} \\sqrt{y - 1} - \\frac{1}{2}$$" - ], - "text/plain": [ - " _______ \n", - "╲╱ y - 1 1\n", - "───────── - ─\n", - " 2 2" - ] - }, - "execution_count": 24, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "f" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we can take the `floor()`, add 1, and `lambdify()` the equation to get a Python function that calculates the rank directly." - ] - }, - { - "cell_type": "code", - "execution_count": 25, - "metadata": {}, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAK0AAAAqBAMAAAAzNMYQAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAEGYiq+/dVJl2zbsy\niUT7WiApAAAACXBIWXMAAA7EAAAOxAGVKw4bAAACUUlEQVRIDe2Uv2/TQBTHv1YgsdMmRCUwdCEz\nElIHCANLqAAx0TLASpEgAwxMSGXrUImqVCJigimRqBgipHZg60D+BEZAQup/EH5ISCBKuPfsc8/2\nw2fHYuOk5L177/v9+Hw+G/ino3J9GrzV1Vz/MgU3g8ubhgu7y66Q7sfusiv+c6Ud8Gv23Ysq3Ik8\nPscuEXXFmjyNKi5IEqEWdQmC2Em8JkmEWhp3jvURRWkgMKRS4PKk3lkqupd/Lh423f3DPC3Trqok\nYm60MR+dWmdZuY9F0sOGWFbFBJekyfU6KwLAubpk5T7yfb40ya21BC7Qz8r1pUnuSRFbnPsMcJ73\ncC62vsLrXQFqlWX0Y8suwqUlej3gvDvAXnHuMf7MAO13ilVWv8bRHn6o6LzqqnFvpNJgf+ep0H1N\nBe3yz9nH4fDucLhNDZYaz61+elkVz1BnvDD7i6IxCuxD5avi3CbWJjy6hjkKcHETqNBe4A1mOiZU\n5UW4/X1UG8R7gnGLojGKcE/tYpVRzQ9PFwymStdvbbeilXCmvw/Be+xL+bmVNvZGJHO/4WUg3wxi\nStCuOJctzG2i9ptmpYN6h+KRgcNzyv8+tEtzj5tS5l4EbnDxbZVvv9ya6ZkiOdcuzY2omKvOwdKI\nyuNL3Ky/2OKY/qddIvdE9w6w0wi45fjbkEb2Xe3u/TTRAz5f3m6aJtnzXcl6WKkfhGmOxO4qd3Lg\nQqndtRFq8yRWl7eWB6e1dtcqSnxwtSNbtLpm1+Dl59pd7U/vr2Rboqmyu3Ymk++mI1ue5voDRu6s\n5n/E50UAAAAASUVORK5CYII=\n", - "text/latex": [ - "$$\\lfloor{\\frac{1}{2} \\sqrt{y - 1} - \\frac{1}{2}}\\rfloor + 1$$" - ], - "text/plain": [ - "⎢ _______ ⎥ \n", - "⎢╲╱ y - 1 1⎥ \n", - "⎢───────── - ─⎥ + 1\n", - "⎣ 2 2⎦ " - ] - }, - "execution_count": 25, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "floor(f) + 1" - ] - }, - { - "cell_type": "code", - "execution_count": 26, - "metadata": {}, - "outputs": [], - "source": [ - "F = lambdify(y, floor(f) + 1)" - ] - }, - { - "cell_type": "code", - "execution_count": 27, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "9 1\n", - "10 2\n", - "25 2\n", - "26 3\n", - "49 3\n", - "50 4\n" - ] - } - ], - "source": [ - "for n in (9, 10, 25, 26, 49, 50):\n", - " print n, int(F(n))" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "It's pretty fast." - ] - }, - { - "cell_type": "code", - "execution_count": 28, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "CPU times: user 0 ns, sys: 0 ns, total: 0 ns\n", - "Wall time: 11.9 µs\n" - ] - }, - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAEcAAAAPBAMAAABElc8tAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAIpm7MhCriUTv3c12\nVGZoascqAAAACXBIWXMAAA7EAAAOxAGVKw4bAAABkUlEQVQoFY2QPUscURSGn4l7d4y7q6ONxGqZ\ngEbSCFZWTmfpYCHEFK6CRdIoJmQaYacNBBJJ4wcqKNhYaKNYBFeCnYKLjdhNK4j5NrKbOHlnxx+Q\nAzP33nOf+77nHCy338MKXlUxPW8cMps9QcBIMMF92HOvYRT7lg4KdzyLrHla4zi+Mas8cuDCB7PP\nU5iCRU6r1HgBkzzQZSn7gWzRTE4LairSD0sw7b0NTZ06lLHB9tp2sL/CqaD3egQVXxCyMz+U1o53\njPeR/5lCA0o0YlsvxmZYllKoRB8PpXSbQvWhz0mO5t/Que7Li0oktyjxyt01IFOPWBFDS0k/e4Hc\nYaFchXGdPnH+N4Vin14Z4epTiz5XR2UPjnVoPRm6r6kGX0LIF6EdBiVC0vSGVsj+SmvaEhTBGZYj\n0Qa0p+ndNKBcKYU0PClliuSdj7DtXDqZb5D5Lrd5hp0UGlZN0BXMvuSawh+O/ecSLgjK75oD6SXD\nzM4YdVeJ4xrN7uMQ232iGyvpeNYNoXttL9K221PiP+If4oN7f8ioQFsAAAAASUVORK5CYII=\n", - "text/latex": [ - "$$2397916$$" - ], - "text/plain": [ - "2397916" - ] - }, - "execution_count": 28, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "%time int(F(23000000000000)) # The clear winner." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Knowing the equation we could write our own function manually, but the speed is no better." - ] - }, - { - "cell_type": "code", - "execution_count": 29, - "metadata": {}, - "outputs": [], - "source": [ - "from math import floor as mfloor, sqrt\n", - "\n", - "def mrank_of(n):\n", - " return int(mfloor(sqrt(23000000000000 - 1) / 2 - 0.5) + 1)" - ] - }, - { - "cell_type": "code", - "execution_count": 30, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "CPU times: user 0 ns, sys: 0 ns, total: 0 ns\n", - "Wall time: 12.9 µs\n" - ] - }, - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAEcAAAAPBAMAAABElc8tAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAIpm7MhCriUTv3c12\nVGZoascqAAAACXBIWXMAAA7EAAAOxAGVKw4bAAABkUlEQVQoFY2QPUscURSGn4l7d4y7q6ONxGqZ\ngEbSCFZWTmfpYCHEFK6CRdIoJmQaYacNBBJJ4wcqKNhYaKNYBFeCnYKLjdhNK4j5NrKbOHlnxx+Q\nAzP33nOf+77nHCy338MKXlUxPW8cMps9QcBIMMF92HOvYRT7lg4KdzyLrHla4zi+Mas8cuDCB7PP\nU5iCRU6r1HgBkzzQZSn7gWzRTE4LairSD0sw7b0NTZ06lLHB9tp2sL/CqaD3egQVXxCyMz+U1o53\njPeR/5lCA0o0YlsvxmZYllKoRB8PpXSbQvWhz0mO5t/Que7Li0oktyjxyt01IFOPWBFDS0k/e4Hc\nYaFchXGdPnH+N4Vin14Z4epTiz5XR2UPjnVoPRm6r6kGX0LIF6EdBiVC0vSGVsj+SmvaEhTBGZYj\n0Qa0p+ndNKBcKYU0PClliuSdj7DtXDqZb5D5Lrd5hp0UGlZN0BXMvuSawh+O/ecSLgjK75oD6SXD\nzM4YdVeJ4xrN7uMQ232iGyvpeNYNoXttL9K221PiP+If4oN7f8ioQFsAAAAASUVORK5CYII=\n", - "text/latex": [ - "$$2397916$$" - ], - "text/plain": [ - "2397916" - ] - }, - "execution_count": 30, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "%time mrank_of(23000000000000)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Given $n$ and a rank, compute the offset.\n", - "\n", - "Now that we have a fast way to get the rank, we still need to use it to compute the offset into a pyramid row." - ] - }, - { - "cell_type": "code", - "execution_count": 31, - "metadata": {}, - "outputs": [], - "source": [ - "def offset_of(n, k):\n", - " return (n - 2 + 4 * k * (k - 1)) % (2 * k)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "(Note the sneaky way the sign changes from $k(k + 1)$ to $k(k - 1)$. This is because we want to subract the $(k - 1)$th rank's total places (its own and those of lesser rank) from our $n$ of rank $k$. Substituting $k - 1$ for $k$ in $k(k + 1)$ gives $(k - 1)(k - 1 + 1)$, which of course simplifies to $k(k - 1)$.)" - ] - }, - { - "cell_type": "code", - "execution_count": 32, - "metadata": {}, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAADsAAAAOBAMAAABjvHmeAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAIpm7MhCriUTv3c12\nVGZoascqAAAACXBIWXMAAA7EAAAOxAGVKw4bAAABIElEQVQYGTWQoU8DMRSHvwuULWNLDgwJ6jIS\nCJlcQoLaOeSKQaAwCDAsg2WCiTMI1AQIRjIBFoHFjSCwNPwDmyMYSBBAdoTjtR2iX76+X/r6WoJy\nNcajfWgg1zlCrbzE3tgi9+0xT+kXdUeFWaOuvLELPY8nw5ipiCqvcOyNSziIHU4TldINgTUYamcM\ntMQO2ObrkvIJXePM7m71BNsN0o2HRH1IfG/NpvmvCRautUpH9AMp1FvWbFzY+UfuQmWa1U05XW9Z\ns23Lsjzo6TG8n7jm1hIoRpJazEHN3EhxJKMNvcEzQegg3Wpmz56pCrQzpiOKocOZvCGsy432Wyo4\nY7Hd3Pd4o/TDTEP1KRh17o1Blo098uUlGaW5HKM6j7G3P7xTb/ft54xWAAAAAElFTkSuQmCC\n", - "text/latex": [ - "$$223606$$" - ], - "text/plain": [ - "223606" - ] - }, - "execution_count": 32, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "offset_of(23000000000000, 2397916)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "So, we can compute the rank, then the offset, then the row value." - ] - }, - { - "cell_type": "code", - "execution_count": 33, - "metadata": {}, - "outputs": [], - "source": [ - "def rank_of(n):\n", - " return int(mfloor(sqrt(n - 1) / 2 - 0.5) + 1)\n", - "\n", - "\n", - "def offset_of(n, k):\n", - " return (n - 2 + 4 * k * (k - 1)) % (2 * k)\n", - "\n", - "\n", - "def row_value(k, i):\n", - " return abs(i - (k - 1)) + k\n", - "\n", - "\n", - "def aoc20173(n):\n", - " k = rank_of(n)\n", - " i = offset_of(n, k)\n", - " return row_value(k, i)" - ] - }, - { - "cell_type": "code", - "execution_count": 34, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAAkAAAAOBAMAAAAPuiubAAAALVBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAOrOgAAAADnRSTlMAIpm7MhCriUTv3c12VLge\nopIAAAAJcEhZcwAADsQAAA7EAZUrDhsAAABOSURBVAgdY2BUMnZgYAhjYH/BwJDKwDCTgWEWA0Oe\nA8O+ABAJBOsCgATHcxCTKwFEKoEIHgUQeYmBUYCBRYGBR4BBqrwoi4Fh37t3rxgAK5QOlzv7snYA\nAAAASUVORK5CYII=\n", - "text/latex": [ - "$$2$$" - ], - "text/plain": [ - "2" - ] - }, - "execution_count": 34, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "aoc20173(23)" - ] - }, - { - "cell_type": "code", - "execution_count": 35, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAB0AAAAPBAMAAADqo9msAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAVO8Qq5l2zWaJMt0i\nu0SCRuA9AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAArElEQVQIHWNgAAHmyM4FDOzJXIFANqMyAwO7\nAPMeBqb//ycwMJiEfGZgaGJgmM7APiUHpJYNyL/CwCBvwALiQfhfGBjeCyD4zF+B/ASWjtQFEHme\nnwwM6yfwGvD8g/KB8uuBZjPchvAh6oHs+ANw8+QF3BkY5j+A8O8yMPQbqAPlDSB8oHvCGQIYGLZD\n9DNwCzBrMRxl4NBhYGB1+u7BwDwtZQEDT6QrUDkaAADf+TCFzC1FdQAAAABJRU5ErkJggg==\n", - "text/latex": [ - "$$105$$" - ], - "text/plain": [ - "105" - ] - }, - "execution_count": 35, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "aoc20173(23000)" - ] - }, - { - "cell_type": "code", - "execution_count": 36, - "metadata": {}, - "outputs": [ - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAEgAAAAPBAMAAAC1npSgAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAMpndu3bvImbNiRBU\nq0Qb3U6NAAAACXBIWXMAAA7EAAAOxAGVKw4bAAABGklEQVQoFYWQsUrDUBRAT6I1pVYJ/YLYURcH\nV9HBzS9wtjgJPnRx00XnDLq4tIhTQOjiIojiLghSKEjRxR9QUajU5715hfc2Qzi83HMgjwvQgNNu\n4y5ani8KkuZaGqA00rAEO3ZI1Vo74obab4DSSFNpwVnPEBt45Bm2ApRGov0TlVCTN2UTXlKP0ojs\njCM5vkG7K5HHOKoaifpHc9KwqmClG8CZKyRa5+BV/nYoltlhCGc6GsHkItzqgQm9oIeaeuqi+Bs2\nyqip9EDMNRLN5LodXZhsJAvhzMNg8NWbyol/mB5pdE9iPJyRcYtYLpETvctHlFExHs7I/JMk49hQ\n12ivOH8K4Axc2D67lwuQbEvUtvYjgDMy//f5A0ICeXTNG40LAAAAAElFTkSuQmCC\n", - "text/latex": [ - "$$4572225$$" - ], - "text/plain": [ - "4572225" - ] - }, - "execution_count": 36, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "aoc20173(23000000000000)" - ] - }, - { - "cell_type": "code", - "execution_count": 37, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "CPU times: user 0 ns, sys: 0 ns, total: 0 ns\n", - "Wall time: 20 µs\n" - ] - }, - { - "data": { - "image/png": "iVBORw0KGgoAAAANSUhEUgAAAIUAAAAPBAMAAAA43xGxAAAAMFBMVEX///8AAAAAAAAAAAAAAAAA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv3aB7AAAAD3RSTlMAIpm7MhCriUTv3c12\nVGZoascqAAAACXBIWXMAAA7EAAAOxAGVKw4bAAACa0lEQVQoFaXTT0gUYRjH8e/+mZ11d50duhWE\nw9JfvAxJQaeGIDw6eCjMg1uUUUQuInpIci6dXaGCCsvOEe2hfwfTJaKIhLYIOrqeQhLUcl3RdHve\neTfo3h6GnefzPj/e99l3ieQ6PDBHhzAODtvy+C6v3TeGgJH3HpqJO5qZ9k9W6B451+Swh9OYGxiv\naKenGpkgXTEewWvO2vQG0ZJmSLmaedioYzxgd5PDHi7CXWIOHVyG8yzCdawiZokjxFzN8MHVzMur\nNokiCUdz2MM9GPDGbdnbFoxxDOb9WJ7WWnJVapqJ/HA1k5datoS5ojnsYdaXjOMixi/45K3DeCWb\nJ7kdK0pRM2ba1Rxm9Llk1kJuFmXdU3+r803AfdnHzZ+SUe5zSP7OPhs9pFKEWUi7IQdcW9pHi+xj\nQ7PqCWRNsm5sVZmUgzC7UIeuQluBeL1vhpZKyBhlyVBc5ShtgblCekezLsrM80bD57CfLreOfZZ9\nSIajMmpEb0tGKo+JZChWmbEppvm2rflvMQebsByw9Hbs1D9nmcLakB7hrypDsSfv0VWsuc61rGZd\nzDjwWDKq4gO+zHRezbR1O1XC2gFhoxBmKE6oUcjCRK3JqghfiNjyM8s+4IVcE5Z9uRdWTW6B2ofw\n3v7+gTvlkGWc0Zp8S+ebrHrULc7YXTIPFu34qrpj7VhFoqW4zKOoGVpczVGZT8maoMvWHPawZ2Tw\nComCMclHv7dKqmLcgif0eFyip6JZrpWrOeJIVua5MYPmsIfZRkMmOnjAw8zJfTBG33lwZu6C/A9z\n8tBsnlivhsyu4f2yOhc0WRflcP/7+QN1gvGXxRfSRAAAAABJRU5ErkJggg==\n", - "text/latex": [ - "$$2690062495969$$" - ], - "text/plain": [ - "2690062495969" - ] - }, - "execution_count": 37, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "%time aoc20173(23000000000000000000000000) # Fast for large values." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# A Joy Version\n", - "At this point I feel confident that I can implement a concise version of this code in Joy. ;-)" - ] - }, - { - "cell_type": "code", - "execution_count": 38, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `rank_of`\n", - "\n", - " n rank_of\n", - " ---------------\n", - " k\n", - "\n", - "The translation is straightforward.\n", - "\n", - " int(floor(sqrt(n - 1) / 2 - 0.5) + 1)\n", - "\n", - " rank_of == -- sqrt 2 / 0.5 - floor ++" - ] - }, - { - "cell_type": "code", - "execution_count": 39, - "metadata": {}, - "outputs": [], - "source": [ - "define('rank_of == -- sqrt 2 / 0.5 - floor ++')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `offset_of`\n", - "\n", - " n k offset_of\n", - " -------------------\n", - " i\n", - "\n", - " (n - 2 + 4 * k * (k - 1)) % (2 * k)\n", - "\n", - "A little tricky...\n", - "\n", - " n k dup 2 *\n", - " n k k 2 *\n", - " n k k*2 [Q] dip %\n", - " n k Q k*2 %\n", - "\n", - " n k dup --\n", - " n k k --\n", - " n k k-1 4 * * 2 + -\n", - " n k*k-1*4 2 + -\n", - " n k*k-1*4+2 -\n", - " n-k*k-1*4+2\n", - "\n", - " n-k*k-1*4+2 k*2 %\n", - " n-k*k-1*4+2%k*2\n", - "\n", - "Ergo:\n", - "\n", - " offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %" - ] - }, - { - "cell_type": "code", - "execution_count": 40, - "metadata": {}, - "outputs": [], - "source": [ - "define('offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `row_value`\n", - "\n", - " k i row_value\n", - " -------------------\n", - " n\n", - "\n", - " abs(i - (k - 1)) + k\n", - "\n", - " k i over -- - abs +\n", - " k i k -- - abs +\n", - " k i k-1 - abs +\n", - " k i-k-1 abs +\n", - " k |i-k-1| +\n", - " k+|i-k-1|" - ] - }, - { - "cell_type": "code", - "execution_count": 41, - "metadata": {}, - "outputs": [], - "source": [ - "define('row_value == over -- - abs +')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `aoc2017.3`\n", - "\n", - " n aoc2017.3\n", - " -----------------\n", - " m\n", - "\n", - " n dup rank_of\n", - " n k [offset_of] dupdip\n", - " n k offset_of k\n", - " i k swap row_value\n", - " k i row_value\n", - " m" - ] - }, - { - "cell_type": "code", - "execution_count": 42, - "metadata": {}, - "outputs": [], - "source": [ - "define('aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value')" - ] - }, - { - "cell_type": "code", - "execution_count": 43, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('23 aoc2017.3')" - ] - }, - { - "cell_type": "code", - "execution_count": 44, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "105\n" - ] - } - ], - "source": [ - "J('23000 aoc2017.3')" - ] - }, - { - "cell_type": "code", - "execution_count": 45, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 23000000000000 aoc2017.3\n", - " 23000000000000 . aoc2017.3\n", - " 23000000000000 . dup rank_of [offset_of] dupdip swap row_value\n", - " 23000000000000 23000000000000 . rank_of [offset_of] dupdip swap row_value\n", - " 23000000000000 23000000000000 . -- sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 22999999999999 . sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 4795831.523312615 . 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 4795831.523312615 2 . / 0.5 - floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 2397915.7616563076 . 0.5 - floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 2397915.7616563076 0.5 . - floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 2397915.2616563076 . floor ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 2397915 . ++ [offset_of] dupdip swap row_value\n", - " 23000000000000 2397916 . [offset_of] dupdip swap row_value\n", - " 23000000000000 2397916 [offset_of] . dupdip swap row_value\n", - " 23000000000000 2397916 . offset_of 2397916 swap row_value\n", - " 23000000000000 2397916 . dup 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value\n", - " 23000000000000 2397916 2397916 . 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value\n", - " 23000000000000 2397916 2397916 2 . * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value\n", - " 23000000000000 2397916 4795832 . [dup -- 4 * * 2 + -] dip % 2397916 swap row_value\n", - "23000000000000 2397916 4795832 [dup -- 4 * * 2 + -] . dip % 2397916 swap row_value\n", - " 23000000000000 2397916 . dup -- 4 * * 2 + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 2397916 2397916 . -- 4 * * 2 + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 2397916 2397915 . 4 * * 2 + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 2397916 2397915 4 . * * 2 + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 2397916 9591660 . * 2 + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 22999994980560 . 2 + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 22999994980560 2 . + - 4795832 % 2397916 swap row_value\n", - " 23000000000000 22999994980562 . - 4795832 % 2397916 swap row_value\n", - " 5019438 . 4795832 % 2397916 swap row_value\n", - " 5019438 4795832 . % 2397916 swap row_value\n", - " 223606 . 2397916 swap row_value\n", - " 223606 2397916 . swap row_value\n", - " 2397916 223606 . row_value\n", - " 2397916 223606 . over -- - abs +\n", - " 2397916 223606 2397916 . -- - abs +\n", - " 2397916 223606 2397915 . - abs +\n", - " 2397916 -2174309 . abs +\n", - " 2397916 2174309 . +\n", - " 4572225 . \n" - ] - } - ], - "source": [ - "V('23000000000000 aoc2017.3')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " rank_of == -- sqrt 2 / 0.5 - floor ++\n", - " offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %\n", - " row_value == over -- - abs +\n", - "\n", - " aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Advent of Code 2017 December 3rd.md b/docs/Advent of Code 2017 December 3rd.md deleted file mode 100644 index d6de378..0000000 --- a/docs/Advent of Code 2017 December 3rd.md +++ /dev/null @@ -1,843 +0,0 @@ - -# Advent of Code 2017 - -## December 3rd - -You come across an experimental new kind of memory stored on an infinite two-dimensional grid. - -Each square on the grid is allocated in a spiral pattern starting at a location marked 1 and then counting up while spiraling outward. For example, the first few squares are allocated like this: - - 17 16 15 14 13 - 18 5 4 3 12 - 19 6 1 2 11 - 20 7 8 9 10 - 21 22 23---> ... - -While this is very space-efficient (no squares are skipped), requested data must be carried back to square 1 (the location of the only access port for this memory system) by programs that can only move up, down, left, or right. They always take the shortest path: the Manhattan Distance between the location of the data and square 1. - -For example: - -* Data from square 1 is carried 0 steps, since it's at the access port. -* Data from square 12 is carried 3 steps, such as: down, left, left. -* Data from square 23 is carried only 2 steps: up twice. -* Data from square 1024 must be carried 31 steps. - -How many steps are required to carry the data from the square identified in your puzzle input all the way to the access port? - -### Analysis - -I freely admit that I worked out the program I wanted to write using graph paper and some Python doodles. There's no point in trying to write a Joy program until I'm sure I understand the problem well enough. - -The first thing I did was to write a column of numbers from 1 to n (32 as it happens) and next to them the desired output number, to look for patterns directly: - - 1 0 - 2 1 - 3 2 - 4 1 - 5 2 - 6 1 - 7 2 - 8 1 - 9 2 - 10 3 - 11 2 - 12 3 - 13 4 - 14 3 - 15 2 - 16 3 - 17 4 - 18 3 - 19 2 - 20 3 - 21 4 - 22 3 - 23 2 - 24 3 - 25 4 - 26 5 - 27 4 - 28 3 - 29 4 - 30 5 - 31 6 - 32 5 - -There are four groups repeating for a given "rank", then the pattern enlarges and four groups repeat again, etc. - - 1 2 - 3 2 3 4 - 5 4 3 4 5 6 - 7 6 5 4 5 6 7 8 - 9 8 7 6 5 6 7 8 9 10 - -Four of this pyramid interlock to tile the plane extending from the initial "1" square. - - - 2 3 | 4 5 | 6 7 | 8 9 - 10 11 12 13|14 15 16 17|18 19 20 21|22 23 24 25 - -And so on. - -We can figure out the pattern for a row of the pyramid at a given "rank" $k$: - -$2k - 1, 2k - 2, ..., k, k + 1, k + 2, ..., 2k$ - -or - -$k + (k - 1), k + (k - 2), ..., k, k + 1, k + 2, ..., k + k$ - -This shows that the series consists at each place of $k$ plus some number that begins at $k - 1$, decreases to zero, then increases to $k$. Each row has $2k$ members. - -Let's figure out how, given an index into a row, we can calculate the value there. The index will be from 0 to $k - 1$. - - Let's look at an example, with $k = 4$: - - 0 1 2 3 4 5 6 7 - 7 6 5 4 5 6 7 8 - - -```python -k = 4 -``` - -Subtract $k$ from the index and take the absolute value: - - -```python -for n in range(2 * k): - print abs(n - k), -``` - - 4 3 2 1 0 1 2 3 - - -Not quite. Subtract $k - 1$ from the index and take the absolute value: - - -```python -for n in range(2 * k): - print abs(n - (k - 1)), -``` - - 3 2 1 0 1 2 3 4 - - -Great, now add $k$... - - -```python -for n in range(2 * k): - print abs(n - (k - 1)) + k, -``` - - 7 6 5 4 5 6 7 8 - - -So to write a function that can give us the value of a row at a given index: - - -```python -def row_value(k, i): - i %= (2 * k) # wrap the index at the row boundary. - return abs(i - (k - 1)) + k -``` - - -```python -k = 5 -for i in range(2 * k): - print row_value(k, i), -``` - - 9 8 7 6 5 6 7 8 9 10 - - -(I'm leaving out details of how I figured this all out and just giving the relevent bits. It took a little while to zero in of the aspects of the pattern that were important for the task.) - -### Finding the rank and offset of a number. -Now that we can compute the desired output value for a given rank and the offset (index) into that rank, we need to determine how to find the rank and offset of a number. - -The rank is easy to find by iteratively stripping off the amount already covered by previous ranks until you find the one that brackets the target number. Because each row is $2k$ places and there are $4$ per rank each rank contains $8k$ places. Counting the initial square we have: - -$corner_k = 1 + \sum_{n=1}^k 8n$ - -I'm not mathematically sophisticated enough to turn this directly into a formula (but Sympy is, see below.) I'm going to write a simple Python function to iterate and search: - - -```python -def rank_and_offset(n): - assert n >= 2 # Guard the domain. - n -= 2 # Subtract two, - # one for the initial square, - # and one because we are counting from 1 instead of 0. - k = 1 - while True: - m = 8 * k # The number of places total in this rank, 4(2k). - if n < m: - return k, n % (2 * k) - n -= m # Remove this rank's worth. - k += 1 -``` - - -```python -for n in range(2, 51): - print n, rank_and_offset(n) -``` - - 2 (1, 0) - 3 (1, 1) - 4 (1, 0) - 5 (1, 1) - 6 (1, 0) - 7 (1, 1) - 8 (1, 0) - 9 (1, 1) - 10 (2, 0) - 11 (2, 1) - 12 (2, 2) - 13 (2, 3) - 14 (2, 0) - 15 (2, 1) - 16 (2, 2) - 17 (2, 3) - 18 (2, 0) - 19 (2, 1) - 20 (2, 2) - 21 (2, 3) - 22 (2, 0) - 23 (2, 1) - 24 (2, 2) - 25 (2, 3) - 26 (3, 0) - 27 (3, 1) - 28 (3, 2) - 29 (3, 3) - 30 (3, 4) - 31 (3, 5) - 32 (3, 0) - 33 (3, 1) - 34 (3, 2) - 35 (3, 3) - 36 (3, 4) - 37 (3, 5) - 38 (3, 0) - 39 (3, 1) - 40 (3, 2) - 41 (3, 3) - 42 (3, 4) - 43 (3, 5) - 44 (3, 0) - 45 (3, 1) - 46 (3, 2) - 47 (3, 3) - 48 (3, 4) - 49 (3, 5) - 50 (4, 0) - - - -```python -for n in range(2, 51): - k, i = rank_and_offset(n) - print n, row_value(k, i) -``` - - 2 1 - 3 2 - 4 1 - 5 2 - 6 1 - 7 2 - 8 1 - 9 2 - 10 3 - 11 2 - 12 3 - 13 4 - 14 3 - 15 2 - 16 3 - 17 4 - 18 3 - 19 2 - 20 3 - 21 4 - 22 3 - 23 2 - 24 3 - 25 4 - 26 5 - 27 4 - 28 3 - 29 4 - 30 5 - 31 6 - 32 5 - 33 4 - 34 3 - 35 4 - 36 5 - 37 6 - 38 5 - 39 4 - 40 3 - 41 4 - 42 5 - 43 6 - 44 5 - 45 4 - 46 3 - 47 4 - 48 5 - 49 6 - 50 7 - - -### Putting it all together - - -```python -def row_value(k, i): - return abs(i - (k - 1)) + k - - -def rank_and_offset(n): - n -= 2 # Subtract two, - # one for the initial square, - # and one because we are counting from 1 instead of 0. - k = 1 - while True: - m = 8 * k # The number of places total in this rank, 4(2k). - if n < m: - return k, n % (2 * k) - n -= m # Remove this rank's worth. - k += 1 - - -def aoc20173(n): - if n <= 1: - return 0 - k, i = rank_and_offset(n) - return row_value(k, i) -``` - - -```python -aoc20173(23) -``` - - - - - 2 - - - - -```python -aoc20173(23000) -``` - - - - - 105 - - - - -```python -aoc20173(23000000000000) -``` - - - - - 4572225 - - - -# Sympy to the Rescue -### Find the rank for large numbers -Using e.g. Sympy we can find the rank directly by solving for the roots of an equation. For large numbers this will (eventually) be faster than iterating as `rank_and_offset()` does. - - -```python -from sympy import floor, lambdify, solve, symbols -from sympy import init_printing -init_printing() -``` - - -```python -k = symbols('k') -``` - -Since - -$1 + 2 + 3 + ... + N = \frac{N(N + 1)}{2}$ - -and - -$\sum_{n=1}^k 8n = 8(\sum_{n=1}^k n) = 8\frac{k(k + 1)}{2}$ - -We want: - - -```python -E = 2 + 8 * k * (k + 1) / 2 # For the reason for adding 2 see above. - -E -``` - - - - -$$4 k \left(k + 1\right) + 2$$ - - - -We can write a function to solve for $k$ given some $n$... - - -```python -def rank_of(n): - return floor(max(solve(E - n, k))) + 1 -``` - -First `solve()` for $E - n = 0$ which has two solutions (because the equation is quadratic so it has two roots) and since we only care about the larger one we use `max()` to select it. It will generally not be a nice integer (unless $n$ is the number of an end-corner of a rank) so we take the `floor()` and add 1 to get the integer rank of $n$. (Taking the `ceiling()` gives off-by-one errors on the rank boundaries. I don't know why. I'm basically like a monkey doing math here.) =-D - -It gives correct answers: - - -```python -for n in (9, 10, 25, 26, 49, 50): - print n, rank_of(n) -``` - - 9 1 - 10 2 - 25 2 - 26 3 - 49 3 - 50 4 - - -And it runs much faster (at least for large numbers): - - -```python -%time rank_of(23000000000000) # Compare runtime with rank_and_offset()! -``` - - CPU times: user 68 ms, sys: 8 ms, total: 76 ms - Wall time: 73.8 ms - - - - - -$$2397916$$ - - - - -```python -%time rank_and_offset(23000000000000) -``` - - CPU times: user 308 ms, sys: 0 ns, total: 308 ms - Wall time: 306 ms - - - - - -$$\left ( 2397916, \quad 223606\right )$$ - - - -After finding the rank you would still have to find the actual value of the rank's first corner and subtract it (plus 2) from the number and compute the offset as above and then the final output, but this overhead is partially shared by the other method, and overshadowed by the time it (the other iterative method) would take for really big inputs. - -The fun thing to do here would be to graph the actual runtime of both methods against each other to find the trade-off point. - -### It took me a second to realize I could do this... -Sympy is a *symbolic* math library, and it supports symbolic manipulation of equations. I can put in $y$ (instead of a value) and ask it to solve for $k$. - - -```python -y = symbols('y') -``` - - -```python -g, f = solve(E - y, k) -``` - -The equation is quadratic so there are two roots, we are interested in the greater one... - - -```python -g -``` - - - - -$$- \frac{1}{2} \sqrt{y - 1} - \frac{1}{2}$$ - - - - -```python -f -``` - - - - -$$\frac{1}{2} \sqrt{y - 1} - \frac{1}{2}$$ - - - -Now we can take the `floor()`, add 1, and `lambdify()` the equation to get a Python function that calculates the rank directly. - - -```python -floor(f) + 1 -``` - - - - -$$\lfloor{\frac{1}{2} \sqrt{y - 1} - \frac{1}{2}}\rfloor + 1$$ - - - - -```python -F = lambdify(y, floor(f) + 1) -``` - - -```python -for n in (9, 10, 25, 26, 49, 50): - print n, int(F(n)) -``` - - 9 1 - 10 2 - 25 2 - 26 3 - 49 3 - 50 4 - - -It's pretty fast. - - -```python -%time int(F(23000000000000)) # The clear winner. -``` - - CPU times: user 0 ns, sys: 0 ns, total: 0 ns - Wall time: 11.9 µs - - - - - -$$2397916$$ - - - -Knowing the equation we could write our own function manually, but the speed is no better. - - -```python -from math import floor as mfloor, sqrt - -def mrank_of(n): - return int(mfloor(sqrt(23000000000000 - 1) / 2 - 0.5) + 1) -``` - - -```python -%time mrank_of(23000000000000) -``` - - CPU times: user 0 ns, sys: 0 ns, total: 0 ns - Wall time: 12.9 µs - - - - - -$$2397916$$ - - - -### Given $n$ and a rank, compute the offset. - -Now that we have a fast way to get the rank, we still need to use it to compute the offset into a pyramid row. - - -```python -def offset_of(n, k): - return (n - 2 + 4 * k * (k - 1)) % (2 * k) -``` - -(Note the sneaky way the sign changes from $k(k + 1)$ to $k(k - 1)$. This is because we want to subract the $(k - 1)$th rank's total places (its own and those of lesser rank) from our $n$ of rank $k$. Substituting $k - 1$ for $k$ in $k(k + 1)$ gives $(k - 1)(k - 1 + 1)$, which of course simplifies to $k(k - 1)$.) - - -```python -offset_of(23000000000000, 2397916) -``` - - - - -$$223606$$ - - - -So, we can compute the rank, then the offset, then the row value. - - -```python -def rank_of(n): - return int(mfloor(sqrt(n - 1) / 2 - 0.5) + 1) - - -def offset_of(n, k): - return (n - 2 + 4 * k * (k - 1)) % (2 * k) - - -def row_value(k, i): - return abs(i - (k - 1)) + k - - -def aoc20173(n): - k = rank_of(n) - i = offset_of(n, k) - return row_value(k, i) -``` - - -```python -aoc20173(23) -``` - - - - -$$2$$ - - - - -```python -aoc20173(23000) -``` - - - - -$$105$$ - - - - -```python -aoc20173(23000000000000) -``` - - - - -$$4572225$$ - - - - -```python -%time aoc20173(23000000000000000000000000) # Fast for large values. -``` - - CPU times: user 0 ns, sys: 0 ns, total: 0 ns - Wall time: 20 µs - - - - - -$$2690062495969$$ - - - -# A Joy Version -At this point I feel confident that I can implement a concise version of this code in Joy. ;-) - - -```python -from notebook_preamble import J, V, define -``` - -### `rank_of` - - n rank_of - --------------- - k - -The translation is straightforward. - - int(floor(sqrt(n - 1) / 2 - 0.5) + 1) - - rank_of == -- sqrt 2 / 0.5 - floor ++ - - -```python -define('rank_of == -- sqrt 2 / 0.5 - floor ++') -``` - -### `offset_of` - - n k offset_of - ------------------- - i - - (n - 2 + 4 * k * (k - 1)) % (2 * k) - -A little tricky... - - n k dup 2 * - n k k 2 * - n k k*2 [Q] dip % - n k Q k*2 % - - n k dup -- - n k k -- - n k k-1 4 * * 2 + - - n k*k-1*4 2 + - - n k*k-1*4+2 - - n-k*k-1*4+2 - - n-k*k-1*4+2 k*2 % - n-k*k-1*4+2%k*2 - -Ergo: - - offset_of == dup 2 * [dup -- 4 * * 2 + -] dip % - - -```python -define('offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %') -``` - -### `row_value` - - k i row_value - ------------------- - n - - abs(i - (k - 1)) + k - - k i over -- - abs + - k i k -- - abs + - k i k-1 - abs + - k i-k-1 abs + - k |i-k-1| + - k+|i-k-1| - - -```python -define('row_value == over -- - abs +') -``` - -### `aoc2017.3` - - n aoc2017.3 - ----------------- - m - - n dup rank_of - n k [offset_of] dupdip - n k offset_of k - i k swap row_value - k i row_value - m - - -```python -define('aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value') -``` - - -```python -J('23 aoc2017.3') -``` - - 2 - - - -```python -J('23000 aoc2017.3') -``` - - 105 - - - -```python -V('23000000000000 aoc2017.3') -``` - - . 23000000000000 aoc2017.3 - 23000000000000 . aoc2017.3 - 23000000000000 . dup rank_of [offset_of] dupdip swap row_value - 23000000000000 23000000000000 . rank_of [offset_of] dupdip swap row_value - 23000000000000 23000000000000 . -- sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 22999999999999 . sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 4795831.523312615 . 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 4795831.523312615 2 . / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915.7616563076 . 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915.7616563076 0.5 . - floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915.2616563076 . floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915 . ++ [offset_of] dupdip swap row_value - 23000000000000 2397916 . [offset_of] dupdip swap row_value - 23000000000000 2397916 [offset_of] . dupdip swap row_value - 23000000000000 2397916 . offset_of 2397916 swap row_value - 23000000000000 2397916 . dup 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 2397916 . 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 2397916 2 . * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 4795832 . [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 4795832 [dup -- 4 * * 2 + -] . dip % 2397916 swap row_value - 23000000000000 2397916 . dup -- 4 * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 2397916 . -- 4 * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 2397915 . 4 * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 2397915 4 . * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 9591660 . * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 22999994980560 . 2 + - 4795832 % 2397916 swap row_value - 23000000000000 22999994980560 2 . + - 4795832 % 2397916 swap row_value - 23000000000000 22999994980562 . - 4795832 % 2397916 swap row_value - 5019438 . 4795832 % 2397916 swap row_value - 5019438 4795832 . % 2397916 swap row_value - 223606 . 2397916 swap row_value - 223606 2397916 . swap row_value - 2397916 223606 . row_value - 2397916 223606 . over -- - abs + - 2397916 223606 2397916 . -- - abs + - 2397916 223606 2397915 . - abs + - 2397916 -2174309 . abs + - 2397916 2174309 . + - 4572225 . - - - rank_of == -- sqrt 2 / 0.5 - floor ++ - offset_of == dup 2 * [dup -- 4 * * 2 + -] dip % - row_value == over -- - abs + - - aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value diff --git a/docs/Advent of Code 2017 December 3rd.rst b/docs/Advent of Code 2017 December 3rd.rst deleted file mode 100644 index 2283c7f..0000000 --- a/docs/Advent of Code 2017 December 3rd.rst +++ /dev/null @@ -1,973 +0,0 @@ - -Advent of Code 2017 -=================== - -December 3rd ------------- - -You come across an experimental new kind of memory stored on an infinite -two-dimensional grid. - -Each square on the grid is allocated in a spiral pattern starting at a -location marked 1 and then counting up while spiraling outward. For -example, the first few squares are allocated like this: - -:: - - 17 16 15 14 13 - 18 5 4 3 12 - 19 6 1 2 11 - 20 7 8 9 10 - 21 22 23---> ... - -While this is very space-efficient (no squares are skipped), requested -data must be carried back to square 1 (the location of the only access -port for this memory system) by programs that can only move up, down, -left, or right. They always take the shortest path: the Manhattan -Distance between the location of the data and square 1. - -For example: - -- Data from square 1 is carried 0 steps, since it's at the access port. -- Data from square 12 is carried 3 steps, such as: down, left, left. -- Data from square 23 is carried only 2 steps: up twice. -- Data from square 1024 must be carried 31 steps. - -How many steps are required to carry the data from the square identified -in your puzzle input all the way to the access port? - -Analysis -~~~~~~~~ - -I freely admit that I worked out the program I wanted to write using -graph paper and some Python doodles. There's no point in trying to write -a Joy program until I'm sure I understand the problem well enough. - -The first thing I did was to write a column of numbers from 1 to n (32 -as it happens) and next to them the desired output number, to look for -patterns directly: - -:: - - 1 0 - 2 1 - 3 2 - 4 1 - 5 2 - 6 1 - 7 2 - 8 1 - 9 2 - 10 3 - 11 2 - 12 3 - 13 4 - 14 3 - 15 2 - 16 3 - 17 4 - 18 3 - 19 2 - 20 3 - 21 4 - 22 3 - 23 2 - 24 3 - 25 4 - 26 5 - 27 4 - 28 3 - 29 4 - 30 5 - 31 6 - 32 5 - -There are four groups repeating for a given "rank", then the pattern -enlarges and four groups repeat again, etc. - -:: - - 1 2 - 3 2 3 4 - 5 4 3 4 5 6 - 7 6 5 4 5 6 7 8 - 9 8 7 6 5 6 7 8 9 10 - -Four of this pyramid interlock to tile the plane extending from the -initial "1" square. - -:: - - 2 3 | 4 5 | 6 7 | 8 9 - 10 11 12 13|14 15 16 17|18 19 20 21|22 23 24 25 - -And so on. - -We can figure out the pattern for a row of the pyramid at a given "rank" -:math:`k`: - -:math:`2k - 1, 2k - 2, ..., k, k + 1, k + 2, ..., 2k` - -or - -:math:`k + (k - 1), k + (k - 2), ..., k, k + 1, k + 2, ..., k + k` - -This shows that the series consists at each place of :math:`k` plus some -number that begins at :math:`k - 1`, decreases to zero, then increases -to :math:`k`. Each row has :math:`2k` members. - -Let's figure out how, given an index into a row, we can calculate the -value there. The index will be from 0 to :math:`k - 1`. - -Let's look at an example, with :math:`k = 4`: - -:: - - 0 1 2 3 4 5 6 7 - 7 6 5 4 5 6 7 8 - -.. code:: ipython2 - - k = 4 - -Subtract :math:`k` from the index and take the absolute value: - -.. code:: ipython2 - - for n in range(2 * k): - print abs(n - k), - - -.. parsed-literal:: - - 4 3 2 1 0 1 2 3 - - -Not quite. Subtract :math:`k - 1` from the index and take the absolute -value: - -.. code:: ipython2 - - for n in range(2 * k): - print abs(n - (k - 1)), - - -.. parsed-literal:: - - 3 2 1 0 1 2 3 4 - - -Great, now add :math:`k`... - -.. code:: ipython2 - - for n in range(2 * k): - print abs(n - (k - 1)) + k, - - -.. parsed-literal:: - - 7 6 5 4 5 6 7 8 - - -So to write a function that can give us the value of a row at a given -index: - -.. code:: ipython2 - - def row_value(k, i): - i %= (2 * k) # wrap the index at the row boundary. - return abs(i - (k - 1)) + k - -.. code:: ipython2 - - k = 5 - for i in range(2 * k): - print row_value(k, i), - - -.. parsed-literal:: - - 9 8 7 6 5 6 7 8 9 10 - - -(I'm leaving out details of how I figured this all out and just giving -the relevent bits. It took a little while to zero in of the aspects of -the pattern that were important for the task.) - -Finding the rank and offset of a number. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Now that we can compute the desired output value for a given rank and -the offset (index) into that rank, we need to determine how to find the -rank and offset of a number. - -The rank is easy to find by iteratively stripping off the amount already -covered by previous ranks until you find the one that brackets the -target number. Because each row is :math:`2k` places and there are -:math:`4` per rank each rank contains :math:`8k` places. Counting the -initial square we have: - -:math:`corner_k = 1 + \sum_{n=1}^k 8n` - -I'm not mathematically sophisticated enough to turn this directly into a -formula (but Sympy is, see below.) I'm going to write a simple Python -function to iterate and search: - -.. code:: ipython2 - - def rank_and_offset(n): - assert n >= 2 # Guard the domain. - n -= 2 # Subtract two, - # one for the initial square, - # and one because we are counting from 1 instead of 0. - k = 1 - while True: - m = 8 * k # The number of places total in this rank, 4(2k). - if n < m: - return k, n % (2 * k) - n -= m # Remove this rank's worth. - k += 1 - -.. code:: ipython2 - - for n in range(2, 51): - print n, rank_and_offset(n) - - -.. parsed-literal:: - - 2 (1, 0) - 3 (1, 1) - 4 (1, 0) - 5 (1, 1) - 6 (1, 0) - 7 (1, 1) - 8 (1, 0) - 9 (1, 1) - 10 (2, 0) - 11 (2, 1) - 12 (2, 2) - 13 (2, 3) - 14 (2, 0) - 15 (2, 1) - 16 (2, 2) - 17 (2, 3) - 18 (2, 0) - 19 (2, 1) - 20 (2, 2) - 21 (2, 3) - 22 (2, 0) - 23 (2, 1) - 24 (2, 2) - 25 (2, 3) - 26 (3, 0) - 27 (3, 1) - 28 (3, 2) - 29 (3, 3) - 30 (3, 4) - 31 (3, 5) - 32 (3, 0) - 33 (3, 1) - 34 (3, 2) - 35 (3, 3) - 36 (3, 4) - 37 (3, 5) - 38 (3, 0) - 39 (3, 1) - 40 (3, 2) - 41 (3, 3) - 42 (3, 4) - 43 (3, 5) - 44 (3, 0) - 45 (3, 1) - 46 (3, 2) - 47 (3, 3) - 48 (3, 4) - 49 (3, 5) - 50 (4, 0) - - -.. code:: ipython2 - - for n in range(2, 51): - k, i = rank_and_offset(n) - print n, row_value(k, i) - - -.. parsed-literal:: - - 2 1 - 3 2 - 4 1 - 5 2 - 6 1 - 7 2 - 8 1 - 9 2 - 10 3 - 11 2 - 12 3 - 13 4 - 14 3 - 15 2 - 16 3 - 17 4 - 18 3 - 19 2 - 20 3 - 21 4 - 22 3 - 23 2 - 24 3 - 25 4 - 26 5 - 27 4 - 28 3 - 29 4 - 30 5 - 31 6 - 32 5 - 33 4 - 34 3 - 35 4 - 36 5 - 37 6 - 38 5 - 39 4 - 40 3 - 41 4 - 42 5 - 43 6 - 44 5 - 45 4 - 46 3 - 47 4 - 48 5 - 49 6 - 50 7 - - -Putting it all together -~~~~~~~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - def row_value(k, i): - return abs(i - (k - 1)) + k - - - def rank_and_offset(n): - n -= 2 # Subtract two, - # one for the initial square, - # and one because we are counting from 1 instead of 0. - k = 1 - while True: - m = 8 * k # The number of places total in this rank, 4(2k). - if n < m: - return k, n % (2 * k) - n -= m # Remove this rank's worth. - k += 1 - - - def aoc20173(n): - if n <= 1: - return 0 - k, i = rank_and_offset(n) - return row_value(k, i) - -.. code:: ipython2 - - aoc20173(23) - - - - -.. parsed-literal:: - - 2 - - - -.. code:: ipython2 - - aoc20173(23000) - - - - -.. parsed-literal:: - - 105 - - - -.. code:: ipython2 - - aoc20173(23000000000000) - - - - -.. parsed-literal:: - - 4572225 - - - -Sympy to the Rescue -=================== - -Find the rank for large numbers -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Using e.g. Sympy we can find the rank directly by solving for the roots -of an equation. For large numbers this will (eventually) be faster than -iterating as ``rank_and_offset()`` does. - -.. code:: ipython2 - - from sympy import floor, lambdify, solve, symbols - from sympy import init_printing - init_printing() - -.. code:: ipython2 - - k = symbols('k') - -Since - -:math:`1 + 2 + 3 + ... + N = \frac{N(N + 1)}{2}` - -and - -:math:`\sum_{n=1}^k 8n = 8(\sum_{n=1}^k n) = 8\frac{k(k + 1)}{2}` - -We want: - -.. code:: ipython2 - - E = 2 + 8 * k * (k + 1) / 2 # For the reason for adding 2 see above. - - E - - - - -.. math:: - - 4 k \left(k + 1\right) + 2 - - - -We can write a function to solve for :math:`k` given some :math:`n`... - -.. code:: ipython2 - - def rank_of(n): - return floor(max(solve(E - n, k))) + 1 - -First ``solve()`` for :math:`E - n = 0` which has two solutions (because -the equation is quadratic so it has two roots) and since we only care -about the larger one we use ``max()`` to select it. It will generally -not be a nice integer (unless :math:`n` is the number of an end-corner -of a rank) so we take the ``floor()`` and add 1 to get the integer rank -of :math:`n`. (Taking the ``ceiling()`` gives off-by-one errors on the -rank boundaries. I don't know why. I'm basically like a monkey doing -math here.) =-D - -It gives correct answers: - -.. code:: ipython2 - - for n in (9, 10, 25, 26, 49, 50): - print n, rank_of(n) - - -.. parsed-literal:: - - 9 1 - 10 2 - 25 2 - 26 3 - 49 3 - 50 4 - - -And it runs much faster (at least for large numbers): - -.. code:: ipython2 - - %time rank_of(23000000000000) # Compare runtime with rank_and_offset()! - - -.. parsed-literal:: - - CPU times: user 68 ms, sys: 8 ms, total: 76 ms - Wall time: 73.8 ms - - - - -.. math:: - - 2397916 - - - -.. code:: ipython2 - - %time rank_and_offset(23000000000000) - - -.. parsed-literal:: - - CPU times: user 308 ms, sys: 0 ns, total: 308 ms - Wall time: 306 ms - - - - -.. math:: - - \left ( 2397916, \quad 223606\right ) - - - -After finding the rank you would still have to find the actual value of -the rank's first corner and subtract it (plus 2) from the number and -compute the offset as above and then the final output, but this overhead -is partially shared by the other method, and overshadowed by the time it -(the other iterative method) would take for really big inputs. - -The fun thing to do here would be to graph the actual runtime of both -methods against each other to find the trade-off point. - -It took me a second to realize I could do this... -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Sympy is a *symbolic* math library, and it supports symbolic -manipulation of equations. I can put in :math:`y` (instead of a value) -and ask it to solve for :math:`k`. - -.. code:: ipython2 - - y = symbols('y') - -.. code:: ipython2 - - g, f = solve(E - y, k) - -The equation is quadratic so there are two roots, we are interested in -the greater one... - -.. code:: ipython2 - - g - - - - -.. math:: - - - \frac{1}{2} \sqrt{y - 1} - \frac{1}{2} - - - -.. code:: ipython2 - - f - - - - -.. math:: - - \frac{1}{2} \sqrt{y - 1} - \frac{1}{2} - - - -Now we can take the ``floor()``, add 1, and ``lambdify()`` the equation -to get a Python function that calculates the rank directly. - -.. code:: ipython2 - - floor(f) + 1 - - - - -.. math:: - - \lfloor{\frac{1}{2} \sqrt{y - 1} - \frac{1}{2}}\rfloor + 1 - - - -.. code:: ipython2 - - F = lambdify(y, floor(f) + 1) - -.. code:: ipython2 - - for n in (9, 10, 25, 26, 49, 50): - print n, int(F(n)) - - -.. parsed-literal:: - - 9 1 - 10 2 - 25 2 - 26 3 - 49 3 - 50 4 - - -It's pretty fast. - -.. code:: ipython2 - - %time int(F(23000000000000)) # The clear winner. - - -.. parsed-literal:: - - CPU times: user 0 ns, sys: 0 ns, total: 0 ns - Wall time: 11.9 µs - - - - -.. math:: - - 2397916 - - - -Knowing the equation we could write our own function manually, but the -speed is no better. - -.. code:: ipython2 - - from math import floor as mfloor, sqrt - - def mrank_of(n): - return int(mfloor(sqrt(23000000000000 - 1) / 2 - 0.5) + 1) - -.. code:: ipython2 - - %time mrank_of(23000000000000) - - -.. parsed-literal:: - - CPU times: user 0 ns, sys: 0 ns, total: 0 ns - Wall time: 12.9 µs - - - - -.. math:: - - 2397916 - - - -Given :math:`n` and a rank, compute the offset. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Now that we have a fast way to get the rank, we still need to use it to -compute the offset into a pyramid row. - -.. code:: ipython2 - - def offset_of(n, k): - return (n - 2 + 4 * k * (k - 1)) % (2 * k) - -(Note the sneaky way the sign changes from :math:`k(k + 1)` to -:math:`k(k - 1)`. This is because we want to subract the -:math:`(k - 1)`\ th rank's total places (its own and those of lesser -rank) from our :math:`n` of rank :math:`k`. Substituting :math:`k - 1` -for :math:`k` in :math:`k(k + 1)` gives :math:`(k - 1)(k - 1 + 1)`, -which of course simplifies to :math:`k(k - 1)`.) - -.. code:: ipython2 - - offset_of(23000000000000, 2397916) - - - - -.. math:: - - 223606 - - - -So, we can compute the rank, then the offset, then the row value. - -.. code:: ipython2 - - def rank_of(n): - return int(mfloor(sqrt(n - 1) / 2 - 0.5) + 1) - - - def offset_of(n, k): - return (n - 2 + 4 * k * (k - 1)) % (2 * k) - - - def row_value(k, i): - return abs(i - (k - 1)) + k - - - def aoc20173(n): - k = rank_of(n) - i = offset_of(n, k) - return row_value(k, i) - -.. code:: ipython2 - - aoc20173(23) - - - - -.. math:: - - 2 - - - -.. code:: ipython2 - - aoc20173(23000) - - - - -.. math:: - - 105 - - - -.. code:: ipython2 - - aoc20173(23000000000000) - - - - -.. math:: - - 4572225 - - - -.. code:: ipython2 - - %time aoc20173(23000000000000000000000000) # Fast for large values. - - -.. parsed-literal:: - - CPU times: user 0 ns, sys: 0 ns, total: 0 ns - Wall time: 20 µs - - - - -.. math:: - - 2690062495969 - - - -A Joy Version -============= - -At this point I feel confident that I can implement a concise version of -this code in Joy. ;-) - -.. code:: ipython2 - - from notebook_preamble import J, V, define - -``rank_of`` -~~~~~~~~~~~ - -:: - - n rank_of - --------------- - k - -The translation is straightforward. - -:: - - int(floor(sqrt(n - 1) / 2 - 0.5) + 1) - - rank_of == -- sqrt 2 / 0.5 - floor ++ - -.. code:: ipython2 - - define('rank_of == -- sqrt 2 / 0.5 - floor ++') - -``offset_of`` -~~~~~~~~~~~~~ - -:: - - n k offset_of - ------------------- - i - - (n - 2 + 4 * k * (k - 1)) % (2 * k) - -A little tricky... - -:: - - n k dup 2 * - n k k 2 * - n k k*2 [Q] dip % - n k Q k*2 % - - n k dup -- - n k k -- - n k k-1 4 * * 2 + - - n k*k-1*4 2 + - - n k*k-1*4+2 - - n-k*k-1*4+2 - - n-k*k-1*4+2 k*2 % - n-k*k-1*4+2%k*2 - -Ergo: - -:: - - offset_of == dup 2 * [dup -- 4 * * 2 + -] dip % - -.. code:: ipython2 - - define('offset_of == dup 2 * [dup -- 4 * * 2 + -] dip %') - -``row_value`` -~~~~~~~~~~~~~ - -:: - - k i row_value - ------------------- - n - - abs(i - (k - 1)) + k - - k i over -- - abs + - k i k -- - abs + - k i k-1 - abs + - k i-k-1 abs + - k |i-k-1| + - k+|i-k-1| - -.. code:: ipython2 - - define('row_value == over -- - abs +') - -``aoc2017.3`` -~~~~~~~~~~~~~ - -:: - - n aoc2017.3 - ----------------- - m - - n dup rank_of - n k [offset_of] dupdip - n k offset_of k - i k swap row_value - k i row_value - m - -.. code:: ipython2 - - define('aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value') - -.. code:: ipython2 - - J('23 aoc2017.3') - - -.. parsed-literal:: - - 2 - - -.. code:: ipython2 - - J('23000 aoc2017.3') - - -.. parsed-literal:: - - 105 - - -.. code:: ipython2 - - V('23000000000000 aoc2017.3') - - -.. parsed-literal:: - - . 23000000000000 aoc2017.3 - 23000000000000 . aoc2017.3 - 23000000000000 . dup rank_of [offset_of] dupdip swap row_value - 23000000000000 23000000000000 . rank_of [offset_of] dupdip swap row_value - 23000000000000 23000000000000 . -- sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 22999999999999 . sqrt 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 4795831.523312615 . 2 / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 4795831.523312615 2 . / 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915.7616563076 . 0.5 - floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915.7616563076 0.5 . - floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915.2616563076 . floor ++ [offset_of] dupdip swap row_value - 23000000000000 2397915 . ++ [offset_of] dupdip swap row_value - 23000000000000 2397916 . [offset_of] dupdip swap row_value - 23000000000000 2397916 [offset_of] . dupdip swap row_value - 23000000000000 2397916 . offset_of 2397916 swap row_value - 23000000000000 2397916 . dup 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 2397916 . 2 * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 2397916 2 . * [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 4795832 . [dup -- 4 * * 2 + -] dip % 2397916 swap row_value - 23000000000000 2397916 4795832 [dup -- 4 * * 2 + -] . dip % 2397916 swap row_value - 23000000000000 2397916 . dup -- 4 * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 2397916 . -- 4 * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 2397915 . 4 * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 2397915 4 . * * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 2397916 9591660 . * 2 + - 4795832 % 2397916 swap row_value - 23000000000000 22999994980560 . 2 + - 4795832 % 2397916 swap row_value - 23000000000000 22999994980560 2 . + - 4795832 % 2397916 swap row_value - 23000000000000 22999994980562 . - 4795832 % 2397916 swap row_value - 5019438 . 4795832 % 2397916 swap row_value - 5019438 4795832 . % 2397916 swap row_value - 223606 . 2397916 swap row_value - 223606 2397916 . swap row_value - 2397916 223606 . row_value - 2397916 223606 . over -- - abs + - 2397916 223606 2397916 . -- - abs + - 2397916 223606 2397915 . - abs + - 2397916 -2174309 . abs + - 2397916 2174309 . + - 4572225 . - - -:: - - rank_of == -- sqrt 2 / 0.5 - floor ++ - offset_of == dup 2 * [dup -- 4 * * 2 + -] dip % - row_value == over -- - abs + - - aoc2017.3 == dup rank_of [offset_of] dupdip swap row_value diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_29_0.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_29_0.png deleted file mode 100644 index 4e6c0d8105a3e02cc67806fc99c23e123c9b13c8..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 677 zcmeAS@N?(olHy`uVBq!ia0vp^H9#!F!VDz$PIuV_qznRlLR|m<{|{sm5A^RYs0OO$ zFA4GsW-yw0cX!!)rL?o10wJqir0@Fm0;M<$JR*x382FBWFymBhK4}I9CI(Lz#}Es_ z+>o=`!j3YvCi1h-s^z}0e<1fINaI;RlmORD$JZN07Pc#i-P(Py+w$e5X#b;^y!mt& zeqAJ9ykSdKro$`WKL-{~PdZ?)5a!a-a_sx;oBcCY`OBW|{r-FJnKuT~2iy)%>(sg; zoVVHY!Pi~e=1A?a4&5!YDnIl4#jmWXXAACJbe*2PW8br5KlbtNG29aHUO2AQ^0}D> z&kupwHELFeSkkLL?fa9kXUCGzC(~}9Sbs6=4b$V=*x8S-B(HaqV3)h_=~|9?yz9?N zVcj2-La)lqiu22hJU`UwZ-o>)@!d8CLCXBbmz06 zg#Ft!Uzik5AD4bI?@x1+?EOn=U*3i675lFDvETiz@GBp7jj!Q*8|G|y{C>;K9W&C) zT_2g(hMq2O+<1T2Ti4B&w{zZUD!R94JNcHMVZZ0}==1k!OEf;7`I)|0~bl(EVAVbB&E_{~pJQI?@ccZH|kHys7y0qT+h^ zlDGV)Ok=$EykL$u49uJ;Tvp>Xd*bUmRhGKfpZxq#ZFb<3)=P`8u}|_&cnSvA{CXJ2 zU=tkoX4m0|0gu$4TvF?JbSlt1XvR~uvxlBc_AHna@ObjZn9a@U;oG+^yd=LSuxn*- ocjhdeWxavB3{Q#Vf0=)^zV>q4wf=LaM?opg)78&qol`;+0Q4#{D*ylh diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_35_1.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_35_1.png deleted file mode 100644 index d4b2fdacb40507ac71b4171402ef9933c2f503ba..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 566 zcmeAS@N?(olHy`uVBq!ia0vp^?m*1X!VDx`rk>XYQU(D&A+G=b{|7RO2l{sxR0CD> zmjw9*Gbqj6Z6vU|)8+l$vt=P^8Cl1*fKr?V9+AZi417mGm~pB$pELsl<3vvv#}EzC z-U+teGJzs(^E<1{dv>p0+WM?}^&xn9yxOOZ-k&dVa?`Iucx z<3>cr;s}=Trnybsy*GTdJARsNnr%^;eq4S6v+?(P#q)pfdoH81{r+LDxKKmed>NzJ zwvGop3=Y=bC|;i^@_QN|SGi61n#!oh7W)iW+Y~)G#J>4_@Qfx`ztvYN7$@6YNY(t^ zm~+v`k2_2262G^>+r7NLbFHRqJoxQa*@pdxRxbEn#UdInu*ukd%C)}op6?U?&vat; zGD(WoKb96TEog;{Jpa;?*-l>`slezsH-o{wX%%AX6Z+m6iToI`--wUE=_C1+( zNWSmyb0IyBQ}1Unzf?VZ=A1-nc;{oOv+o`Y+^$_Dt^Km%8t=mDT>VSiZU;ZIeR#LLL)5^33b6eRCchn1TnL0U(chySY z-7#Zj*OG&Wa@Opaz*53vl$7>(Rd=OR$ga#F$Aw#hq>o2rU4FUqyKT4e4vB^LAKj^c zKJWY8&-=>dE9}182&H=7W4G?NVcdQD_rvyYs$9p@Z{?mjv%T!9>+iFEcXr>dxO$RL zaLaxUh5es;x7nmrPOJ5N8$5$IY<67huKat?{}nB||Nj27ruTE(-b5N+o3&EYl(}%? zA77a_D!V%^j|5I?tTaqp@3_dxQ04lGI}1Xz%{0P-PL(vD{=hAszFqaZMzS#TDyctg z=}H!&8;(Y_dVV`J-O$?JeV5NVw~yC;D7_9|s`+XE^U@7`wh^s8EyvgMug>}-81vfV z$C}J4oygnsTB;;A`ZmW-xHD~o*sFiPSR`-%7WvFR=at37jcsXd$yQS~F#p_oGP&%p znGUPrZ-LKw-cd7WCO?_-(bxCI6M3!2%Y^l0<0|h>Y-Sh0m zaoxJRPcrZAW_&HB@_f^3N0mLkr^Jp2EHO8EsIWidm*V-_^*yRG8}FxH{1hzOy>qjQ z-@NI^)!)20xIIj{-`iB^+WdtpZf#^f*Al(qeKF_hu8zCCEzb{X8!t=IJoR?EQg8Oc z(-yX_PXBmZk3CCDWS8NHo3>&7^l<*9vg?r(*KSz6MV3?D+#u;jMVR$h3DNKMDS!HW zk2b|v2&{PZ-Bg`5@r>Q`xO?Rv-13^fd_9u6E0xPixcW5f)%Bu!C$_d#U)sMQKry)N zL!;N?J5!H;W48RoU(K((vtW&FwD*rI&yCK{XkO*5U85B9SvhfCf#L;s1A*PQ*2Wip zV7R$oLvJ?grN*BU$J->&tz;;%yz*noFN-a!d~GuvrGBpJGB4fvee>J6*6_oO4`0^R zbF)9bs(kD6thWha_ud`J;k)f$wd6$KiS8pdSKU%oVoRF;^j}ata(MB_dZ}Kq&DXBH rS|qRfC(xtZ(k%MC_?^cW*1zOqmgSHA_TY^VC|7#A`njxgN@xNAaBjfq diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_42_0.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_42_0.png deleted file mode 100644 index 02b91a14fc1bb906259233e7a3ca6335a3c190ac..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 655 zcmeAS@N?(olHy`uVBq!ia0vp^oj|O`!VDx!n^JcHDT4r?5ZC|z{{xxC1O2-Ts)4Hc zOM?7@83fMWH41sZdS+Rg((X=|N30*&fKr?V9+AZi417mGm~pB$pELsl<10@W#}E(R zw^R0eA9fHqzW@3nU*DCk?1h^ay?CHx#o@GZ@oc}mMSXr^?1GLW)0H}`JY5g|<9wuI zal=ty`?;nUYP)W9DXdsgKHbEAp64DG_xv6EzVChi{PfqQydSP-YYD4f^xgP$D~G22 z%EcU-3`;ZCfBUQ9`uo2~GSj=AZ)z&_t#r*@=go{;ST^6zK(+9>bD*Wc)0SO-t0o1- zywJaWEq6E1nmZyJH|Yo}ZN0Tb{F=%0rN6S@#<|NL-8KEq`q*kY)x%3S9Nh2WIj!-W z?~4>Z#rHzb!&mw#Mi$3=+O~2Q$X`%5pRh_}*%sdJtK294$MIJAHPqhxGN!+FPxi`Bx_|pR_k3P4@zJ$CyJs2+oc~~~+ijZ^IN$rTf`RUf z5XR{fgD1^**uG$^*Du{7uHO!qcP+S?_44lAMY^`@cTAms_vN)#k@CLe6f&SeE)j-w! zB|(0{3?c6YR?jRuo2InesMF;x&)R2wKq<}wkH}&M2EHR8%s5q>Pnv;&@r$R6V~7Xu z+o`*~4+n@G+i&9QwWU{KhxlDn=Yzi8`~?@oR&ZF|aJ{%vHpb;bo*rLl!G(nu7B3fc zSBuZ(`evWuc+fROpyt8id&R3~sBPc5ah+Vo`IF`Q?%U?(=W+efwOSiiv9vw#RmLJw zi)mF4l#SOOxbXks{oENJ*e_>2+EKnnx8=Lcvb5<=6?@mCW!@zMU0w zP)pf#c%HI5-$dlXm2W@M8W37GuOpWIOlP?;n(I*nVFnLXEVBT_6^R^RL`YDc& zva=jj)0tOJIn@07#Ur0LHG20s%;jvV^V6So#AoS8{JgaMZEaz$kL;$}fX6#DCLgTm zKBCFK`IU9*`wqo3F^=4g8s>8CKbD&o=Vs-nNm!hC7S)w@$PTQA*Y5lG^nBKF{G)LZ8H X>0Z;Tq(8VE0;MibS3j3^P6 zmjw9*GYF(9t$u$uWMzdvg1q<<`5TvRKy z=jzp%|3<9l&8KI#aqm98Zo<3c?>1@wD_$!5A^Y3iZmm0=Hg?DL1WS+3vgy^*^AK7n zR?69Q!*h?CXG@e+dEZw-*GvV2B|#59Ex8w|wQG94o}Ag;zlUvfFRxprl9ac_P=0Py zdgRW2*Gq@nBEpWcOkZ;HtCcp>ft|Zjp4xq?-Dh%g?N%1O3+GRLUF!MHQ!skYZ=QmA z-wX7%?K|{3mN9E;>X+oxdWV*(R@pw-V|^g5@SWkmGYoIbyF$bEAG;`5x8lW~SE~y1 zmt0Dyf4=fUtuO1_Pv>tQfB4~D!46;EX;SCc)>TD{o)1XhWAM9sks;R`=clV5-BG)y zX0xl!lB=Llc*TXd2fS%kY9UWucl@mlkv>x0R0veqRp9?NX=>nEet&VEWnS0wbGI*= zTCi+C|H0}v-amIvHT&kKQoR3Rs=|GqB(DqWET-$8$zAkqcG}YBs`f_{8xI$s`fsIpQ}g%Vne}p}lI3;1v%M>3tUh<}Qpc&s-gnmQzwv0szvZz?-(9}* zZMe*_!>m3OxaW_?x( zo4$P-`|_=2*R{NA3braoZ`qZ0{lU}cw_@M=zh9pcy=dj8-DPT%-!D^+p7-n*v)j8h U&+3mncLgO~Pgg&ebxsLQ051txiU0rr diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_49_1.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_49_1.png deleted file mode 100644 index d4b2fdacb40507ac71b4171402ef9933c2f503ba..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 566 zcmeAS@N?(olHy`uVBq!ia0vp^?m*1X!VDx`rk>XYQU(D&A+G=b{|7RO2l{sxR0CD> zmjw9*Gbqj6Z6vU|)8+l$vt=P^8Cl1*fKr?V9+AZi417mGm~pB$pELsl<3vvv#}EzC z-U+teGJzs(^E<1{dv>p0+WM?}^&xn9yxOOZ-k&dVa?`Iucx z<3>cr;s}=Trnybsy*GTdJARsNnr%^;eq4S6v+?(P#q)pfdoH81{r+LDxKKmed>NzJ zwvGop3=Y=bC|;i^@_QN|SGi61n#!oh7W)iW+Y~)G#J>4_@Qfx`ztvYN7$@6YNY(t^ zm~+v`k2_2262G^>+r7NLbFHRqJoxQa*@pdxRxbEn#UdInu*ukd%C)}op6?U?&vat; zGD(WoKb96TEog;{Jpa;?*-l>`slezsH-o{wX%%AX6Z+m6iToI`--wUE=_C1+( zNWSmyb0IyBQ}1Unzf?VZ=A1-nc;{oOv+o`Y+^$_Dt^Km%8t=mDT>VSiZU;ZIeXYQU(D&A+G=b{|7RO2l{sxR0CD> zmjw9*Gbqj6Z6vU|)8+l$vt=P^8Cl1*fKr?V9+AZi417mGm~pB$pELsl<3vvv#}EzC z-U+teGJzs(^E<1{dv>p0+WM?}^&xn9yxOOZ-k&dVa?`Iucx z<3>cr;s}=Trnybsy*GTdJARsNnr%^;eq4S6v+?(P#q)pfdoH81{r+LDxKKmed>NzJ zwvGop3=Y=bC|;i^@_QN|SGi61n#!oh7W)iW+Y~)G#J>4_@Qfx`ztvYN7$@6YNY(t^ zm~+v`k2_2262G^>+r7NLbFHRqJoxQa*@pdxRxbEn#UdInu*ukd%C)}op6?U?&vat; zGD(WoKb96TEog;{Jpa;?*-l>`slezsH-o{wX%%AX6Z+m6iToI`--wUE=_C1+( zNWSmyb0IyBQ}1Unzf?VZ=A1-nc;{oOv+o`Y+^$_Dt^Km%8t=mDT>VSiZU;ZIe zmjw9*Gbqj6Z6vU|)8+l$vt=P^8Cl1*fKr?V9+AaBtB!y$<5X=vX$A&H1y2{p5D7`s z2@Cz14Mp1bb5GGt_U7Z^d}SoWF*C-g>6Yb_F2@B190oegsZE{699LL4+>98-8jtoW zY%ux5JX=}9L%^Y|`t)c%*@lyBJ z$i?gSY~;4>S3f*sWrx=Kf;YY179FyF!c#BtHkwLgrSoh#!gu4@>q(zDV;`S+m-m(B zHt(h0c9&X@n*6iNey-;fTesEA{R^|^mFR0ZF*km?zjI2Rb=B80Ha~K6?&(c7FJ2n% znZM)NH6abRNl|AU&))GUR9Vcs_n@)k3x&H`Y3JvygTe~ HDWM4frKPJP diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_59_0.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_59_0.png deleted file mode 100644 index ed4ba2d85e9c8aac157462ca2c776d3769f66d46..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 239 zcmeAS@N?(olHy`uVBq!ia0vp^oIuRS!VDz&cWKWCQn~>?A+G=b{|7RO1P81(F90g# zD+%%oW>A{B+elz_r_1}hXUjr%$Ss-#l;JG!h%5#wI0C|qQ?>b|fr5UXE{-7_vdIY{ zMr8>J9LWjw2Mm?Ypr|?a;{=KOTXflJRtDnm{r-UW|nLIq~ diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_60_0.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_60_0.png deleted file mode 100644 index 9034b06d391e37f1d37d53d068d241a62fd8a843..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 337 zcmeAS@N?(olHy`uVBq!ia0vp^vOvtw!VDx|Exx%1NErn9gt-3y{~yRC9_Zg)Pz_Yg zUlQaO%n^&v?n35jjaUyKX54YCboQXgDMOh_pG p_3q#S8{Je!X8$GH0hUq>4EKK;w4Tv*Ed{!p!PC{xWt~$(696YZZ|?vA diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_61_0.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_61_0.png deleted file mode 100644 index 5714d79cbea05d35fe616d3dcb9280d4a62c9b72..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 447 zcmeAS@N?(olHy`uVBq!ia0vp^9ze{`!VDz0&YQ9TNErn9gt-3y{~yRC9_Zg)Pz_Yg zUlQaO%wRP0?(VYpN@-_11wvN4NZr3a(~UrJ_V9}b&*~R!v*5HVDZK3ZoM+dLEgiuQFCHm%JksL` z((t%=R6ZbZ#g*rKD_g&tIa}@U>eWBrU-ebL}dHP(Fo<&J5FuAmW#k$PnYLxY( zwp;lPmppn&iWa0nI-;7HghHxc1P$<6yAH0cDtu@Pss7UvhAC4gR#;7??0KHm?}%oO80Vu;=t3@&t;ucLK6VP C#Hqgk diff --git a/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_62_1.png b/docs/Advent of Code 2017 December 3rd_files/Advent of Code 2017 December 3rd_62_1.png deleted file mode 100644 index 1a257f5a92e8c02b385645c82e3c98f8dc36971d..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 784 zcmeAS@N?(olHy`uVBq!ia0vp^tw7Ar!VDxW?h9@NQU(D&A+G=b{|7RO2l{sxR0CD> zmjw9*Gbqj6Z6vU|)8+l$vt=P^8Cl1*fKr?V9+AZi417mGm~pB$pELslQ?{pzV~B?6 z(#!rHB8d{mKfeDrb8cz*T-jZsEr&0~@8R)uT;8T&V^yJXra5{_po^YTl}C}@+}MRp zT&K?ozFk<)epz)#~9y@1M-dK@rlTbeSu$;MFsySDSSzak>}Z zIBYBN;aKj?+hRS1JkS0{%)1s<6q+@w^G|{4de38}WBNaytUX+z zI$M3GthQI6aoVk`GHG9Srd)H%6HC1tT)+CW?}6Hz$Is566!@;#C?9FeR=5<0M^<+TIQ;pololaHm zoApke`RsQ1`G)y=+xu##)q1ooHp+6z_jc3j?@ZAMo4HYQ+0Sijf94yq&)y)j;Y-<@ zEB5I#58av|_i(+I^G5ae7em+VJhydCTI?B%4-rPI9x?AbQxbP}OR06}p<9fJiv`j& z{8j{>IOMYSs-{oybE vbRlP6#QL@~>mL5yWF>AADgLzJ|L>p7rA;5F9~Hmk0!q}Lu6{1-oD!M - - -Advent of Code 2017 December 4th - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Advent of Code 2017

December 4th

To ensure security, a valid passphrase must contain no duplicate words.

-

For example:

-
    -
  • aa bb cc dd ee is valid.
    • -
  • aa bb cc dd aa is not valid - the word aa appears more than once.
    • -
  • aa bb cc dd aaa is valid - aa and aaa count as different words.
    • -
-

The system's full passphrase list is available as your puzzle input. How many passphrases are valid?

- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import J, V, define
-
- -
-
-
- -
-
-
-
-
-

I'll assume the input is a Joy sequence of sequences of integers.

- -
[[5 1 9 5]
- [7 5 4 3]
- [2 4 6 8]]
-
-
-

So, obviously, the initial form will be a step function:

- -
AoC2017.4 == 0 swap [F +] step
- -
-
-
-
-
-
-
- -
F == [size] [unique size] cleave =
- -
-
-
-
-
-
-
-

The step_zero combinator includes the 0 swap that would normally open one of these definitions:

- -
-
-
-
-
-
In [2]:
-
-
-
J('[step_zero] help')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0 roll> step
-
-
-
-
- -
-
- -
-
-
-
-
- -
AoC2017.4 == [F +] step_zero
- -
-
-
-
-
-
In [3]:
-
-
-
define('AoC2017.4 == [[size] [unique size] cleave = +] step_zero')
-
- -
-
-
- -
-
-
-
In [4]:
-
-
-
J('''
-
-[[5 1 9 5]
- [7 5 4 3]
- [2 4 6 8]] AoC2017.4
-
-''')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/Advent of Code 2017 December 4th.ipynb b/docs/Advent of Code 2017 December 4th.ipynb deleted file mode 100644 index cd1bd55..0000000 --- a/docs/Advent of Code 2017 December 4th.ipynb +++ /dev/null @@ -1,139 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Advent of Code 2017\n", - "\n", - "## December 4th\n", - "To ensure security, a valid passphrase must contain no duplicate words.\n", - "\n", - "For example:\n", - "\n", - "* aa bb cc dd ee is valid.\n", - "* aa bb cc dd aa is not valid - the word aa appears more than once.\n", - "* aa bb cc dd aaa is valid - aa and aaa count as different words.\n", - "\n", - "The system's full passphrase list is available as your puzzle input. How many passphrases are valid?" - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "I'll assume the input is a Joy sequence of sequences of integers.\n", - "\n", - " [[5 1 9 5]\n", - " [7 5 4 3]\n", - " [2 4 6 8]]\n", - "\n", - "So, obviously, the initial form will be a `step` function:\n", - "\n", - " AoC2017.4 == 0 swap [F +] step" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "\n", - " F == [size] [unique size] cleave =\n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The `step_zero` combinator includes the `0 swap` that would normally open one of these definitions:" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0 roll> step\n", - "\n" - ] - } - ], - "source": [ - "J('[step_zero] help')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " AoC2017.4 == [F +] step_zero" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [], - "source": [ - "define('AoC2017.4 == [[size] [unique size] cleave = +] step_zero')" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('''\n", - "\n", - "[[5 1 9 5]\n", - " [7 5 4 3]\n", - " [2 4 6 8]] AoC2017.4\n", - "\n", - "''')" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Advent of Code 2017 December 4th.md b/docs/Advent of Code 2017 December 4th.md deleted file mode 100644 index 96f3c29..0000000 --- a/docs/Advent of Code 2017 December 4th.md +++ /dev/null @@ -1,64 +0,0 @@ - -# Advent of Code 2017 - -## December 4th -To ensure security, a valid passphrase must contain no duplicate words. - -For example: - -* aa bb cc dd ee is valid. -* aa bb cc dd aa is not valid - the word aa appears more than once. -* aa bb cc dd aaa is valid - aa and aaa count as different words. - -The system's full passphrase list is available as your puzzle input. How many passphrases are valid? - - -```python -from notebook_preamble import J, V, define -``` - -I'll assume the input is a Joy sequence of sequences of integers. - - [[5 1 9 5] - [7 5 4 3] - [2 4 6 8]] - -So, obviously, the initial form will be a `step` function: - - AoC2017.4 == 0 swap [F +] step - - - F == [size] [unique size] cleave = - - -The `step_zero` combinator includes the `0 swap` that would normally open one of these definitions: - - -```python -J('[step_zero] help') -``` - - 0 roll> step - - - - AoC2017.4 == [F +] step_zero - - -```python -define('AoC2017.4 == [[size] [unique size] cleave = +] step_zero') -``` - - -```python -J(''' - -[[5 1 9 5] - [7 5 4 3] - [2 4 6 8]] AoC2017.4 - -''') -``` - - 2 - diff --git a/docs/Advent of Code 2017 December 4th.rst b/docs/Advent of Code 2017 December 4th.rst deleted file mode 100644 index e51ca12..0000000 --- a/docs/Advent of Code 2017 December 4th.rst +++ /dev/null @@ -1,77 +0,0 @@ - -Advent of Code 2017 -=================== - -December 4th ------------- - -To ensure security, a valid passphrase must contain no duplicate words. - -For example: - -- aa bb cc dd ee is valid. -- aa bb cc dd aa is not valid - the word aa appears more than once. -- aa bb cc dd aaa is valid - aa and aaa count as different words. - -The system's full passphrase list is available as your puzzle input. How -many passphrases are valid? - -.. code:: ipython2 - - from notebook_preamble import J, V, define - -I'll assume the input is a Joy sequence of sequences of integers. - -:: - - [[5 1 9 5] - [7 5 4 3] - [2 4 6 8]] - -So, obviously, the initial form will be a ``step`` function: - -:: - - AoC2017.4 == 0 swap [F +] step - -:: - - F == [size] [unique size] cleave = - -The ``step_zero`` combinator includes the ``0 swap`` that would normally -open one of these definitions: - -.. code:: ipython2 - - J('[step_zero] help') - - -.. parsed-literal:: - - 0 roll> step - - - -:: - - AoC2017.4 == [F +] step_zero - -.. code:: ipython2 - - define('AoC2017.4 == [[size] [unique size] cleave = +] step_zero') - -.. code:: ipython2 - - J(''' - - [[5 1 9 5] - [7 5 4 3] - [2 4 6 8]] AoC2017.4 - - ''') - - -.. parsed-literal:: - - 2 - diff --git a/docs/Advent of Code 2017 December 5th.html b/docs/Advent of Code 2017 December 5th.html deleted file mode 100644 index 3ec5535..0000000 --- a/docs/Advent of Code 2017 December 5th.html +++ /dev/null @@ -1,12207 +0,0 @@ - - - -Advent of Code 2017 December 5th - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Advent of Code 2017

December 5th

...a list of the offsets for each jump. Jumps are relative: -1 moves to the previous instruction, and 2 skips the next one. Start at the first instruction in the list. The goal is to follow the jumps until one leads outside the list.

-

In addition, these instructions are a little strange; after each jump, the offset of that instruction increases by 1. So, if you come across an offset of 3, you would move three instructions forward, but change it to a 4 for the next time it is encountered.

-

For example, consider the following list of jump offsets:

- -
0
-3
-0
-1
--3
-
-
-

Positive jumps ("forward") move downward; negative jumps move upward. For legibility in this example, these offset values will be written all on one line, with the current instruction marked in parentheses. The following steps would be taken before an exit is found:

-
    -
  • (0) 3 0 1 -3 - before we have taken any steps.
    • -
  • (1) 3 0 1 -3 - jump with offset 0 (that is, don't jump at all). Fortunately, the instruction is then incremented to 1.
    • -
  • 2 (3) 0 1 -3 - step forward because of the instruction we just modified. The first instruction is incremented again, now to 2.
    • -
  • 2 4 0 1 (-3) - jump all the way to the end; leave a 4 behind.
    • -
  • 2 (4) 0 1 -2 - go back to where we just were; increment -3 to -2.
    • -
  • 2 5 0 1 -2 - jump 4 steps forward, escaping the maze.
    • -
-

In this example, the exit is reached in 5 steps.

-

How many steps does it take to reach the exit?

- -
-
-
-
-
-
-
-

Breakdown

For now, I'm going to assume a starting state with the size of the sequence pre-computed. We need it to define the exit condition and it is a trivial preamble to generate it. We then need and index and a step-count, which are both initially zero. Then we have the sequence itself, and some recursive function F that does the work.

- -
   size index step-count [...] F
------------------------------------
-            step-count
-
-F == [P] [T] [R1] [R2] genrec
-
-
-

Later on I was thinking about it and the Forth heuristic came to mind, to wit: four things on the stack are kind of much. Immediately I realized that the size properly belongs in the predicate of F! D'oh!

- -
   index step-count [...] F
-------------------------------
-         step-count
- -
-
-
-
-
-
-
-

So, let's start by nailing down the predicate:

- -
F == [P] [T] [R1]   [R2] genrec
-  == [P] [T] [R1 [F] R2] ifte
-
-0 0 [0 3 0 1 -3] popop 5 >=
-
-P == popop 5 >=
- -
-
-
-
-
-
-
-

Now we need the else-part:

- -
index step-count [0 3 0 1 -3] roll< popop
-
-E == roll< popop
- -
-
-
-
-
-
-
-

Last but not least, the recursive branch

- -
0 0 [0 3 0 1 -3] R1 [F] R2
-
-
-

The R1 function has a big job:

- -
R1 == get the value at index
-      increment the value at the index
-      add the value gotten to the index
-      increment the step count
-
-
-

The only tricky thing there is incrementing an integer in the sequence. Joy sequences are not particularly good for random access. We could encode the list of jump offsets in a big integer and use math to do the processing for a good speed-up, but it still wouldn't beat the performance of e.g. a mutable array. This is just one of those places where "plain vanilla" Joypy doesn't shine (in default performance. The legendary Sufficiently-Smart Compiler would of course rewrite this function to use an array "under the hood".)

-

In the meantime, I'm going to write a primitive function that just does what we need.

- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import D, J, V, define
-from joy.library import SimpleFunctionWrapper
-from joy.utils.stack import list_to_stack
-
-
-@SimpleFunctionWrapper
-def incr_at(stack):
-    '''Given a index and a sequence of integers, increment the integer at the index.
-
-    E.g.:
-
-       3 [0 1 2 3 4 5] incr_at
-    -----------------------------
-         [0 1 2 4 4 5]
-    
-    '''
-    sequence, (i, stack) = stack
-    mem = []
-    while i >= 0:
-        term, sequence = sequence
-        mem.append(term)
-        i -= 1
-    mem[-1] += 1
-    return list_to_stack(mem, sequence), stack
-
-
-D['incr_at'] = incr_at
-
- -
-
-
- -
-
-
-
In [2]:
-
-
-
J('3 [0 1 2 3 4 5] incr_at')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[0 1 2 4 4 5]
-
-
-
- -
-
- -
-
-
-
-
-

get the value at index

-
3 0 [0 1 2 3 4] [roll< at] nullary
-3 0 [0 1 2 n 4] n
- -
-
-
-
-
-
-
-

increment the value at the index

-
3 0 [0 1 2 n 4] n [Q] dip
-3 0 [0 1 2 n 4] Q n
-3 0 [0 1 2 n 4] [popd incr_at] unary n
-3 0 [0 1 2 n+1 4] n
- -
-
-
-
-
-
-
-

add the value gotten to the index

-
3 0 [0 1 2 n+1 4] n [+] cons dipd
-3 0 [0 1 2 n+1 4] [n +]      dipd
-3 n + 0 [0 1 2 n+1 4]
-3+n   0 [0 1 2 n+1 4]
- -
-
-
-
-
-
-
-

increment the step count

-
3+n 0 [0 1 2 n+1 4] [++] dip
-3+n 1 [0 1 2 n+1 4]
- -
-
-
-
-
-
-
-

All together now...

-
get_value == [roll< at] nullary
-incr_value == [[popd incr_at] unary] dip
-add_value == [+] cons dipd
-incr_step_count == [++] dip
-
-R1 == get_value incr_value add_value incr_step_count
-
-F == [P] [T] [R1] primrec
-
-F == [popop !size! >=] [roll< pop] [get_value incr_value add_value incr_step_count] primrec
- -
-
-
-
-
-
In [3]:
-
-
-
from joy.library import DefinitionWrapper
-
-
-DefinitionWrapper.add_definitions('''
-
-      get_value == [roll< at] nullary
-     incr_value == [[popd incr_at] unary] dip
-      add_value == [+] cons dipd
-incr_step_count == [++] dip
-
-     AoC2017.5.0 == get_value incr_value add_value incr_step_count
-
-''', D)
-
- -
-
-
- -
-
-
-
In [4]:
-
-
-
define('F == [popop 5 >=] [roll< popop] [AoC2017.5.0] primrec')
-
- -
-
-
- -
-
-
-
In [5]:
-
-
-
J('0 0 [0 3 0 1 -3] F')
-
- -
-
-
- -
-
- - -
- -
- - -
-
5
-
-
-
- -
-
- -
-
-
-
-
-

Preamble for setting up predicate, index, and step-count

We want to go from this to this:

- -
   [...] AoC2017.5.preamble
-------------------------------
-    0 0 [...] [popop n >=]
-
-
-

Where n is the size of the sequence.

-

The first part is obviously 0 0 roll<, then dup size:

- -
[...] 0 0 roll< dup size
-0 0 [...] n
-
-
-

Then:

- -
0 0 [...] n [>=] cons [popop] swoncat
-
-
-

So:

- -
init-index-and-step-count == 0 0 roll<
-prepare-predicate == dup size [>=] cons [popop] swoncat
-
-AoC2017.5.preamble == init-index-and-step-count prepare-predicate
- -
-
-
-
-
-
In [6]:
-
-
-
DefinitionWrapper.add_definitions('''
-
-init-index-and-step-count == 0 0 roll<
-        prepare-predicate == dup size [>=] cons [popop] swoncat
-
-       AoC2017.5.preamble == init-index-and-step-count prepare-predicate
-
-                AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec
-
-''', D)
-
- -
-
-
- -
-
-
-
In [7]:
-
-
-
J('[0 3 0 1 -3] AoC2017.5')
-
- -
-
-
- -
-
- - -
- -
- - -
-
5
-
-
-
- -
-
- -
-
-
-
-
- -
                AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec
-
-              AoC2017.5.0 == get_value incr_value add_value incr_step_count
-       AoC2017.5.preamble == init-index-and-step-count prepare-predicate
-
-                get_value == [roll< at] nullary
-               incr_value == [[popd incr_at] unary] dip
-                add_value == [+] cons dipd
-          incr_step_count == [++] dip
-
-init-index-and-step-count == 0 0 roll<
-        prepare-predicate == dup size [>=] cons [popop] swoncat
- -
-
-
-
-
-
-
-

This is by far the largest program I have yet written in Joy. Even with the incr_at function it is still a bear. There may be an arrangement of the parameters that would permit more elegant definitions, but it still wouldn't be as efficient as something written in assembly, C, or even Python.

- -
-
-
-
-
- - - - - - diff --git a/docs/Advent of Code 2017 December 5th.ipynb b/docs/Advent of Code 2017 December 5th.ipynb deleted file mode 100644 index 32d264e..0000000 --- a/docs/Advent of Code 2017 December 5th.ipynb +++ /dev/null @@ -1,380 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Advent of Code 2017\n", - "\n", - "## December 5th\n", - "...a list of the offsets for each jump. Jumps are relative: -1 moves to the previous instruction, and 2 skips the next one. Start at the first instruction in the list. The goal is to follow the jumps until one leads outside the list.\n", - "\n", - "In addition, these instructions are a little strange; after each jump, the offset of that instruction increases by 1. So, if you come across an offset of 3, you would move three instructions forward, but change it to a 4 for the next time it is encountered.\n", - "\n", - "For example, consider the following list of jump offsets:\n", - "\n", - " 0\n", - " 3\n", - " 0\n", - " 1\n", - " -3\n", - "\n", - "Positive jumps (\"forward\") move downward; negative jumps move upward. For legibility in this example, these offset values will be written all on one line, with the current instruction marked in parentheses. The following steps would be taken before an exit is found:\n", - "\n", - "* (0) 3 0 1 -3 - before we have taken any steps.\n", - "* (1) 3 0 1 -3 - jump with offset 0 (that is, don't jump at all). Fortunately, the instruction is then incremented to 1.\n", - "* 2 (3) 0 1 -3 - step forward because of the instruction we just modified. The first instruction is incremented again, now to 2.\n", - "* 2 4 0 1 (-3) - jump all the way to the end; leave a 4 behind.\n", - "* 2 (4) 0 1 -2 - go back to where we just were; increment -3 to -2.\n", - "* 2 5 0 1 -2 - jump 4 steps forward, escaping the maze.\n", - "\n", - "In this example, the exit is reached in 5 steps.\n", - "\n", - "How many steps does it take to reach the exit?" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Breakdown\n", - "For now, I'm going to assume a starting state with the size of the sequence pre-computed. We need it to define the exit condition and it is a trivial preamble to generate it. We then need and `index` and a `step-count`, which are both initially zero. Then we have the sequence itself, and some recursive function `F` that does the work.\n", - "\n", - " size index step-count [...] F\n", - " -----------------------------------\n", - " step-count\n", - "\n", - " F == [P] [T] [R1] [R2] genrec\n", - "\n", - "Later on I was thinking about it and the Forth heuristic came to mind, to wit: four things on the stack are kind of much. Immediately I realized that the size properly belongs in the predicate of `F`! D'oh!\n", - "\n", - " index step-count [...] F\n", - " ------------------------------\n", - " step-count" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "So, let's start by nailing down the predicate:\n", - "\n", - " F == [P] [T] [R1] [R2] genrec\n", - " == [P] [T] [R1 [F] R2] ifte\n", - "\n", - " 0 0 [0 3 0 1 -3] popop 5 >=\n", - "\n", - " P == popop 5 >=" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we need the else-part:\n", - "\n", - " index step-count [0 3 0 1 -3] roll< popop\n", - "\n", - " E == roll< popop" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Last but not least, the recursive branch\n", - "\n", - " 0 0 [0 3 0 1 -3] R1 [F] R2\n", - "\n", - "The `R1` function has a big job:\n", - "\n", - " R1 == get the value at index\n", - " increment the value at the index\n", - " add the value gotten to the index\n", - " increment the step count\n", - "\n", - "The only tricky thing there is incrementing an integer in the sequence. Joy sequences are not particularly good for random access. We could encode the list of jump offsets in a big integer and use math to do the processing for a good speed-up, but it still wouldn't beat the performance of e.g. a mutable array. This is just one of those places where \"plain vanilla\" Joypy doesn't shine (in default performance. The legendary *Sufficiently-Smart Compiler* would of course rewrite this function to use an array \"under the hood\".)\n", - "\n", - "In the meantime, I'm going to write a primitive function that just does what we need." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import D, J, V, define\n", - "from joy.library import SimpleFunctionWrapper\n", - "from joy.utils.stack import list_to_stack\n", - "\n", - "\n", - "@SimpleFunctionWrapper\n", - "def incr_at(stack):\n", - " '''Given a index and a sequence of integers, increment the integer at the index.\n", - "\n", - " E.g.:\n", - "\n", - " 3 [0 1 2 3 4 5] incr_at\n", - " -----------------------------\n", - " [0 1 2 4 4 5]\n", - " \n", - " '''\n", - " sequence, (i, stack) = stack\n", - " mem = []\n", - " while i >= 0:\n", - " term, sequence = sequence\n", - " mem.append(term)\n", - " i -= 1\n", - " mem[-1] += 1\n", - " return list_to_stack(mem, sequence), stack\n", - "\n", - "\n", - "D['incr_at'] = incr_at" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[0 1 2 4 4 5]\n" - ] - } - ], - "source": [ - "J('3 [0 1 2 3 4 5] incr_at')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### get the value at index\n", - "\n", - " 3 0 [0 1 2 3 4] [roll< at] nullary\n", - " 3 0 [0 1 2 n 4] n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### increment the value at the index\n", - "\n", - " 3 0 [0 1 2 n 4] n [Q] dip\n", - " 3 0 [0 1 2 n 4] Q n\n", - " 3 0 [0 1 2 n 4] [popd incr_at] unary n\n", - " 3 0 [0 1 2 n+1 4] n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### add the value gotten to the index\n", - "\n", - " 3 0 [0 1 2 n+1 4] n [+] cons dipd\n", - " 3 0 [0 1 2 n+1 4] [n +] dipd\n", - " 3 n + 0 [0 1 2 n+1 4]\n", - " 3+n 0 [0 1 2 n+1 4]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### increment the step count\n", - "\n", - " 3+n 0 [0 1 2 n+1 4] [++] dip\n", - " 3+n 1 [0 1 2 n+1 4]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### All together now...\n", - "\n", - " get_value == [roll< at] nullary\n", - " incr_value == [[popd incr_at] unary] dip\n", - " add_value == [+] cons dipd\n", - " incr_step_count == [++] dip\n", - "\n", - " R1 == get_value incr_value add_value incr_step_count\n", - "\n", - " F == [P] [T] [R1] primrec\n", - " \n", - " F == [popop !size! >=] [roll< pop] [get_value incr_value add_value incr_step_count] primrec" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [], - "source": [ - "from joy.library import DefinitionWrapper\n", - "\n", - "\n", - "DefinitionWrapper.add_definitions('''\n", - "\n", - " get_value == [roll< at] nullary\n", - " incr_value == [[popd incr_at] unary] dip\n", - " add_value == [+] cons dipd\n", - "incr_step_count == [++] dip\n", - "\n", - " AoC2017.5.0 == get_value incr_value add_value incr_step_count\n", - "\n", - "''', D)" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [], - "source": [ - "define('F == [popop 5 >=] [roll< popop] [AoC2017.5.0] primrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "5\n" - ] - } - ], - "source": [ - "J('0 0 [0 3 0 1 -3] F')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Preamble for setting up predicate, `index`, and `step-count`\n", - "\n", - "We want to go from this to this:\n", - "\n", - " [...] AoC2017.5.preamble\n", - " ------------------------------\n", - " 0 0 [...] [popop n >=]\n", - "\n", - "Where `n` is the size of the sequence.\n", - "\n", - "The first part is obviously `0 0 roll<`, then `dup size`:\n", - "\n", - " [...] 0 0 roll< dup size\n", - " 0 0 [...] n\n", - "\n", - "Then:\n", - "\n", - " 0 0 [...] n [>=] cons [popop] swoncat\n", - "\n", - "So:\n", - "\n", - " init-index-and-step-count == 0 0 roll<\n", - " prepare-predicate == dup size [>=] cons [popop] swoncat\n", - "\n", - " AoC2017.5.preamble == init-index-and-step-count prepare-predicate" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [], - "source": [ - "DefinitionWrapper.add_definitions('''\n", - "\n", - "init-index-and-step-count == 0 0 roll<\n", - " prepare-predicate == dup size [>=] cons [popop] swoncat\n", - "\n", - " AoC2017.5.preamble == init-index-and-step-count prepare-predicate\n", - "\n", - " AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec\n", - "\n", - "''', D)" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "5\n" - ] - } - ], - "source": [ - "J('[0 3 0 1 -3] AoC2017.5')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "\n", - " AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec\n", - "\n", - " AoC2017.5.0 == get_value incr_value add_value incr_step_count\n", - " AoC2017.5.preamble == init-index-and-step-count prepare-predicate\n", - "\n", - " get_value == [roll< at] nullary\n", - " incr_value == [[popd incr_at] unary] dip\n", - " add_value == [+] cons dipd\n", - " incr_step_count == [++] dip\n", - "\n", - " init-index-and-step-count == 0 0 roll<\n", - " prepare-predicate == dup size [>=] cons [popop] swoncat\n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "This is by far the largest program I have yet written in Joy. Even with the `incr_at` function it is still a bear. There may be an arrangement of the parameters that would permit more elegant definitions, but it still wouldn't be as efficient as something written in assembly, C, or even Python." - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Advent of Code 2017 December 5th.md b/docs/Advent of Code 2017 December 5th.md deleted file mode 100644 index 8edfe6f..0000000 --- a/docs/Advent of Code 2017 December 5th.md +++ /dev/null @@ -1,244 +0,0 @@ - -# Advent of Code 2017 - -## December 5th -...a list of the offsets for each jump. Jumps are relative: -1 moves to the previous instruction, and 2 skips the next one. Start at the first instruction in the list. The goal is to follow the jumps until one leads outside the list. - -In addition, these instructions are a little strange; after each jump, the offset of that instruction increases by 1. So, if you come across an offset of 3, you would move three instructions forward, but change it to a 4 for the next time it is encountered. - -For example, consider the following list of jump offsets: - - 0 - 3 - 0 - 1 - -3 - -Positive jumps ("forward") move downward; negative jumps move upward. For legibility in this example, these offset values will be written all on one line, with the current instruction marked in parentheses. The following steps would be taken before an exit is found: - -* (0) 3 0 1 -3 - before we have taken any steps. -* (1) 3 0 1 -3 - jump with offset 0 (that is, don't jump at all). Fortunately, the instruction is then incremented to 1. -* 2 (3) 0 1 -3 - step forward because of the instruction we just modified. The first instruction is incremented again, now to 2. -* 2 4 0 1 (-3) - jump all the way to the end; leave a 4 behind. -* 2 (4) 0 1 -2 - go back to where we just were; increment -3 to -2. -* 2 5 0 1 -2 - jump 4 steps forward, escaping the maze. - -In this example, the exit is reached in 5 steps. - -How many steps does it take to reach the exit? - -## Breakdown -For now, I'm going to assume a starting state with the size of the sequence pre-computed. We need it to define the exit condition and it is a trivial preamble to generate it. We then need and `index` and a `step-count`, which are both initially zero. Then we have the sequence itself, and some recursive function `F` that does the work. - - size index step-count [...] F - ----------------------------------- - step-count - - F == [P] [T] [R1] [R2] genrec - -Later on I was thinking about it and the Forth heuristic came to mind, to wit: four things on the stack are kind of much. Immediately I realized that the size properly belongs in the predicate of `F`! D'oh! - - index step-count [...] F - ------------------------------ - step-count - -So, let's start by nailing down the predicate: - - F == [P] [T] [R1] [R2] genrec - == [P] [T] [R1 [F] R2] ifte - - 0 0 [0 3 0 1 -3] popop 5 >= - - P == popop 5 >= - -Now we need the else-part: - - index step-count [0 3 0 1 -3] roll< popop - - E == roll< popop - -Last but not least, the recursive branch - - 0 0 [0 3 0 1 -3] R1 [F] R2 - -The `R1` function has a big job: - - R1 == get the value at index - increment the value at the index - add the value gotten to the index - increment the step count - -The only tricky thing there is incrementing an integer in the sequence. Joy sequences are not particularly good for random access. We could encode the list of jump offsets in a big integer and use math to do the processing for a good speed-up, but it still wouldn't beat the performance of e.g. a mutable array. This is just one of those places where "plain vanilla" Joypy doesn't shine (in default performance. The legendary *Sufficiently-Smart Compiler* would of course rewrite this function to use an array "under the hood".) - -In the meantime, I'm going to write a primitive function that just does what we need. - - -```python -from notebook_preamble import D, J, V, define -from joy.library import SimpleFunctionWrapper -from joy.utils.stack import list_to_stack - - -@SimpleFunctionWrapper -def incr_at(stack): - '''Given a index and a sequence of integers, increment the integer at the index. - - E.g.: - - 3 [0 1 2 3 4 5] incr_at - ----------------------------- - [0 1 2 4 4 5] - - ''' - sequence, (i, stack) = stack - mem = [] - while i >= 0: - term, sequence = sequence - mem.append(term) - i -= 1 - mem[-1] += 1 - return list_to_stack(mem, sequence), stack - - -D['incr_at'] = incr_at -``` - - -```python -J('3 [0 1 2 3 4 5] incr_at') -``` - - [0 1 2 4 4 5] - - -### get the value at index - - 3 0 [0 1 2 3 4] [roll< at] nullary - 3 0 [0 1 2 n 4] n - -### increment the value at the index - - 3 0 [0 1 2 n 4] n [Q] dip - 3 0 [0 1 2 n 4] Q n - 3 0 [0 1 2 n 4] [popd incr_at] unary n - 3 0 [0 1 2 n+1 4] n - -### add the value gotten to the index - - 3 0 [0 1 2 n+1 4] n [+] cons dipd - 3 0 [0 1 2 n+1 4] [n +] dipd - 3 n + 0 [0 1 2 n+1 4] - 3+n 0 [0 1 2 n+1 4] - -### increment the step count - - 3+n 0 [0 1 2 n+1 4] [++] dip - 3+n 1 [0 1 2 n+1 4] - -### All together now... - - get_value == [roll< at] nullary - incr_value == [[popd incr_at] unary] dip - add_value == [+] cons dipd - incr_step_count == [++] dip - - R1 == get_value incr_value add_value incr_step_count - - F == [P] [T] [R1] primrec - - F == [popop !size! >=] [roll< pop] [get_value incr_value add_value incr_step_count] primrec - - -```python -from joy.library import DefinitionWrapper - - -DefinitionWrapper.add_definitions(''' - - get_value == [roll< at] nullary - incr_value == [[popd incr_at] unary] dip - add_value == [+] cons dipd -incr_step_count == [++] dip - - AoC2017.5.0 == get_value incr_value add_value incr_step_count - -''', D) -``` - - -```python -define('F == [popop 5 >=] [roll< popop] [AoC2017.5.0] primrec') -``` - - -```python -J('0 0 [0 3 0 1 -3] F') -``` - - 5 - - -### Preamble for setting up predicate, `index`, and `step-count` - -We want to go from this to this: - - [...] AoC2017.5.preamble - ------------------------------ - 0 0 [...] [popop n >=] - -Where `n` is the size of the sequence. - -The first part is obviously `0 0 roll<`, then `dup size`: - - [...] 0 0 roll< dup size - 0 0 [...] n - -Then: - - 0 0 [...] n [>=] cons [popop] swoncat - -So: - - init-index-and-step-count == 0 0 roll< - prepare-predicate == dup size [>=] cons [popop] swoncat - - AoC2017.5.preamble == init-index-and-step-count prepare-predicate - - -```python -DefinitionWrapper.add_definitions(''' - -init-index-and-step-count == 0 0 roll< - prepare-predicate == dup size [>=] cons [popop] swoncat - - AoC2017.5.preamble == init-index-and-step-count prepare-predicate - - AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec - -''', D) -``` - - -```python -J('[0 3 0 1 -3] AoC2017.5') -``` - - 5 - - - - AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec - - AoC2017.5.0 == get_value incr_value add_value incr_step_count - AoC2017.5.preamble == init-index-and-step-count prepare-predicate - - get_value == [roll< at] nullary - incr_value == [[popd incr_at] unary] dip - add_value == [+] cons dipd - incr_step_count == [++] dip - - init-index-and-step-count == 0 0 roll< - prepare-predicate == dup size [>=] cons [popop] swoncat - - -This is by far the largest program I have yet written in Joy. Even with the `incr_at` function it is still a bear. There may be an arrangement of the parameters that would permit more elegant definitions, but it still wouldn't be as efficient as something written in assembly, C, or even Python. diff --git a/docs/Advent of Code 2017 December 5th.rst b/docs/Advent of Code 2017 December 5th.rst deleted file mode 100644 index 5040c69..0000000 --- a/docs/Advent of Code 2017 December 5th.rst +++ /dev/null @@ -1,324 +0,0 @@ - -Advent of Code 2017 -=================== - -December 5th ------------- - -...a list of the offsets for each jump. Jumps are relative: -1 moves to -the previous instruction, and 2 skips the next one. Start at the first -instruction in the list. The goal is to follow the jumps until one leads -outside the list. - -In addition, these instructions are a little strange; after each jump, -the offset of that instruction increases by 1. So, if you come across an -offset of 3, you would move three instructions forward, but change it to -a 4 for the next time it is encountered. - -For example, consider the following list of jump offsets: - -:: - - 0 - 3 - 0 - 1 - -3 - -Positive jumps ("forward") move downward; negative jumps move upward. -For legibility in this example, these offset values will be written all -on one line, with the current instruction marked in parentheses. The -following steps would be taken before an exit is found: - -- - - (0) 3 0 1 -3 - before we have taken any steps. - -- - - (1) 3 0 1 -3 - jump with offset 0 (that is, don't jump at all). - Fortunately, the instruction is then incremented to 1. - -- 2 (3) 0 1 -3 - step forward because of the instruction we just - modified. The first instruction is incremented again, now to 2. -- 2 4 0 1 (-3) - jump all the way to the end; leave a 4 behind. -- 2 (4) 0 1 -2 - go back to where we just were; increment -3 to -2. -- 2 5 0 1 -2 - jump 4 steps forward, escaping the maze. - -In this example, the exit is reached in 5 steps. - -How many steps does it take to reach the exit? - -Breakdown ---------- - -For now, I'm going to assume a starting state with the size of the -sequence pre-computed. We need it to define the exit condition and it is -a trivial preamble to generate it. We then need and ``index`` and a -``step-count``, which are both initially zero. Then we have the sequence -itself, and some recursive function ``F`` that does the work. - -:: - - size index step-count [...] F - ----------------------------------- - step-count - - F == [P] [T] [R1] [R2] genrec - -Later on I was thinking about it and the Forth heuristic came to mind, -to wit: four things on the stack are kind of much. Immediately I -realized that the size properly belongs in the predicate of ``F``! D'oh! - -:: - - index step-count [...] F - ------------------------------ - step-count - -So, let's start by nailing down the predicate: - -:: - - F == [P] [T] [R1] [R2] genrec - == [P] [T] [R1 [F] R2] ifte - - 0 0 [0 3 0 1 -3] popop 5 >= - - P == popop 5 >= - -Now we need the else-part: - -:: - - index step-count [0 3 0 1 -3] roll< popop - - E == roll< popop - -Last but not least, the recursive branch - -:: - - 0 0 [0 3 0 1 -3] R1 [F] R2 - -The ``R1`` function has a big job: - -:: - - R1 == get the value at index - increment the value at the index - add the value gotten to the index - increment the step count - -The only tricky thing there is incrementing an integer in the sequence. -Joy sequences are not particularly good for random access. We could -encode the list of jump offsets in a big integer and use math to do the -processing for a good speed-up, but it still wouldn't beat the -performance of e.g. a mutable array. This is just one of those places -where "plain vanilla" Joypy doesn't shine (in default performance. The -legendary *Sufficiently-Smart Compiler* would of course rewrite this -function to use an array "under the hood".) - -In the meantime, I'm going to write a primitive function that just does -what we need. - -.. code:: ipython2 - - from notebook_preamble import D, J, V, define - from joy.library import SimpleFunctionWrapper - from joy.utils.stack import list_to_stack - - - @SimpleFunctionWrapper - def incr_at(stack): - '''Given a index and a sequence of integers, increment the integer at the index. - - E.g.: - - 3 [0 1 2 3 4 5] incr_at - ----------------------------- - [0 1 2 4 4 5] - - ''' - sequence, (i, stack) = stack - mem = [] - while i >= 0: - term, sequence = sequence - mem.append(term) - i -= 1 - mem[-1] += 1 - return list_to_stack(mem, sequence), stack - - - D['incr_at'] = incr_at - -.. code:: ipython2 - - J('3 [0 1 2 3 4 5] incr_at') - - -.. parsed-literal:: - - [0 1 2 4 4 5] - - -get the value at index -~~~~~~~~~~~~~~~~~~~~~~ - -:: - - 3 0 [0 1 2 3 4] [roll< at] nullary - 3 0 [0 1 2 n 4] n - -increment the value at the index -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - 3 0 [0 1 2 n 4] n [Q] dip - 3 0 [0 1 2 n 4] Q n - 3 0 [0 1 2 n 4] [popd incr_at] unary n - 3 0 [0 1 2 n+1 4] n - -add the value gotten to the index -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - 3 0 [0 1 2 n+1 4] n [+] cons dipd - 3 0 [0 1 2 n+1 4] [n +] dipd - 3 n + 0 [0 1 2 n+1 4] - 3+n 0 [0 1 2 n+1 4] - -increment the step count -~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - 3+n 0 [0 1 2 n+1 4] [++] dip - 3+n 1 [0 1 2 n+1 4] - -All together now... -~~~~~~~~~~~~~~~~~~~ - -:: - - get_value == [roll< at] nullary - incr_value == [[popd incr_at] unary] dip - add_value == [+] cons dipd - incr_step_count == [++] dip - - R1 == get_value incr_value add_value incr_step_count - - F == [P] [T] [R1] primrec - - F == [popop !size! >=] [roll< pop] [get_value incr_value add_value incr_step_count] primrec - -.. code:: ipython2 - - from joy.library import DefinitionWrapper - - - DefinitionWrapper.add_definitions(''' - - get_value == [roll< at] nullary - incr_value == [[popd incr_at] unary] dip - add_value == [+] cons dipd - incr_step_count == [++] dip - - AoC2017.5.0 == get_value incr_value add_value incr_step_count - - ''', D) - -.. code:: ipython2 - - define('F == [popop 5 >=] [roll< popop] [AoC2017.5.0] primrec') - -.. code:: ipython2 - - J('0 0 [0 3 0 1 -3] F') - - -.. parsed-literal:: - - 5 - - -Preamble for setting up predicate, ``index``, and ``step-count`` -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -We want to go from this to this: - -:: - - [...] AoC2017.5.preamble - ------------------------------ - 0 0 [...] [popop n >=] - -Where ``n`` is the size of the sequence. - -The first part is obviously ``0 0 roll<``, then ``dup size``: - -:: - - [...] 0 0 roll< dup size - 0 0 [...] n - -Then: - -:: - - 0 0 [...] n [>=] cons [popop] swoncat - -So: - -:: - - init-index-and-step-count == 0 0 roll< - prepare-predicate == dup size [>=] cons [popop] swoncat - - AoC2017.5.preamble == init-index-and-step-count prepare-predicate - -.. code:: ipython2 - - DefinitionWrapper.add_definitions(''' - - init-index-and-step-count == 0 0 roll< - prepare-predicate == dup size [>=] cons [popop] swoncat - - AoC2017.5.preamble == init-index-and-step-count prepare-predicate - - AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec - - ''', D) - -.. code:: ipython2 - - J('[0 3 0 1 -3] AoC2017.5') - - -.. parsed-literal:: - - 5 - - -:: - - AoC2017.5 == AoC2017.5.preamble [roll< popop] [AoC2017.5.0] primrec - - AoC2017.5.0 == get_value incr_value add_value incr_step_count - AoC2017.5.preamble == init-index-and-step-count prepare-predicate - - get_value == [roll< at] nullary - incr_value == [[popd incr_at] unary] dip - add_value == [+] cons dipd - incr_step_count == [++] dip - - init-index-and-step-count == 0 0 roll< - prepare-predicate == dup size [>=] cons [popop] swoncat - -This is by far the largest program I have yet written in Joy. Even with -the ``incr_at`` function it is still a bear. There may be an arrangement -of the parameters that would permit more elegant definitions, but it -still wouldn't be as efficient as something written in assembly, C, or -even Python. diff --git a/docs/Advent of Code 2017 December 6th.html b/docs/Advent of Code 2017 December 6th.html deleted file mode 100644 index 7fcb072..0000000 --- a/docs/Advent of Code 2017 December 6th.html +++ /dev/null @@ -1,12415 +0,0 @@ - - - -Advent of Code 2017 December 6th - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Advent of Code 2017

December 6th

-
[0 2 7 0] dup max
- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import D, J, V, define
-
- -
-
-
- -
-
-
-
In [2]:
-
-
-
J('[0 2 7 0] dup max')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[0 2 7 0] 7
-
-
-
- -
-
- -
-
-
-
In [3]:
-
-
-
from joy.library import SimpleFunctionWrapper
-from joy.utils.stack import list_to_stack
-
-
-@SimpleFunctionWrapper
-def index_of(stack):
-    '''Given a sequence and a item, return the index of the item, or -1 if not found.
-
-    E.g.:
-
-       [a b c] a index_of
-    ------------------------
-               0
-
-       [a b c] d index_of
-    ------------------------
-            -1
-
-    '''
-    item, (sequence, stack) = stack
-    i = 0
-    while sequence:
-        term, sequence = sequence
-        if term == item:
-            break
-        i += 1
-    else:
-        i = -1
-    return i, stack
-
-
-D['index_of'] = index_of
-
- -
-
-
- -
-
-
-
In [4]:
-
-
-
J('[0 2 7 0] 7 index_of')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2
-
-
-
- -
-
- -
-
-
-
In [5]:
-
-
-
J('[0 2 7 0] 23 index_of')
-
- -
-
-
- -
-
- - -
- -
- - -
-
-1
-
-
-
- -
-
- -
-
-
-
-
-

Starting at index distribute count "blocks" to the "banks" in the sequence.

- -
[...] count index distribute
-----------------------------
-           [...]
-
-
-

This seems like it would be a PITA to implement in Joypy...

- -
-
-
-
-
-
In [6]:
-
-
-
from joy.utils.stack import iter_stack, list_to_stack
-
-
-@SimpleFunctionWrapper
-def distribute(stack):
-    '''Starting at index+1 distribute count "blocks" to the "banks" in the sequence.
-
-    [...] count index distribute
-    ----------------------------
-               [...]
-
-    '''
-    index, (count, (sequence, stack)) = stack
-    assert count >= 0
-    cheat = list(iter_stack(sequence))
-    n = len(cheat)
-    assert index < n
-    cheat[index] = 0
-    while count:
-        index += 1
-        index %= n
-        cheat[index] += 1
-        count -= 1
-    return list_to_stack(cheat), stack
-
-
-D['distribute'] = distribute
-
- -
-
-
- -
-
-
-
In [7]:
-
-
-
J('[0 2 7 0] dup max [index_of] nullary distribute')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[2 4 1 2]
-
-
-
- -
-
- -
-
-
-
In [8]:
-
-
-
J('[2 4 1 2] dup max [index_of] nullary distribute')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[3 1 2 3]
-
-
-
- -
-
- -
-
-
-
In [9]:
-
-
-
J('[3 1 2 3] dup max [index_of] nullary distribute')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[0 2 3 4]
-
-
-
- -
-
- -
-
-
-
In [10]:
-
-
-
J('[0 2 3 4] dup max [index_of] nullary distribute')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 3 4 1]
-
-
-
- -
-
- -
-
-
-
In [11]:
-
-
-
J('[1 3 4 1] dup max [index_of] nullary distribute')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[2 4 1 2]
-
-
-
- -
-
- -
-
-
-
-
-

Recalling "Generator Programs"

-
[a F] x
-[a F] a F 
-
-[a F] a swap [C] dip rest cons
-a   [a F]    [C] dip rest cons
-a C [a F]            rest cons
-a C   [F]                 cons
-
-w/ C == dup G
-
-a dup G [F] cons
-a a   G [F] cons
-
-w/ G == dup max [index_of] nullary distribute
- -
-
-
-
-
-
In [12]:
-
-
-
define('direco == dip rest cons')
-
- -
-
-
- -
-
-
-
In [13]:
-
-
-
define('G == [direco] cons [swap] swoncat cons')
-
- -
-
-
- -
-
-
-
In [14]:
-
-
-
define('make_distributor == [dup dup max [index_of] nullary distribute] G')
-
- -
-
-
- -
-
-
-
In [15]:
-
-
-
J('[0 2 7 0] make_distributor 6 [x] times pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[0 2 7 0] [2 4 1 2] [3 1 2 3] [0 2 3 4] [1 3 4 1] [2 4 1 2]
-
-
-
- -
-
- -
-
-
-
-
-

A function to drive a generator and count how many states before a repeat.

First draft:

- -
[] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
-
-
-

(?)

- -
[]       [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
-[] [...] [GEN]   [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
-[] [...] [GEN]    pop index_of 0 >=
-[] [...]              index_of 0 >=
-                            -1 0 >=
-                             False
-
-
-

Base case

- -
[] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
-[] [...] [GEN]                      pop size --
-[] [...]                                size --
-[] [...]                                size --
-
-
-

A mistake, popop and no need for --

- -
[] [...] [GEN] popop size
-[]                   size
-n
-
-
-

Recursive case

- -
[] [...] [GEN] [pop index_of 0 >=] [popop size] [[swons] dip x] primrec
-[] [...] [GEN]                                   [swons] dip x  F
-[] [...] swons [GEN]                                         x  F
-[[...]]        [GEN]                                         x  F
-[[...]] [...]  [GEN]                                            F
-
-[[...]] [...] [GEN] F
-
-
-

What have we learned?

- -
F == [pop index_of 0 >=] [popop size] [[swons] dip x] primrec
- -
-
-
-
-
-
In [16]:
-
-
-
define('count_states == [] swap x [pop index_of 0 >=] [popop size] [[swons] dip x] primrec')
-
- -
-
-
- -
-
-
-
In [17]:
-
-
-
define('AoC2017.6 == make_distributor count_states')
-
- -
-
-
- -
-
-
-
In [18]:
-
-
-
J('[0 2 7 0] AoC2017.6')
-
- -
-
-
- -
-
- - -
- -
- - -
-
5
-
-
-
- -
-
- -
-
-
-
In [19]:
-
-
-
J('[1 1 1] AoC2017.6')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4
-
-
-
- -
-
- -
-
-
-
In [20]:
-
-
-
J('[8 0 0 0 0 0] AoC2017.6')
-
- -
-
-
- -
-
- - -
- -
- - -
-
15
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/Advent of Code 2017 December 6th.ipynb b/docs/Advent of Code 2017 December 6th.ipynb deleted file mode 100644 index 6d7f188..0000000 --- a/docs/Advent of Code 2017 December 6th.ipynb +++ /dev/null @@ -1,457 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Advent of Code 2017\n", - "\n", - "## December 6th\n", - "\n", - "\n", - " [0 2 7 0] dup max\n" - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import D, J, V, define" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[0 2 7 0] 7\n" - ] - } - ], - "source": [ - "J('[0 2 7 0] dup max')" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [], - "source": [ - "from joy.library import SimpleFunctionWrapper\n", - "from joy.utils.stack import list_to_stack\n", - "\n", - "\n", - "@SimpleFunctionWrapper\n", - "def index_of(stack):\n", - " '''Given a sequence and a item, return the index of the item, or -1 if not found.\n", - "\n", - " E.g.:\n", - "\n", - " [a b c] a index_of\n", - " ------------------------\n", - " 0\n", - "\n", - " [a b c] d index_of\n", - " ------------------------\n", - " -1\n", - "\n", - " '''\n", - " item, (sequence, stack) = stack\n", - " i = 0\n", - " while sequence:\n", - " term, sequence = sequence\n", - " if term == item:\n", - " break\n", - " i += 1\n", - " else:\n", - " i = -1\n", - " return i, stack\n", - "\n", - "\n", - "D['index_of'] = index_of" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2\n" - ] - } - ], - "source": [ - "J('[0 2 7 0] 7 index_of')" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "-1\n" - ] - } - ], - "source": [ - "J('[0 2 7 0] 23 index_of')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Starting at `index` distribute `count` \"blocks\" to the \"banks\" in the sequence.\n", - "\n", - " [...] count index distribute\n", - " ----------------------------\n", - " [...]\n", - "\n", - "This seems like it would be a PITA to implement in Joypy..." - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [], - "source": [ - "from joy.utils.stack import iter_stack, list_to_stack\n", - "\n", - "\n", - "@SimpleFunctionWrapper\n", - "def distribute(stack):\n", - " '''Starting at index+1 distribute count \"blocks\" to the \"banks\" in the sequence.\n", - "\n", - " [...] count index distribute\n", - " ----------------------------\n", - " [...]\n", - "\n", - " '''\n", - " index, (count, (sequence, stack)) = stack\n", - " assert count >= 0\n", - " cheat = list(iter_stack(sequence))\n", - " n = len(cheat)\n", - " assert index < n\n", - " cheat[index] = 0\n", - " while count:\n", - " index += 1\n", - " index %= n\n", - " cheat[index] += 1\n", - " count -= 1\n", - " return list_to_stack(cheat), stack\n", - "\n", - "\n", - "D['distribute'] = distribute" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[2 4 1 2]\n" - ] - } - ], - "source": [ - "J('[0 2 7 0] dup max [index_of] nullary distribute')" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[3 1 2 3]\n" - ] - } - ], - "source": [ - "J('[2 4 1 2] dup max [index_of] nullary distribute')" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[0 2 3 4]\n" - ] - } - ], - "source": [ - "J('[3 1 2 3] dup max [index_of] nullary distribute')" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 3 4 1]\n" - ] - } - ], - "source": [ - "J('[0 2 3 4] dup max [index_of] nullary distribute')" - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[2 4 1 2]\n" - ] - } - ], - "source": [ - "J('[1 3 4 1] dup max [index_of] nullary distribute')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Recalling \"Generator Programs\"\n", - "\n", - " [a F] x\n", - " [a F] a F \n", - " \n", - " [a F] a swap [C] dip rest cons\n", - " a [a F] [C] dip rest cons\n", - " a C [a F] rest cons\n", - " a C [F] cons\n", - "\n", - " w/ C == dup G\n", - "\n", - " a dup G [F] cons\n", - " a a G [F] cons\n", - "\n", - " w/ G == dup max [index_of] nullary distribute" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [], - "source": [ - "define('direco == dip rest cons')" - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [], - "source": [ - "define('G == [direco] cons [swap] swoncat cons')" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [], - "source": [ - "define('make_distributor == [dup dup max [index_of] nullary distribute] G')" - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[0 2 7 0] [2 4 1 2] [3 1 2 3] [0 2 3 4] [1 3 4 1] [2 4 1 2]\n" - ] - } - ], - "source": [ - "J('[0 2 7 0] make_distributor 6 [x] times pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### A function to drive a generator and count how many states before a repeat.\n", - "First draft:\n", - "\n", - " [] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec\n", - "\n", - "(?)\n", - "\n", - " [] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec\n", - " [] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec\n", - " [] [...] [GEN] pop index_of 0 >=\n", - " [] [...] index_of 0 >=\n", - " -1 0 >=\n", - " False\n", - "\n", - "Base case\n", - "\n", - " [] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec\n", - " [] [...] [GEN] pop size --\n", - " [] [...] size --\n", - " [] [...] size --\n", - "\n", - "A mistake, `popop` and no need for `--`\n", - "\n", - " [] [...] [GEN] popop size\n", - " [] size\n", - " n\n", - "\n", - "Recursive case\n", - "\n", - " [] [...] [GEN] [pop index_of 0 >=] [popop size] [[swons] dip x] primrec\n", - " [] [...] [GEN] [swons] dip x F\n", - " [] [...] swons [GEN] x F\n", - " [[...]] [GEN] x F\n", - " [[...]] [...] [GEN] F\n", - "\n", - " [[...]] [...] [GEN] F\n", - "\n", - "What have we learned?\n", - "\n", - " F == [pop index_of 0 >=] [popop size] [[swons] dip x] primrec" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [], - "source": [ - "define('count_states == [] swap x [pop index_of 0 >=] [popop size] [[swons] dip x] primrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": {}, - "outputs": [], - "source": [ - "define('AoC2017.6 == make_distributor count_states')" - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "5\n" - ] - } - ], - "source": [ - "J('[0 2 7 0] AoC2017.6')" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4\n" - ] - } - ], - "source": [ - "J('[1 1 1] AoC2017.6')" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "15\n" - ] - } - ], - "source": [ - "J('[8 0 0 0 0 0] AoC2017.6')" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.13" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Advent of Code 2017 December 6th.md b/docs/Advent of Code 2017 December 6th.md deleted file mode 100644 index 0697b11..0000000 --- a/docs/Advent of Code 2017 December 6th.md +++ /dev/null @@ -1,267 +0,0 @@ - -# Advent of Code 2017 - -## December 6th - - - [0 2 7 0] dup max - - - -```python -from notebook_preamble import D, J, V, define -``` - - -```python -J('[0 2 7 0] dup max') -``` - - [0 2 7 0] 7 - - - -```python -from joy.library import SimpleFunctionWrapper -from joy.utils.stack import list_to_stack - - -@SimpleFunctionWrapper -def index_of(stack): - '''Given a sequence and a item, return the index of the item, or -1 if not found. - - E.g.: - - [a b c] a index_of - ------------------------ - 0 - - [a b c] d index_of - ------------------------ - -1 - - ''' - item, (sequence, stack) = stack - i = 0 - while sequence: - term, sequence = sequence - if term == item: - break - i += 1 - else: - i = -1 - return i, stack - - -D['index_of'] = index_of -``` - - -```python -J('[0 2 7 0] 7 index_of') -``` - - 2 - - - -```python -J('[0 2 7 0] 23 index_of') -``` - - -1 - - -Starting at `index` distribute `count` "blocks" to the "banks" in the sequence. - - [...] count index distribute - ---------------------------- - [...] - -This seems like it would be a PITA to implement in Joypy... - - -```python -from joy.utils.stack import iter_stack, list_to_stack - - -@SimpleFunctionWrapper -def distribute(stack): - '''Starting at index+1 distribute count "blocks" to the "banks" in the sequence. - - [...] count index distribute - ---------------------------- - [...] - - ''' - index, (count, (sequence, stack)) = stack - assert count >= 0 - cheat = list(iter_stack(sequence)) - n = len(cheat) - assert index < n - cheat[index] = 0 - while count: - index += 1 - index %= n - cheat[index] += 1 - count -= 1 - return list_to_stack(cheat), stack - - -D['distribute'] = distribute -``` - - -```python -J('[0 2 7 0] dup max [index_of] nullary distribute') -``` - - [2 4 1 2] - - - -```python -J('[2 4 1 2] dup max [index_of] nullary distribute') -``` - - [3 1 2 3] - - - -```python -J('[3 1 2 3] dup max [index_of] nullary distribute') -``` - - [0 2 3 4] - - - -```python -J('[0 2 3 4] dup max [index_of] nullary distribute') -``` - - [1 3 4 1] - - - -```python -J('[1 3 4 1] dup max [index_of] nullary distribute') -``` - - [2 4 1 2] - - -### Recalling "Generator Programs" - - [a F] x - [a F] a F - - [a F] a swap [C] dip rest cons - a [a F] [C] dip rest cons - a C [a F] rest cons - a C [F] cons - - w/ C == dup G - - a dup G [F] cons - a a G [F] cons - - w/ G == dup max [index_of] nullary distribute - - -```python -define('direco == dip rest cons') -``` - - -```python -define('G == [direco] cons [swap] swoncat cons') -``` - - -```python -define('make_distributor == [dup dup max [index_of] nullary distribute] G') -``` - - -```python -J('[0 2 7 0] make_distributor 6 [x] times pop') -``` - - [0 2 7 0] [2 4 1 2] [3 1 2 3] [0 2 3 4] [1 3 4 1] [2 4 1 2] - - -### A function to drive a generator and count how many states before a repeat. -First draft: - - [] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - -(?) - - [] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - [] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - [] [...] [GEN] pop index_of 0 >= - [] [...] index_of 0 >= - -1 0 >= - False - -Base case - - [] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - [] [...] [GEN] pop size -- - [] [...] size -- - [] [...] size -- - -A mistake, `popop` and no need for `--` - - [] [...] [GEN] popop size - [] size - n - -Recursive case - - [] [...] [GEN] [pop index_of 0 >=] [popop size] [[swons] dip x] primrec - [] [...] [GEN] [swons] dip x F - [] [...] swons [GEN] x F - [[...]] [GEN] x F - [[...]] [...] [GEN] F - - [[...]] [...] [GEN] F - -What have we learned? - - F == [pop index_of 0 >=] [popop size] [[swons] dip x] primrec - - -```python -define('count_states == [] swap x [pop index_of 0 >=] [popop size] [[swons] dip x] primrec') -``` - - -```python -define('AoC2017.6 == make_distributor count_states') -``` - - -```python -J('[0 2 7 0] AoC2017.6') -``` - - 5 - - - -```python -J('[1 1 1] AoC2017.6') -``` - - 4 - - - -```python -J('[8 0 0 0 0 0] AoC2017.6') -``` - - 15 - diff --git a/docs/Advent of Code 2017 December 6th.rst b/docs/Advent of Code 2017 December 6th.rst deleted file mode 100644 index 5da2f1b..0000000 --- a/docs/Advent of Code 2017 December 6th.rst +++ /dev/null @@ -1,305 +0,0 @@ - -Advent of Code 2017 -=================== - -December 6th ------------- - -:: - - [0 2 7 0] dup max - -.. code:: ipython2 - - from notebook_preamble import D, J, V, define - -.. code:: ipython2 - - J('[0 2 7 0] dup max') - - -.. parsed-literal:: - - [0 2 7 0] 7 - - -.. code:: ipython2 - - from joy.library import SimpleFunctionWrapper - from joy.utils.stack import list_to_stack - - - @SimpleFunctionWrapper - def index_of(stack): - '''Given a sequence and a item, return the index of the item, or -1 if not found. - - E.g.: - - [a b c] a index_of - ------------------------ - 0 - - [a b c] d index_of - ------------------------ - -1 - - ''' - item, (sequence, stack) = stack - i = 0 - while sequence: - term, sequence = sequence - if term == item: - break - i += 1 - else: - i = -1 - return i, stack - - - D['index_of'] = index_of - -.. code:: ipython2 - - J('[0 2 7 0] 7 index_of') - - -.. parsed-literal:: - - 2 - - -.. code:: ipython2 - - J('[0 2 7 0] 23 index_of') - - -.. parsed-literal:: - - -1 - - -Starting at ``index`` distribute ``count`` "blocks" to the "banks" in -the sequence. - -:: - - [...] count index distribute - ---------------------------- - [...] - -This seems like it would be a PITA to implement in Joypy... - -.. code:: ipython2 - - from joy.utils.stack import iter_stack, list_to_stack - - - @SimpleFunctionWrapper - def distribute(stack): - '''Starting at index+1 distribute count "blocks" to the "banks" in the sequence. - - [...] count index distribute - ---------------------------- - [...] - - ''' - index, (count, (sequence, stack)) = stack - assert count >= 0 - cheat = list(iter_stack(sequence)) - n = len(cheat) - assert index < n - cheat[index] = 0 - while count: - index += 1 - index %= n - cheat[index] += 1 - count -= 1 - return list_to_stack(cheat), stack - - - D['distribute'] = distribute - -.. code:: ipython2 - - J('[0 2 7 0] dup max [index_of] nullary distribute') - - -.. parsed-literal:: - - [2 4 1 2] - - -.. code:: ipython2 - - J('[2 4 1 2] dup max [index_of] nullary distribute') - - -.. parsed-literal:: - - [3 1 2 3] - - -.. code:: ipython2 - - J('[3 1 2 3] dup max [index_of] nullary distribute') - - -.. parsed-literal:: - - [0 2 3 4] - - -.. code:: ipython2 - - J('[0 2 3 4] dup max [index_of] nullary distribute') - - -.. parsed-literal:: - - [1 3 4 1] - - -.. code:: ipython2 - - J('[1 3 4 1] dup max [index_of] nullary distribute') - - -.. parsed-literal:: - - [2 4 1 2] - - -Recalling "Generator Programs" -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - [a F] x - [a F] a F - - [a F] a swap [C] dip rest cons - a [a F] [C] dip rest cons - a C [a F] rest cons - a C [F] cons - - w/ C == dup G - - a dup G [F] cons - a a G [F] cons - - w/ G == dup max [index_of] nullary distribute - -.. code:: ipython2 - - define('direco == dip rest cons') - -.. code:: ipython2 - - define('G == [direco] cons [swap] swoncat cons') - -.. code:: ipython2 - - define('make_distributor == [dup dup max [index_of] nullary distribute] G') - -.. code:: ipython2 - - J('[0 2 7 0] make_distributor 6 [x] times pop') - - -.. parsed-literal:: - - [0 2 7 0] [2 4 1 2] [3 1 2 3] [0 2 3 4] [1 3 4 1] [2 4 1 2] - - -A function to drive a generator and count how many states before a repeat. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -First draft: - -:: - - [] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - -(?) - -:: - - [] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - [] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - [] [...] [GEN] pop index_of 0 >= - [] [...] index_of 0 >= - -1 0 >= - False - -Base case - -:: - - [] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec - [] [...] [GEN] pop size -- - [] [...] size -- - [] [...] size -- - -A mistake, ``popop`` and no need for ``--`` - -:: - - [] [...] [GEN] popop size - [] size - n - -Recursive case - -:: - - [] [...] [GEN] [pop index_of 0 >=] [popop size] [[swons] dip x] primrec - [] [...] [GEN] [swons] dip x F - [] [...] swons [GEN] x F - [[...]] [GEN] x F - [[...]] [...] [GEN] F - - [[...]] [...] [GEN] F - -What have we learned? - -:: - - F == [pop index_of 0 >=] [popop size] [[swons] dip x] primrec - -.. code:: ipython2 - - define('count_states == [] swap x [pop index_of 0 >=] [popop size] [[swons] dip x] primrec') - -.. code:: ipython2 - - define('AoC2017.6 == make_distributor count_states') - -.. code:: ipython2 - - J('[0 2 7 0] AoC2017.6') - - -.. parsed-literal:: - - 5 - - -.. code:: ipython2 - - J('[1 1 1] AoC2017.6') - - -.. parsed-literal:: - - 4 - - -.. code:: ipython2 - - J('[8 0 0 0 0 0] AoC2017.6') - - -.. parsed-literal:: - - 15 - diff --git a/docs/Document.md b/docs/Document.md deleted file mode 100644 index 5c9387b..0000000 --- a/docs/Document.md +++ /dev/null @@ -1,469 +0,0 @@ - -# Joy - -This document is written to capture, at least crudely, the scope of application for Joy and the Joypy implementation. It kind of expects that you have some familiarity with Joy already. - -It is vaguely organized, in a pile. - - -## Syntax - -Very simple syntax. Could be specified as a sequence of one or more terms: - - joy ::= term term* - -Conceptually, all terms are unary functions `F :: stack -> stack` that accept a stack and return a stack. But we immediately differentiate between literals (of a few kinds), functions, and combinators (which like higher-order functions.) - - -### In Joypy there are currently four literal types. - -First we have the types borrowed from the underlying Python semantics. **Strings** (byte and Unicode with nuances depending on whether you're running under Python 2 or 3), **ints**, and **floats**. Then there is the **sequence** type, aka "quote", "list", etc... In joy it is represented by enclosing zero or more terms in square brackets: - - sequence :== '[' term* ']' - -(In Joypy it is implemented as a cons-list. All datastructures in Joypy are built out of this single sequence type, including the stack and expression. I could include Python `frozenset` but I don't.) - - literal ::= string | int | float | sequence - -Functions accept zero or more arguments from the stack and push back zero or more results. - -Combinators are functions one or more of the arguments to which are quotes containing joy expressions, and which then execute one or more of their quoted arguments to effect their function. - - term ::= literal | function | combinator - -The code for the parser is in `joy/parser.py`. - - -## Semantics - -In Joy juxtaposition of symbols is composition of functions. That means that `F G` syntactically is `G(F(...))` semantically. - -As it says in the [Wikipedia entry for Joypy](https://en.wikipedia.org/wiki/Joy_%28programming_language%29): - - "In Joy, the meaning function is a homomorphism from the syntactic monoid onto the semantic monoid. That is, the syntactic relation of concatenation of symbols maps directly onto the semantic relation of composition of functions." - -Isn't that nice? - - -## Joypy Continuation-Passing Style - -In Joypy all the combinators work by modifying the pending expression. We have enlarged the definition of function to be from a two-tuple of `(stack, expression)` to another such two-tuple: - - F :: (stack, expression) -> (stack, expression) - -Simple functions ignore the expression and pass it through unchanged, combinators do not. They can modify it and this is enough to define control-flow and other operators. - -(Actually... In Joypy the functions all also include a dictionary parameter. This allows for functions like `print_words` and `help`. It also allows for the definition of a `define` function which would let Joy code add new definitions to the dictionary during evaluation, but this is an area I am leaving unexplored at least for now. It is essentially name-binding (variables) sneaking in, breaking the purity of the system.) - - -## Evaluation - -The joy interpreter is a very simple loop. As long as the expression is non-empty the interpreter pops the next term and checks it, if it's a literal it's pushed onto the stack, if it's a function or combinator the interpreter calls it passing the current stack and expression, which are then replaced by whatever the function or combinator returns. - -There is no call stack. All state is kept either on the stack or in the pending expression. At each interpreter iteration the stack and expression are complete. (They can be pickled, saved to disc or sent over the network, and reconstituted at any time, etc...) - - -# Methods of Meta-programming - -Joy seems to lend itself to several complementary forms of meta-programming to develop more-efficient versions of functions. - - -## Compiling definitions. - -Due to the fact that "juxtaposition of symbols is composition of functions" the *simplest* way to "compile" the Joy expression `F G` would be the Python expression: - - lambda s, e, d: G(*F(s, e, d)) - -This produces a new unnamed function that delivers the output of `F` directly to `G` without passing back through the interpreter loop. - -If we wanted to do more work than that, we could inspect the bytecode of the two Python functions, figure out how they name their arguments, and attempt to produce new bytecode that corresponds to the composition of them. This is a little beyond me at the moment, but it's not unrealistic given enough time and attention. - -It will usually be easier to manually write new custom words. For example, the "plus or minus" operator `pm`, defined as: - - pm == [+] [-] cleave popdd - -Can be implemented in Python as: - - @SimpleFunctionWrapper - def pm(stack): - a, (b, stack) = stack - p = b + a - m = b - a - return m, (p, stack) - -Code that uses `pm` will will work the same but more quickly if the "compiled" version is inscribed in the dictionary. - -It would be remiss not to mention **Cython** in this connection. Many Joy functions can be transparently compiled down to machine code. - -Beyond the above, it should be possible to make use of much of the existing body of knowledge for compiling *functional programming* languages to machine code for making an actual Joy compiler. Joy omits many "features" that are common to most other languages, lambda abstraction and `let` statements for example. I have not had the time to investigate compilation of Joy in any depth so far, but I have high hopes. It should be possible (and most of the details will have been already worked out in other languages) to go from e.g. the definition form of `pm` to the Python form automatically. - - -## Partial Evaluation - -Cf. "Futamura projections" - -["partial evaluation is a technique for several different types of program optimization by specialization. The most straightforward application is to produce new programs which run faster than the originals while being guaranteed to behave in the same way."](https://en.wikipedia.org/wiki/Partial_evaluation) ~Wikipedia - -Given a function and some (but not all) of its arguments you can run the interpreter in a speculative fashion and derive new functions that are specializations of the original. - -Example from [Futamura, 1983](https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/103401/1/0482-14.pdf) of converting a power function to a "to the fifth power" function: - - F(k, u) -> u^k - -I like to use a kind of crude [Gentzen notation](https://en.wikipedia.org/wiki/Natural_deduction) to describe a Joy function's semantics: - - k u F - ----------- - u^k - -Joy function implementation: - - F == 1 [popop 0 !=] [[popop 2 %] [over *] [] ifte [1 >>] dipd [sqr] dip] while [popop] dip - -This is a bit longer than a definition should be. In practice I would refactor it to be more concise and easily understood. - -In Python for comparison: - - def power(k, u): - z = 1 - while k != 0: - if k % 2: - z = z * u - k = k >> 1 - u = u * u - return z - -Using 5 for `k` and pushing evaluation forward as far as it will go with a sort of "thunk" variable for `u` we arrive at: - - u u u * dup * * - -We can replace the extra occurrences of `u` with `dup` to arrive at a definition for a Joy function that, given a number on the stack, returns that number raised to the fifth power: - - to-the-fifth == dup dup * dup * * - -Here it is in action: - - u dup dup * dup * * - u u dup * dup * * - u u u * dup * * - u u^2 dup * * - u u^2 u^2 * * - u u^4 * - u^5 - -See the appendix below for the derivation of the specialized form from the general form. - -It should be possible to write a program `FutamuraI` that works like this: - - [5] [F] FutamuraI - ------------------------- - [dup dup * dup * *] - - -That is, given the quoted program `[F]` and the argument `5`, it returns the new `to-the-fifth` function in quoted form. - - -### First Futamura Projection - -A joy interpreter written in Joy is described in the literature (available from the La Trobe archive or the mirror site) so we can apply the program `FutamuraI` to that to get a *residual* program `R` for some program `Q`: - - [Q] [joy] FutamuraI - ------------------------- - [R] - -The expected result is that, for a given input, the runtime of `R` is less than or equal to the runtime of `Q`. - -If we had a partial evaluator for Python we could create a residual program in Python for the Joy program `Q`. - - -### Second Futamura Projection - - [joy] [FutamuraI] FutamuraI - --------------------------------- - [C] - -Making a compiler by "specializing the specializer for the interpreter". - - -### Third Futamura Projection - - [FutamuraI] [FutamuraI] FutamuraI - --------------------------------------- - [K] - -"Specializing the specializer for itself yielding a tool that can convert any interpreter to an equivalent compiler" - - [joy] K - ------------- - [C] - - - - [Q] [joy] K i - ------------------- - [Q] C - ----------- - [R] - - - - - [K] K -> [K] - - - - -## Super-Compilation - -https://en.wikipedia.org/wiki/Metacompilation - -https://themonadreader.files.wordpress.com/2014/04/super-final.pdf - -This is a little hard to describe succinctly, but you are basically trying to figure out all possible paths through a program and then use that knowledge to improve the code, somehow. (I forget the details, but it's worth including and revisiting.) - - -## Gödel Machine - -http://people.idsia.ch/~juergen/goedelmachine.html - -https://en.wikipedia.org/wiki/G%C3%B6del_machine - -In Joy it often happens that a new general form is discovered that is semantically equivalent to some other form but that has greater efficiency (at least under some definite conditions.) When this happens we can perform a kind of search-and-replace operation over the whole of the current dictionary (standard library in other languages) and achieve performance gains. - -As an example, the function `[1 >>] dipd [sqr] dip` can be rewritten as `[[1 >>] dip sqr] dip` which, depending on the other optimizations some interpreter might make, could be more efficient. We can generalize this to a pattern-matching rule, something like: - - [F] dipd [G] dip == [[F] dip G] dip - -And we are justified rewriting any occurrence of the pattern on either side to the other if it improves things. - -The above also suggests a new combinator, call it `dipdip` that abstracts the pattern: - - ... a b [F] [G] dipdip - ---------------------------- - ... F a G b - -This permits the compiler to make optimizations without having to work to notice the pattern. The `dipdip` function and the interpreter can work together to do the more efficient thing. - -Joy function definitions form Directed Graphs. Not acyclical though, definition bodies do not contain references to other functions, but rather "Symbols" that name functions, so you can form e.g. two definitions that each make use of the other. Generally speaking though, you don't do this, instead you write definitions that use e.g. `genrec` general recursion combinator. - -Anyway, because Joy code is just a graph it becomes pretty easy to rewrite the graph in ways that preserve the semantics but are more efficient. Doing this in an automated fashion is essentially Schmidhuber's Gödel Machine: Finding and applying provably-correct modifications to the whole system in a self-referential way to create a self-improving general problem solver. - -Joy is intended as an effective vehicle for exploring this potential. - - -## Speculative pre-evaluation - -If you examine the traces of Joy programs it's easy to find places in the pending expression where some speculative interpreter could pre-compute results while the main interpreter was prosecuting the main "thread" of the program. For example consider (with the `.` indicating the current "location of the interpreter head" if you will, the split between the stack and the expression): - - ... a b c . F 2 3 + G H - -The `2 3 +` between `F` and `G` is not at the interpreter "head" yet it is extremely unlikely that any function `F` will prevent it (eventually) being evaluated to `5`. We can imagine an interpreter that detects this sort of thing, evaluates the sub-expression with a different CPU, and "tags" the expression at `2` with the result `5`. If evaluation reaches `2` the interpreter can just use `5` without re-evaluating the whole sub-expression `2 3 +`. - -This sort of thing happens all the time in Joy code. - -For example, if you look at the appendix for the partial evaluation example there is a stage where we have this: - - 5 u u [1 >>] dipd [sqr] dip - -Which can be written with the `dipdip` combinator: - - 5 u u [1 >>] [sqr] dipdip - -Which then becomes this: - - 5 1 >> u sqr u - -The interpreter could notice that `5 1 >>` and `u sqr` can proceed in parallel without interfering with each other. The `dipdip` combinator could be written to somehow hint to the interpreter that it should check for this posibility. - - -## JIT - -Whatever eventually winds up converting Joy code to machine code is susceptible to Just-in-Time compilation. For example, if you run Joypy on Pypy you take advantage of its JIT. - - -# Joy as UI - - -## Joy unifies CLI and GUI interfaces. - -All Joy interaction consists of two basic actions: - -1. Putting things onto the stack. -2. Executing functions. - -In a command-line setting you perform both of these actions the same way: entering Joy expressions as text. In a GUI you select items and copy or cut them to a user-visible stack (that is a first-class member of the UI, similar to the clipboard but with better visibility into contents and not restricted to one selection at a time.) You then trigger the evaluation of functions by clicking on buttons or menu items. *From the point-of-view of the underlying interpreter there is no difference between the input token streams for either UI modality.* - - -## Simple and Comprehensible Model - -In order to use their system(s) users must be able to easily and quickly develop a mental model of the system that maps to the actual system abstractions well enough to support the achievement of their goals. - -(Arguably current systems are pretty poor at this. Even an abstraction as old and ubiquitous as "filesystem" is only incompletely understood by many computer users. Many people do not understand the difference between RAM and disk storage!) - -The Joy model consists of just these main concepts: - -1. A stack of values -2. A dictionary of named commands -3. An interpreter - -Each of these is very simple and the first two even have real-world analogs (e.g. a *stack* of dishes or boxes or whatever, and, well, *dictionaries*.) It's easy to develop intuition for this system, resulting in a close match between the user's mental model and the actual system abstraction. - - -# Joy as AST for multi-language interop - -IR for Compilation - -Cf. Graal & Truffle - -"Software is eating the world"; Joy eats software. - -Universal Solvent - -Can write front-ends for translating other languages into Joy, thence to be refactored and fulminated into more efficient forms. "The Blob" of software. - - -# Minimal Basis - -Cf. SKI combinators, Peano arithmentic, Church numerals et. al., - -Folks have done work on figuring out the minimal set of combinators that are Turing-complete. Several of these sets are quite small. - -Semantics can be defined in terms of Laws of Form for down-to-the-metal modeling of programs as logic circuits. Hardware description language. - - - -# Math, Physics, Computation - - Computational algorithms are used to communicate precisely - some of the methods used in the analysis of dynamical phenomena. - Expressing the methods of variational mechanics in a computer - language forces them to be unambiguous and computationally - effective. Computation requires us to be precise about the repre- - sentation of mechanical and geometric notions as computational - objects and permits us to represent explicitly the algorithms for - manipulating these objects. Also, once formalized as a procedure, - a mathematical idea becomes a tool that can be used directly to - compute results. - - "Structure and Interpretation of Classical Mechanics", - Gerald Jay Sussman and Jack Wisdom with Meinhard E. Mayer - -. - - - -# Joy as glue language - -Basically any existing code/programs can be exposed to Joy as a function or collection of functions. - -## Shell command - -Run a shell command. - - "stdin" "cmd line" system - ----------------------------------- - "stderr" "stdout" return_code - -Then you can create e.g.: - - foo == "awk {awk program}" system - -Etc... - -## Python libraries - -## Ctypes (FFI) for loading binary libraries - - - - -# Git as File Store - -The old-fashioned File System abstraction is no longer justified. Joypy won't attempt to implement file and path operations. Instead there are a few functions that accept three args: a sha1 checksum of a blob of data, an initial index, and an offset. One function returns the string of data `blob[index:index+offset]`, while another accepts an additional quoted program and "runs it" with the data as the stack, for when you want to process a big ol' pile of data but don't want to load it into the interpreter. I imagine a use case for a third-party wrapped library that expects some sort of file or socket and streams over it somehow. Obviously, this is under-specified. - -The sha1 checksum refers to data stored in some (global, universal) git repo, which is provided to the interpreter though some as-yet unimplemented meta-interpreter action. - -**Git is a functional data type**, compatible with the semantic model of Joy. Implies shared datastore with obvious connection to git-archive & Datalad. - -Functions over static data (Wikipedia dump; MRI data &c.) can be considered timeless (however much time their first evaluation takes) and cached/archived in the global shared git repo. (Large data in e.g. cloud & bittorrent, with meta-data in git-archive/Datalad) - -Functions over streams (of possible mal-formed) data require a special stream-processing combinator and more care in their development. I haven't developed this in any detail, but it can be shown in many cases that e.g. a given function cannot grow unbounded (for all possible unbounded input streams.) - - - -# Sympy Library - -The mathematical functions in the Joypy library wrap the `math` module and other built-ins for the most part. It would be a simple matter to write wrapper functions for e.g. the Sympy packages' functions and provide symbolic math capabilities. - -It would also be possible to make a dictionary that mapped the math functions to the Sympy versions. Evaluating Joy code with this dictionary (and a special stack with Sympy variables on it) would result in symbolic execution without rewriting the Joy code. - - - -# Stack-based laguages as Dataflow - -If the "places" in a stack are considered first-class entities and tracked through "stack chatter" operations (like `swap`) we can draw flow-lines for the data and represent the functions as boxes with input and output lines. Stack chatter becomes topological rearrangements of lines. The resulting structure is conceptually identical with *Dataflow* paradigm of programming. - -(Related to this I suspect that all stack chatter disappears during compilation but I haven't nailed that down yet.) - -I'm unable to find the original webpage that describe the above. :-( - - -# Appendix Partial Evaluation Example - - k u F - ----------- - u^k - - - k u 1 [popop 0 !=] [[popop odd][over *][]ifte [1 >>] dipd [sqr] dip] while [popop] dip - - F == 1 [popop 0 !=] [[popop odd][over *][]ifte [1 >>] dipd [sqr] dip] while [popop] dip - - 5 u 1 [popop 0 !=] [[popop odd][over *][]ifte [1 >>] dipd [sqr] dip] while [popop] dip - - - 5 u 1 popop 0 != - 5 0 != - True - - - 5 u 1 [popop odd][over *][]ifte [1 >>] dipd [sqr] dip - 5 u 1 popop odd - True - - w/ sqr == dup * - - 5 u 1 over * [1 >>] dipd [sqr] dip - 5 u 1 u * [1 >>] dipd [sqr] dip - 5 u u [1 >>] dipd [sqr] dip - 5 1 >> u sqr u - 2 u_dup_* u - --or-- - 2 u_u_* u - - 2 u_u_* u popop 0 != - 2 0 != - True - - 2 u_u_* u [popop odd][over *][]ifte [1 >>] dipd [sqr] dip - ... - 2 u_u_* u [1 >>] dipd [sqr] dip - - 2 1 >> u_u_* sqr u - 1 u_u_*_dup_* u - - - 1 u_u_*_dup_* u [popop odd][over *][]ifte [1 >>] dipd [sqr] dip - 1 u_u_*_dup_* u over * [1 >>] dipd [sqr] dip - 1 u_u_*_dup_* u u_u_*_dup_* * [1 >>] dipd [sqr] dip - 1 u_u_*_dup_* u_u_u_*_dup_*_* [1 >>] dipd [sqr] dip - - 1 1 >> u_u_*_dup_* sqr u_u_u_*_dup_*_* - 0 u_u_*_dup_* dup * u_u_u_*_dup_*_* - 0 u_u_*_dup_* u_u_*_dup_* * u_u_u_*_dup_*_* - 0 u_..._* u_u_u_*_dup_*_* - - 0 u_..._* u_u_u_*_dup_*_* [popop] dip - - u_u_u_*_dup_*_* - - ^5 == dup dup * dup * * diff --git a/docs/Generator Programs.html b/docs/Generator Programs.html deleted file mode 100644 index 775f6d2..0000000 --- a/docs/Generator Programs.html +++ /dev/null @@ -1,13245 +0,0 @@ - - - -Generator Programs - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Using x to Generate Values

Cf. jp-reprod.html

- -
-
-
-
-
-
In [1]:
-
-
-
from notebook_preamble import J, V, define
-
- -
-
-
- -
-
-
-
-
-

Consider the x combinator:

- -
x == dup i
- -
-
-
-
-
-
-
-

We can apply it to a quoted program consisting of some value a and some function B:

- -
[a B] x
-[a B] a B
- -
-
-
-
-
-
-
-

Let B function swap the a with the quote and run some function C on it to generate a new value b:

- -
B == swap [C] dip
-
-[a B] a B
-[a B] a swap [C] dip
-a [a B]      [C] dip
-a C [a B]
-b [a B]
- -
-
-
-
-
-
-
-

Now discard the quoted a with rest then cons b:

- -
b [a B] rest cons
-b [B]        cons
-[b B]
- -
-
-
-
-
-
-
-

Altogether, this is the definition of B:

- -
B == swap [C] dip rest cons
- -
-
-
-
-
-
-
-

We can make a generator for the Natural numbers (0, 1, 2, ...) by using 0 for a and [dup ++] for [C]:

- -
[0 swap [dup ++] dip rest cons]
-
-
-

Let's try it:

- -
-
-
-
-
-
In [2]:
-
-
-
V('[0 swap [dup ++] dip rest cons] x')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                           . [0 swap [dup ++] dip rest cons] x
-           [0 swap [dup ++] dip rest cons] . x
-           [0 swap [dup ++] dip rest cons] . 0 swap [dup ++] dip rest cons
-         [0 swap [dup ++] dip rest cons] 0 . swap [dup ++] dip rest cons
-         0 [0 swap [dup ++] dip rest cons] . [dup ++] dip rest cons
-0 [0 swap [dup ++] dip rest cons] [dup ++] . dip rest cons
-                                         0 . dup ++ [0 swap [dup ++] dip rest cons] rest cons
-                                       0 0 . ++ [0 swap [dup ++] dip rest cons] rest cons
-                                       0 1 . [0 swap [dup ++] dip rest cons] rest cons
-       0 1 [0 swap [dup ++] dip rest cons] . rest cons
-         0 1 [swap [dup ++] dip rest cons] . cons
-         0 [1 swap [dup ++] dip rest cons] . 
-
-
-
- -
-
- -
-
-
-
-
-

After one application of x the quoted program contains 1 and 0 is below it on the stack.

- -
-
-
-
-
-
In [3]:
-
-
-
J('[0 swap [dup ++] dip rest cons] x x x x x pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0 1 2 3 4
-
-
-
- -
-
- -
-
-
-
-
-

direco

-
-
-
-
-
-
In [4]:
-
-
-
define('direco == dip rest cons')
-
- -
-
-
- -
-
-
-
In [5]:
-
-
-
V('[0 swap [dup ++] direco] x')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                    . [0 swap [dup ++] direco] x
-           [0 swap [dup ++] direco] . x
-           [0 swap [dup ++] direco] . 0 swap [dup ++] direco
-         [0 swap [dup ++] direco] 0 . swap [dup ++] direco
-         0 [0 swap [dup ++] direco] . [dup ++] direco
-0 [0 swap [dup ++] direco] [dup ++] . direco
-0 [0 swap [dup ++] direco] [dup ++] . dip rest cons
-                                  0 . dup ++ [0 swap [dup ++] direco] rest cons
-                                0 0 . ++ [0 swap [dup ++] direco] rest cons
-                                0 1 . [0 swap [dup ++] direco] rest cons
-       0 1 [0 swap [dup ++] direco] . rest cons
-         0 1 [swap [dup ++] direco] . cons
-         0 [1 swap [dup ++] direco] . 
-
-
-
- -
-
- -
-
-
-
-
-

Making Generators

We want to define a function that accepts a and [C] and builds our quoted program:

- -
         a [C] G
--------------------------
-   [a swap [C] direco]
- -
-
-
-
-
-
-
-

Working in reverse:

- -
[a swap   [C] direco] cons
-a [swap   [C] direco] concat
-a [swap] [[C] direco] swap
-a [[C] direco] [swap]
-a [C] [direco] cons [swap]
-
-
-

Reading from the bottom up:

- -
G == [direco] cons [swap] swap concat cons
-G == [direco] cons [swap] swoncat cons
- -
-
-
-
-
-
In [6]:
-
-
-
define('G == [direco] cons [swap] swoncat cons')
-
- -
-
-
- -
-
-
-
-
-

Let's try it out:

- -
-
-
-
-
-
In [7]:
-
-
-
J('0 [dup ++] G')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[0 swap [dup ++] direco]
-
-
-
- -
-
- -
-
-
-
In [8]:
-
-
-
J('0 [dup ++] G x x x pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
0 1 2
-
-
-
- -
-
- -
-
-
-
-
-

Powers of 2

-
-
-
-
-
-
In [9]:
-
-
-
J('1 [dup 1 <<] G x x x x x x x x x pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 4 8 16 32 64 128 256
-
-
-
- -
-
- -
-
-
-
-
-

[x] times

If we have one of these quoted programs we can drive it using times with the x combinator.

- -
-
-
-
-
-
In [10]:
-
-
-
J('23 [dup ++] G 5 [x] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
23 24 25 26 27 [28 swap [dup ++] direco]
-
-
-
- -
-
- -
-
-
-
-
-

Generating Multiples of Three and Five

Look at the treatment of the Project Euler Problem One in the "Developing a Program" notebook and you'll see that we might be interested in generating an endless cycle of:

- -
3 2 1 3 1 2 3
-
-
-

To do this we want to encode the numbers as pairs of bits in a single int:

- -
    3  2  1  3  1  2  3
-0b 11 10 01 11 01 10 11 == 14811
-
-
-

And pick them off by masking with 3 (binary 11) and then shifting the int right two bits.

- -
-
-
-
-
-
In [11]:
-
-
-
define('PE1.1 == dup [3 &] dip 2 >>')
-
- -
-
-
- -
-
-
-
In [12]:
-
-
-
V('14811 PE1.1')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                  . 14811 PE1.1
-            14811 . PE1.1
-            14811 . dup [3 &] dip 2 >>
-      14811 14811 . [3 &] dip 2 >>
-14811 14811 [3 &] . dip 2 >>
-            14811 . 3 & 14811 2 >>
-          14811 3 . & 14811 2 >>
-                3 . 14811 2 >>
-          3 14811 . 2 >>
-        3 14811 2 . >>
-           3 3702 . 
-
-
-
- -
-
- -
-
-
-
-
-

If we plug 14811 and [PE1.1] into our generator form...

- -
-
-
-
-
-
In [13]:
-
-
-
J('14811 [PE1.1] G')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[14811 swap [PE1.1] direco]
-
-
-
- -
-
- -
-
-
-
-
-

...we get a generator that works for seven cycles before it reaches zero:

- -
-
-
-
-
-
In [14]:
-
-
-
J('[14811 swap [PE1.1] direco] 7 [x] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 3 1 2 3 [0 swap [PE1.1] direco]
-
-
-
- -
-
- -
-
-
-
-
-

Reset at Zero

We need a function that checks if the int has reached zero and resets it if so.

- -
-
-
-
-
-
In [15]:
-
-
-
define('PE1.1.check == dup [pop 14811] [] branch')
-
- -
-
-
- -
-
-
-
In [16]:
-
-
-
J('14811 [PE1.1.check PE1.1] G')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[14811 swap [PE1.1.check PE1.1] direco]
-
-
-
- -
-
- -
-
-
-
In [17]:
-
-
-
J('[14811 swap [PE1.1.check PE1.1] direco] 21 [x] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [PE1.1.check PE1.1] direco]
-
-
-
- -
-
- -
-
-
-
-
-

(It would be more efficient to reset the int every seven cycles but that's a little beyond the scope of this article. This solution does extra work, but not much, and we're not using it "in production" as they say.)

- -
-
-
-
-
-
-
-

Run 466 times

In the PE1 problem we are asked to sum all the multiples of three and five less than 1000. It's worked out that we need to use all seven numbers sixty-six times and then four more.

- -
-
-
-
-
-
In [18]:
-
-
-
J('7 66 * 4 +')
-
- -
-
-
- -
-
- - -
- -
- - -
-
466
-
-
-
- -
-
- -
-
-
-
-
-

If we drive our generator 466 times and sum the stack we get 999.

- -
-
-
-
-
-
In [19]:
-
-
-
J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 [57 swap [PE1.1.check PE1.1] direco]
-
-
-
- -
-
- -
-
-
-
In [20]:
-
-
-
J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times pop enstacken sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
999
-
-
-
- -
-
- -
-
-
-
-
-

Project Euler Problem One

-
-
-
-
-
-
In [21]:
-
-
-
define('PE1.2 == + dup [+] dip')
-
- -
-
-
- -
-
-
-
-
-

Now we can add PE1.2 to the quoted program given to G.

- -
-
-
-
-
-
In [22]:
-
-
-
J('0 0 0 [PE1.1.check PE1.1] G 466 [x [PE1.2] dip] times popop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
233168
-
-
-
- -
-
- -
-
-
-
-
-

A generator for the Fibonacci Sequence.

Consider:

- -
[b a F] x
-[b a F] b a F
- -
-
-
-
-
-
-
-

The obvious first thing to do is just add b and a:

- -
[b a F] b a +
-[b a F] b+a
- -
-
-
-
-
-
-
-

From here we want to arrive at:

- -
b [b+a b F]
- -
-
-
-
-
-
-
-

Let's start with swons:

- -
[b a F] b+a swons
-[b+a b a F]
- -
-
-
-
-
-
-
-

Considering this quote as a stack:

- -
F a b b+a
- -
-
-
-
-
-
-
-

We want to get it to:

- -
F b b+a b
- -
-
-
-
-
-
-
-

So:

- -
F a b b+a popdd over
-F b b+a b
- -
-
-
-
-
-
-
-

And therefore:

- -
[b+a b a F] [popdd over] infra
-[b b+a b F]
- -
-
-
-
-
-
-
-

But we can just use cons to carry b+a into the quote:

- -
[b a F] b+a [popdd over] cons infra
-[b a F] [b+a popdd over]      infra
-[b b+a b F]
- -
-
-
-
-
-
-
-

Lastly:

- -
[b b+a b F] uncons
-b [b+a b F]
- -
-
-
-
-
-
-
-

Putting it all together:

- -
F == + [popdd over] cons infra uncons
-fib_gen == [1 1 F]
- -
-
-
-
-
-
In [23]:
-
-
-
define('fib == + [popdd over] cons infra uncons')
-
- -
-
-
- -
-
-
-
In [24]:
-
-
-
define('fib_gen == [1 1 fib]')
-
- -
-
-
- -
-
-
-
In [25]:
-
-
-
J('fib_gen 10 [x] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 2 3 5 8 13 21 34 55 89 [144 89 fib]
-
-
-
- -
-
- -
-
-
-
-
-

Project Euler Problem Two

-
By considering the terms in the Fibonacci sequence whose values do not exceed four million,
-find the sum of the even-valued terms.
-
-
-

Now that we have a generator for the Fibonacci sequence, we need a function that adds a term in the sequence to a sum if it is even, and pops it otherwise.

- -
-
-
-
-
-
In [26]:
-
-
-
define('PE2.1 == dup 2 % [+] [pop] branch')
-
- -
-
-
- -
-
-
-
-
-

And a predicate function that detects when the terms in the series "exceed four million".

- -
-
-
-
-
-
In [27]:
-
-
-
define('>4M == 4000000 >')
-
- -
-
-
- -
-
-
-
-
-

Now it's straightforward to define PE2 as a recursive function that generates terms in the Fibonacci sequence until they exceed four million and sums the even ones.

- -
-
-
-
-
-
In [28]:
-
-
-
define('PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec')
-
- -
-
-
- -
-
-
-
In [29]:
-
-
-
J('PE2')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4613732
-
-
-
- -
-
- -
-
-
-
-
-

Here's the collected program definitions:

- -
fib == + swons [popdd over] infra uncons
-fib_gen == [1 1 fib]
-
-even == dup 2 %
->4M == 4000000 >
-
-PE2.1 == even [+] [pop] branch
-PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec
- -
-
-
-
-
-
-
-

Even-valued Fibonacci Terms

Using o for odd and e for even:

- -
o + o = e
-e + e = e
-o + e = o
-
-
-

So the Fibonacci sequence considered in terms of just parity would be:

- -
o o e o o e o o e o o e o o e o o e
-1 1 2 3 5 8 . . .
-
-
-

Every third term is even.

- -
-
-
-
-
-
In [30]:
-
-
-
J('[1 0 fib] x x x')  # To start the sequence with 1 1 2 3 instead of 1 2 3.
-
- -
-
-
- -
-
- - -
- -
- - -
-
1 1 2 [3 2 fib]
-
-
-
- -
-
- -
-
-
-
-
-

Drive the generator three times and popop the two odd terms.

- -
-
-
-
-
-
In [31]:
-
-
-
J('[1 0 fib] x x x [popop] dipd')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2 [3 2 fib]
-
-
-
- -
-
- -
-
-
-
In [32]:
-
-
-
define('PE2.2 == x x x [popop] dipd')
-
- -
-
-
- -
-
-
-
In [33]:
-
-
-
J('[1 0 fib] 10 [PE2.2] times')
-
- -
-
-
- -
-
- - -
- -
- - -
-
2 8 34 144 610 2584 10946 46368 196418 832040 [1346269 832040 fib]
-
-
-
- -
-
- -
-
-
-
-
-

Replace x with our new driver function PE2.2 and start our fib generator at 1 0.

- -
-
-
-
-
-
In [34]:
-
-
-
J('0 [1 0 fib] PE2.2 [pop >4M] [popop] [[PE2.1] dip PE2.2] primrec')
-
- -
-
-
- -
-
- - -
- -
- - -
-
4613732
-
-
-
- -
-
- -
-
-
-
-
-

How to compile these?

You would probably start with a special version of G, and perhaps modifications to the default x?

- -
-
-
-
-
-
-
-

An Interesting Variation

-
-
-
-
-
-
In [35]:
-
-
-
define('codireco == cons dip rest cons')
-
- -
-
-
- -
-
-
-
In [36]:
-
-
-
V('[0 [dup ++] codireco] x')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                 . [0 [dup ++] codireco] x
-           [0 [dup ++] codireco] . x
-           [0 [dup ++] codireco] . 0 [dup ++] codireco
-         [0 [dup ++] codireco] 0 . [dup ++] codireco
-[0 [dup ++] codireco] 0 [dup ++] . codireco
-[0 [dup ++] codireco] 0 [dup ++] . cons dip rest cons
-[0 [dup ++] codireco] [0 dup ++] . dip rest cons
-                                 . 0 dup ++ [0 [dup ++] codireco] rest cons
-                               0 . dup ++ [0 [dup ++] codireco] rest cons
-                             0 0 . ++ [0 [dup ++] codireco] rest cons
-                             0 1 . [0 [dup ++] codireco] rest cons
-       0 1 [0 [dup ++] codireco] . rest cons
-         0 1 [[dup ++] codireco] . cons
-         0 [1 [dup ++] codireco] . 
-
-
-
- -
-
- -
-
-
-
In [37]:
-
-
-
define('G == [codireco] cons cons')
-
- -
-
-
- -
-
-
-
In [38]:
-
-
-
J('230 [dup ++] G 5 [x] times pop')
-
- -
-
-
- -
-
- - -
- -
- - -
-
230 231 232 233 234
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/Generator Programs.ipynb b/docs/Generator Programs.ipynb deleted file mode 100644 index dcb3f61..0000000 --- a/docs/Generator Programs.ipynb +++ /dev/null @@ -1,1027 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Using `x` to Generate Values\n", - "\n", - "Cf. jp-reprod.html" - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Consider the `x` combinator:\n", - "\n", - " x == dup i" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We can apply it to a quoted program consisting of some value `a` and some function `B`:\n", - "\n", - " [a B] x\n", - " [a B] a B" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Let `B` function `swap` the `a` with the quote and run some function `C` on it to generate a new value `b`:\n", - "\n", - " B == swap [C] dip\n", - "\n", - " [a B] a B\n", - " [a B] a swap [C] dip\n", - " a [a B] [C] dip\n", - " a C [a B]\n", - " b [a B]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now discard the quoted `a` with `rest` then `cons` `b`:\n", - "\n", - " b [a B] rest cons\n", - " b [B] cons\n", - " [b B]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Altogether, this is the definition of `B`:\n", - "\n", - " B == swap [C] dip rest cons" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We can make a generator for the Natural numbers (0, 1, 2, ...) by using `0` for `a` and `[dup ++]` for `[C]`:\n", - "\n", - " [0 swap [dup ++] dip rest cons]\n", - "\n", - "Let's try it:" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [0 swap [dup ++] dip rest cons] x\n", - " [0 swap [dup ++] dip rest cons] . x\n", - " [0 swap [dup ++] dip rest cons] . 0 swap [dup ++] dip rest cons\n", - " [0 swap [dup ++] dip rest cons] 0 . swap [dup ++] dip rest cons\n", - " 0 [0 swap [dup ++] dip rest cons] . [dup ++] dip rest cons\n", - "0 [0 swap [dup ++] dip rest cons] [dup ++] . dip rest cons\n", - " 0 . dup ++ [0 swap [dup ++] dip rest cons] rest cons\n", - " 0 0 . ++ [0 swap [dup ++] dip rest cons] rest cons\n", - " 0 1 . [0 swap [dup ++] dip rest cons] rest cons\n", - " 0 1 [0 swap [dup ++] dip rest cons] . rest cons\n", - " 0 1 [swap [dup ++] dip rest cons] . cons\n", - " 0 [1 swap [dup ++] dip rest cons] . \n" - ] - } - ], - "source": [ - "V('[0 swap [dup ++] dip rest cons] x')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "After one application of `x` the quoted program contains `1` and `0` is below it on the stack." - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0 1 2 3 4\n" - ] - } - ], - "source": [ - "J('[0 swap [dup ++] dip rest cons] x x x x x pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## `direco`" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [], - "source": [ - "define('direco == dip rest cons')" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [0 swap [dup ++] direco] x\n", - " [0 swap [dup ++] direco] . x\n", - " [0 swap [dup ++] direco] . 0 swap [dup ++] direco\n", - " [0 swap [dup ++] direco] 0 . swap [dup ++] direco\n", - " 0 [0 swap [dup ++] direco] . [dup ++] direco\n", - "0 [0 swap [dup ++] direco] [dup ++] . direco\n", - "0 [0 swap [dup ++] direco] [dup ++] . dip rest cons\n", - " 0 . dup ++ [0 swap [dup ++] direco] rest cons\n", - " 0 0 . ++ [0 swap [dup ++] direco] rest cons\n", - " 0 1 . [0 swap [dup ++] direco] rest cons\n", - " 0 1 [0 swap [dup ++] direco] . rest cons\n", - " 0 1 [swap [dup ++] direco] . cons\n", - " 0 [1 swap [dup ++] direco] . \n" - ] - } - ], - "source": [ - "V('[0 swap [dup ++] direco] x')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Making Generators\n", - "We want to define a function that accepts `a` and `[C]` and builds our quoted program:\n", - "\n", - " a [C] G\n", - " -------------------------\n", - " [a swap [C] direco]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Working in reverse:\n", - "\n", - " [a swap [C] direco] cons\n", - " a [swap [C] direco] concat\n", - " a [swap] [[C] direco] swap\n", - " a [[C] direco] [swap]\n", - " a [C] [direco] cons [swap]\n", - "\n", - "Reading from the bottom up:\n", - "\n", - " G == [direco] cons [swap] swap concat cons\n", - " G == [direco] cons [swap] swoncat cons" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [], - "source": [ - "define('G == [direco] cons [swap] swoncat cons')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Let's try it out:" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[0 swap [dup ++] direco]\n" - ] - } - ], - "source": [ - "J('0 [dup ++] G')" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "0 1 2\n" - ] - } - ], - "source": [ - "J('0 [dup ++] G x x x pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Powers of 2" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 4 8 16 32 64 128 256\n" - ] - } - ], - "source": [ - "J('1 [dup 1 <<] G x x x x x x x x x pop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `[x] times`\n", - "If we have one of these quoted programs we can drive it using `times` with the `x` combinator." - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "23 24 25 26 27 [28 swap [dup ++] direco]\n" - ] - } - ], - "source": [ - "J('23 [dup ++] G 5 [x] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Generating Multiples of Three and Five\n", - "Look at the treatment of the Project Euler Problem One in the \"Developing a Program\" notebook and you'll see that we might be interested in generating an endless cycle of:\n", - "\n", - " 3 2 1 3 1 2 3\n", - "\n", - "To do this we want to encode the numbers as pairs of bits in a single int:\n", - "\n", - " 3 2 1 3 1 2 3\n", - " 0b 11 10 01 11 01 10 11 == 14811\n", - "\n", - "And pick them off by masking with 3 (binary 11) and then shifting the int right two bits." - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.1 == dup [3 &] dip 2 >>')" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 14811 PE1.1\n", - " 14811 . PE1.1\n", - " 14811 . dup [3 &] dip 2 >>\n", - " 14811 14811 . [3 &] dip 2 >>\n", - "14811 14811 [3 &] . dip 2 >>\n", - " 14811 . 3 & 14811 2 >>\n", - " 14811 3 . & 14811 2 >>\n", - " 3 . 14811 2 >>\n", - " 3 14811 . 2 >>\n", - " 3 14811 2 . >>\n", - " 3 3702 . \n" - ] - } - ], - "source": [ - "V('14811 PE1.1')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "If we plug `14811` and `[PE1.1]` into our generator form..." - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[14811 swap [PE1.1] direco]\n" - ] - } - ], - "source": [ - "J('14811 [PE1.1] G')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "...we get a generator that works for seven cycles before it reaches zero:" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 3 1 2 3 [0 swap [PE1.1] direco]\n" - ] - } - ], - "source": [ - "J('[14811 swap [PE1.1] direco] 7 [x] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Reset at Zero\n", - "We need a function that checks if the int has reached zero and resets it if so." - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.1.check == dup [pop 14811] [] branch')" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[14811 swap [PE1.1.check PE1.1] direco]\n" - ] - } - ], - "source": [ - "J('14811 [PE1.1.check PE1.1] G')" - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [PE1.1.check PE1.1] direco]\n" - ] - } - ], - "source": [ - "J('[14811 swap [PE1.1.check PE1.1] direco] 21 [x] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "(It would be more efficient to reset the int every seven cycles but that's a little beyond the scope of this article. This solution does extra work, but not much, and we're not using it \"in production\" as they say.)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Run 466 times\n", - "In the PE1 problem we are asked to sum all the multiples of three and five less than 1000. It's worked out that we need to use all seven numbers sixty-six times and then four more." - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "466\n" - ] - } - ], - "source": [ - "J('7 66 * 4 +')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "If we drive our generator 466 times and sum the stack we get 999." - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": { - "scrolled": false - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 [57 swap [PE1.1.check PE1.1] direco]\n" - ] - } - ], - "source": [ - "J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times')" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": { - "scrolled": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "999\n" - ] - } - ], - "source": [ - "J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times pop enstacken sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Project Euler Problem One" - ] - }, - { - "cell_type": "code", - "execution_count": 21, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE1.2 == + dup [+] dip')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now we can add `PE1.2` to the quoted program given to `G`." - ] - }, - { - "cell_type": "code", - "execution_count": 22, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "233168\n" - ] - } - ], - "source": [ - "J('0 0 0 [PE1.1.check PE1.1] G 466 [x [PE1.2] dip] times popop')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## A generator for the Fibonacci Sequence.\n", - "Consider:\n", - "\n", - " [b a F] x\n", - " [b a F] b a F" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The obvious first thing to do is just add `b` and `a`:\n", - "\n", - " [b a F] b a +\n", - " [b a F] b+a" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "From here we want to arrive at:\n", - "\n", - " b [b+a b F]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Let's start with `swons`:\n", - "\n", - " [b a F] b+a swons\n", - " [b+a b a F]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Considering this quote as a stack:\n", - "\n", - " F a b b+a" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We want to get it to:\n", - "\n", - " F b b+a b" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "So:\n", - "\n", - " F a b b+a popdd over\n", - " F b b+a b" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "And therefore:\n", - "\n", - " [b+a b a F] [popdd over] infra\n", - " [b b+a b F]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "But we can just use `cons` to carry `b+a` into the quote:\n", - "\n", - " [b a F] b+a [popdd over] cons infra\n", - " [b a F] [b+a popdd over] infra\n", - " [b b+a b F]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Lastly:\n", - "\n", - " [b b+a b F] uncons\n", - " b [b+a b F]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Putting it all together:\n", - "\n", - " F == + [popdd over] cons infra uncons\n", - " fib_gen == [1 1 F]" - ] - }, - { - "cell_type": "code", - "execution_count": 23, - "metadata": {}, - "outputs": [], - "source": [ - "define('fib == + [popdd over] cons infra uncons')" - ] - }, - { - "cell_type": "code", - "execution_count": 24, - "metadata": {}, - "outputs": [], - "source": [ - "define('fib_gen == [1 1 fib]')" - ] - }, - { - "cell_type": "code", - "execution_count": 25, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 2 3 5 8 13 21 34 55 89 [144 89 fib]\n" - ] - } - ], - "source": [ - "J('fib_gen 10 [x] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Project Euler Problem Two\n", - " By considering the terms in the Fibonacci sequence whose values do not exceed four million,\n", - " find the sum of the even-valued terms.\n", - "\n", - "Now that we have a generator for the Fibonacci sequence, we need a function that adds a term in the sequence to a sum if it is even, and `pop`s it otherwise." - ] - }, - { - "cell_type": "code", - "execution_count": 26, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE2.1 == dup 2 % [+] [pop] branch')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "And a predicate function that detects when the terms in the series \"exceed four million\"." - ] - }, - { - "cell_type": "code", - "execution_count": 27, - "metadata": {}, - "outputs": [], - "source": [ - "define('>4M == 4000000 >')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Now it's straightforward to define `PE2` as a recursive function that generates terms in the Fibonacci sequence until they exceed four million and sums the even ones." - ] - }, - { - "cell_type": "code", - "execution_count": 28, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 29, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4613732\n" - ] - } - ], - "source": [ - "J('PE2')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Here's the collected program definitions:\n", - "\n", - " fib == + swons [popdd over] infra uncons\n", - " fib_gen == [1 1 fib]\n", - "\n", - " even == dup 2 %\n", - " >4M == 4000000 >\n", - "\n", - " PE2.1 == even [+] [pop] branch\n", - " PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Even-valued Fibonacci Terms\n", - "\n", - "Using `o` for odd and `e` for even:\n", - "\n", - " o + o = e\n", - " e + e = e\n", - " o + e = o\n", - "\n", - "So the Fibonacci sequence considered in terms of just parity would be:\n", - "\n", - " o o e o o e o o e o o e o o e o o e\n", - " 1 1 2 3 5 8 . . .\n", - "\n", - "Every third term is even.\n" - ] - }, - { - "cell_type": "code", - "execution_count": 30, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "1 1 2 [3 2 fib]\n" - ] - } - ], - "source": [ - "J('[1 0 fib] x x x') # To start the sequence with 1 1 2 3 instead of 1 2 3." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Drive the generator three times and `popop` the two odd terms." - ] - }, - { - "cell_type": "code", - "execution_count": 31, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2 [3 2 fib]\n" - ] - } - ], - "source": [ - "J('[1 0 fib] x x x [popop] dipd')" - ] - }, - { - "cell_type": "code", - "execution_count": 32, - "metadata": {}, - "outputs": [], - "source": [ - "define('PE2.2 == x x x [popop] dipd')" - ] - }, - { - "cell_type": "code", - "execution_count": 33, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "2 8 34 144 610 2584 10946 46368 196418 832040 [1346269 832040 fib]\n" - ] - } - ], - "source": [ - "J('[1 0 fib] 10 [PE2.2] times')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Replace `x` with our new driver function `PE2.2` and start our `fib` generator at `1 0`." - ] - }, - { - "cell_type": "code", - "execution_count": 34, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "4613732\n" - ] - } - ], - "source": [ - "J('0 [1 0 fib] PE2.2 [pop >4M] [popop] [[PE2.1] dip PE2.2] primrec')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## How to compile these?\n", - "You would probably start with a special version of `G`, and perhaps modifications to the default `x`?" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## An Interesting Variation" - ] - }, - { - "cell_type": "code", - "execution_count": 35, - "metadata": {}, - "outputs": [], - "source": [ - "define('codireco == cons dip rest cons')" - ] - }, - { - "cell_type": "code", - "execution_count": 36, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [0 [dup ++] codireco] x\n", - " [0 [dup ++] codireco] . x\n", - " [0 [dup ++] codireco] . 0 [dup ++] codireco\n", - " [0 [dup ++] codireco] 0 . [dup ++] codireco\n", - "[0 [dup ++] codireco] 0 [dup ++] . codireco\n", - "[0 [dup ++] codireco] 0 [dup ++] . cons dip rest cons\n", - "[0 [dup ++] codireco] [0 dup ++] . dip rest cons\n", - " . 0 dup ++ [0 [dup ++] codireco] rest cons\n", - " 0 . dup ++ [0 [dup ++] codireco] rest cons\n", - " 0 0 . ++ [0 [dup ++] codireco] rest cons\n", - " 0 1 . [0 [dup ++] codireco] rest cons\n", - " 0 1 [0 [dup ++] codireco] . rest cons\n", - " 0 1 [[dup ++] codireco] . cons\n", - " 0 [1 [dup ++] codireco] . \n" - ] - } - ], - "source": [ - "V('[0 [dup ++] codireco] x')" - ] - }, - { - "cell_type": "code", - "execution_count": 37, - "metadata": {}, - "outputs": [], - "source": [ - "define('G == [codireco] cons cons')" - ] - }, - { - "cell_type": "code", - "execution_count": 38, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "230 231 232 233 234\n" - ] - } - ], - "source": [ - "J('230 [dup ++] G 5 [x] times pop')" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.12" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Generator Programs.md b/docs/Generator Programs.md deleted file mode 100644 index b10028c..0000000 --- a/docs/Generator Programs.md +++ /dev/null @@ -1,508 +0,0 @@ - -# Using `x` to Generate Values - -Cf. jp-reprod.html - - -```python -from notebook_preamble import J, V, define -``` - -Consider the `x` combinator: - - x == dup i - -We can apply it to a quoted program consisting of some value `a` and some function `B`: - - [a B] x - [a B] a B - -Let `B` function `swap` the `a` with the quote and run some function `C` on it to generate a new value `b`: - - B == swap [C] dip - - [a B] a B - [a B] a swap [C] dip - a [a B] [C] dip - a C [a B] - b [a B] - -Now discard the quoted `a` with `rest` then `cons` `b`: - - b [a B] rest cons - b [B] cons - [b B] - -Altogether, this is the definition of `B`: - - B == swap [C] dip rest cons - -We can make a generator for the Natural numbers (0, 1, 2, ...) by using `0` for `a` and `[dup ++]` for `[C]`: - - [0 swap [dup ++] dip rest cons] - -Let's try it: - - -```python -V('[0 swap [dup ++] dip rest cons] x') -``` - - . [0 swap [dup ++] dip rest cons] x - [0 swap [dup ++] dip rest cons] . x - [0 swap [dup ++] dip rest cons] . 0 swap [dup ++] dip rest cons - [0 swap [dup ++] dip rest cons] 0 . swap [dup ++] dip rest cons - 0 [0 swap [dup ++] dip rest cons] . [dup ++] dip rest cons - 0 [0 swap [dup ++] dip rest cons] [dup ++] . dip rest cons - 0 . dup ++ [0 swap [dup ++] dip rest cons] rest cons - 0 0 . ++ [0 swap [dup ++] dip rest cons] rest cons - 0 1 . [0 swap [dup ++] dip rest cons] rest cons - 0 1 [0 swap [dup ++] dip rest cons] . rest cons - 0 1 [swap [dup ++] dip rest cons] . cons - 0 [1 swap [dup ++] dip rest cons] . - - -After one application of `x` the quoted program contains `1` and `0` is below it on the stack. - - -```python -J('[0 swap [dup ++] dip rest cons] x x x x x pop') -``` - - 0 1 2 3 4 - - -## `direco` - - -```python -define('direco == dip rest cons') -``` - - -```python -V('[0 swap [dup ++] direco] x') -``` - - . [0 swap [dup ++] direco] x - [0 swap [dup ++] direco] . x - [0 swap [dup ++] direco] . 0 swap [dup ++] direco - [0 swap [dup ++] direco] 0 . swap [dup ++] direco - 0 [0 swap [dup ++] direco] . [dup ++] direco - 0 [0 swap [dup ++] direco] [dup ++] . direco - 0 [0 swap [dup ++] direco] [dup ++] . dip rest cons - 0 . dup ++ [0 swap [dup ++] direco] rest cons - 0 0 . ++ [0 swap [dup ++] direco] rest cons - 0 1 . [0 swap [dup ++] direco] rest cons - 0 1 [0 swap [dup ++] direco] . rest cons - 0 1 [swap [dup ++] direco] . cons - 0 [1 swap [dup ++] direco] . - - -## Making Generators -We want to define a function that accepts `a` and `[C]` and builds our quoted program: - - a [C] G - ------------------------- - [a swap [C] direco] - -Working in reverse: - - [a swap [C] direco] cons - a [swap [C] direco] concat - a [swap] [[C] direco] swap - a [[C] direco] [swap] - a [C] [direco] cons [swap] - -Reading from the bottom up: - - G == [direco] cons [swap] swap concat cons - G == [direco] cons [swap] swoncat cons - - -```python -define('G == [direco] cons [swap] swoncat cons') -``` - -Let's try it out: - - -```python -J('0 [dup ++] G') -``` - - [0 swap [dup ++] direco] - - - -```python -J('0 [dup ++] G x x x pop') -``` - - 0 1 2 - - -### Powers of 2 - - -```python -J('1 [dup 1 <<] G x x x x x x x x x pop') -``` - - 1 2 4 8 16 32 64 128 256 - - -### `[x] times` -If we have one of these quoted programs we can drive it using `times` with the `x` combinator. - - -```python -J('23 [dup ++] G 5 [x] times') -``` - - 23 24 25 26 27 [28 swap [dup ++] direco] - - -## Generating Multiples of Three and Five -Look at the treatment of the Project Euler Problem One in the "Developing a Program" notebook and you'll see that we might be interested in generating an endless cycle of: - - 3 2 1 3 1 2 3 - -To do this we want to encode the numbers as pairs of bits in a single int: - - 3 2 1 3 1 2 3 - 0b 11 10 01 11 01 10 11 == 14811 - -And pick them off by masking with 3 (binary 11) and then shifting the int right two bits. - - -```python -define('PE1.1 == dup [3 &] dip 2 >>') -``` - - -```python -V('14811 PE1.1') -``` - - . 14811 PE1.1 - 14811 . PE1.1 - 14811 . dup [3 &] dip 2 >> - 14811 14811 . [3 &] dip 2 >> - 14811 14811 [3 &] . dip 2 >> - 14811 . 3 & 14811 2 >> - 14811 3 . & 14811 2 >> - 3 . 14811 2 >> - 3 14811 . 2 >> - 3 14811 2 . >> - 3 3702 . - - -If we plug `14811` and `[PE1.1]` into our generator form... - - -```python -J('14811 [PE1.1] G') -``` - - [14811 swap [PE1.1] direco] - - -...we get a generator that works for seven cycles before it reaches zero: - - -```python -J('[14811 swap [PE1.1] direco] 7 [x] times') -``` - - 3 2 1 3 1 2 3 [0 swap [PE1.1] direco] - - -### Reset at Zero -We need a function that checks if the int has reached zero and resets it if so. - - -```python -define('PE1.1.check == dup [pop 14811] [] branch') -``` - - -```python -J('14811 [PE1.1.check PE1.1] G') -``` - - [14811 swap [PE1.1.check PE1.1] direco] - - - -```python -J('[14811 swap [PE1.1.check PE1.1] direco] 21 [x] times') -``` - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [PE1.1.check PE1.1] direco] - - -(It would be more efficient to reset the int every seven cycles but that's a little beyond the scope of this article. This solution does extra work, but not much, and we're not using it "in production" as they say.) - -### Run 466 times -In the PE1 problem we are asked to sum all the multiples of three and five less than 1000. It's worked out that we need to use all seven numbers sixty-six times and then four more. - - -```python -J('7 66 * 4 +') -``` - - 466 - - -If we drive our generator 466 times and sum the stack we get 999. - - -```python -J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times') -``` - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 [57 swap [PE1.1.check PE1.1] direco] - - - -```python -J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times pop enstacken sum') -``` - - 999 - - -## Project Euler Problem One - - -```python -define('PE1.2 == + dup [+] dip') -``` - -Now we can add `PE1.2` to the quoted program given to `G`. - - -```python -J('0 0 0 [PE1.1.check PE1.1] G 466 [x [PE1.2] dip] times popop') -``` - - 233168 - - -## A generator for the Fibonacci Sequence. -Consider: - - [b a F] x - [b a F] b a F - -The obvious first thing to do is just add `b` and `a`: - - [b a F] b a + - [b a F] b+a - -From here we want to arrive at: - - b [b+a b F] - -Let's start with `swons`: - - [b a F] b+a swons - [b+a b a F] - -Considering this quote as a stack: - - F a b b+a - -We want to get it to: - - F b b+a b - -So: - - F a b b+a popdd over - F b b+a b - -And therefore: - - [b+a b a F] [popdd over] infra - [b b+a b F] - -But we can just use `cons` to carry `b+a` into the quote: - - [b a F] b+a [popdd over] cons infra - [b a F] [b+a popdd over] infra - [b b+a b F] - -Lastly: - - [b b+a b F] uncons - b [b+a b F] - -Putting it all together: - - F == + [popdd over] cons infra uncons - fib_gen == [1 1 F] - - -```python -define('fib == + [popdd over] cons infra uncons') -``` - - -```python -define('fib_gen == [1 1 fib]') -``` - - -```python -J('fib_gen 10 [x] times') -``` - - 1 2 3 5 8 13 21 34 55 89 [144 89 fib] - - -## Project Euler Problem Two - By considering the terms in the Fibonacci sequence whose values do not exceed four million, - find the sum of the even-valued terms. - -Now that we have a generator for the Fibonacci sequence, we need a function that adds a term in the sequence to a sum if it is even, and `pop`s it otherwise. - - -```python -define('PE2.1 == dup 2 % [+] [pop] branch') -``` - -And a predicate function that detects when the terms in the series "exceed four million". - - -```python -define('>4M == 4000000 >') -``` - -Now it's straightforward to define `PE2` as a recursive function that generates terms in the Fibonacci sequence until they exceed four million and sums the even ones. - - -```python -define('PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec') -``` - - -```python -J('PE2') -``` - - 4613732 - - -Here's the collected program definitions: - - fib == + swons [popdd over] infra uncons - fib_gen == [1 1 fib] - - even == dup 2 % - >4M == 4000000 > - - PE2.1 == even [+] [pop] branch - PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec - -### Even-valued Fibonacci Terms - -Using `o` for odd and `e` for even: - - o + o = e - e + e = e - o + e = o - -So the Fibonacci sequence considered in terms of just parity would be: - - o o e o o e o o e o o e o o e o o e - 1 1 2 3 5 8 . . . - -Every third term is even. - - - -```python -J('[1 0 fib] x x x') # To start the sequence with 1 1 2 3 instead of 1 2 3. -``` - - 1 1 2 [3 2 fib] - - -Drive the generator three times and `popop` the two odd terms. - - -```python -J('[1 0 fib] x x x [popop] dipd') -``` - - 2 [3 2 fib] - - - -```python -define('PE2.2 == x x x [popop] dipd') -``` - - -```python -J('[1 0 fib] 10 [PE2.2] times') -``` - - 2 8 34 144 610 2584 10946 46368 196418 832040 [1346269 832040 fib] - - -Replace `x` with our new driver function `PE2.2` and start our `fib` generator at `1 0`. - - -```python -J('0 [1 0 fib] PE2.2 [pop >4M] [popop] [[PE2.1] dip PE2.2] primrec') -``` - - 4613732 - - -## How to compile these? -You would probably start with a special version of `G`, and perhaps modifications to the default `x`? - -## An Interesting Variation - - -```python -define('codireco == cons dip rest cons') -``` - - -```python -V('[0 [dup ++] codireco] x') -``` - - . [0 [dup ++] codireco] x - [0 [dup ++] codireco] . x - [0 [dup ++] codireco] . 0 [dup ++] codireco - [0 [dup ++] codireco] 0 . [dup ++] codireco - [0 [dup ++] codireco] 0 [dup ++] . codireco - [0 [dup ++] codireco] 0 [dup ++] . cons dip rest cons - [0 [dup ++] codireco] [0 dup ++] . dip rest cons - . 0 dup ++ [0 [dup ++] codireco] rest cons - 0 . dup ++ [0 [dup ++] codireco] rest cons - 0 0 . ++ [0 [dup ++] codireco] rest cons - 0 1 . [0 [dup ++] codireco] rest cons - 0 1 [0 [dup ++] codireco] . rest cons - 0 1 [[dup ++] codireco] . cons - 0 [1 [dup ++] codireco] . - - - -```python -define('G == [codireco] cons cons') -``` - - -```python -J('230 [dup ++] G 5 [x] times pop') -``` - - 230 231 232 233 234 - diff --git a/docs/Generator Programs.rst b/docs/Generator Programs.rst deleted file mode 100644 index a201c0d..0000000 --- a/docs/Generator Programs.rst +++ /dev/null @@ -1,639 +0,0 @@ - -Using ``x`` to Generate Values -============================== - -Cf. jp-reprod.html - -.. code:: ipython2 - - from notebook_preamble import J, V, define - -Consider the ``x`` combinator: - -:: - - x == dup i - -We can apply it to a quoted program consisting of some value ``a`` and -some function ``B``: - -:: - - [a B] x - [a B] a B - -Let ``B`` function ``swap`` the ``a`` with the quote and run some -function ``C`` on it to generate a new value ``b``: - -:: - - B == swap [C] dip - - [a B] a B - [a B] a swap [C] dip - a [a B] [C] dip - a C [a B] - b [a B] - -Now discard the quoted ``a`` with ``rest`` then ``cons`` ``b``: - -:: - - b [a B] rest cons - b [B] cons - [b B] - -Altogether, this is the definition of ``B``: - -:: - - B == swap [C] dip rest cons - -We can make a generator for the Natural numbers (0, 1, 2, ...) by using -``0`` for ``a`` and ``[dup ++]`` for ``[C]``: - -:: - - [0 swap [dup ++] dip rest cons] - -Let's try it: - -.. code:: ipython2 - - V('[0 swap [dup ++] dip rest cons] x') - - -.. parsed-literal:: - - . [0 swap [dup ++] dip rest cons] x - [0 swap [dup ++] dip rest cons] . x - [0 swap [dup ++] dip rest cons] . 0 swap [dup ++] dip rest cons - [0 swap [dup ++] dip rest cons] 0 . swap [dup ++] dip rest cons - 0 [0 swap [dup ++] dip rest cons] . [dup ++] dip rest cons - 0 [0 swap [dup ++] dip rest cons] [dup ++] . dip rest cons - 0 . dup ++ [0 swap [dup ++] dip rest cons] rest cons - 0 0 . ++ [0 swap [dup ++] dip rest cons] rest cons - 0 1 . [0 swap [dup ++] dip rest cons] rest cons - 0 1 [0 swap [dup ++] dip rest cons] . rest cons - 0 1 [swap [dup ++] dip rest cons] . cons - 0 [1 swap [dup ++] dip rest cons] . - - -After one application of ``x`` the quoted program contains ``1`` and -``0`` is below it on the stack. - -.. code:: ipython2 - - J('[0 swap [dup ++] dip rest cons] x x x x x pop') - - -.. parsed-literal:: - - 0 1 2 3 4 - - -``direco`` ----------- - -.. code:: ipython2 - - define('direco == dip rest cons') - -.. code:: ipython2 - - V('[0 swap [dup ++] direco] x') - - -.. parsed-literal:: - - . [0 swap [dup ++] direco] x - [0 swap [dup ++] direco] . x - [0 swap [dup ++] direco] . 0 swap [dup ++] direco - [0 swap [dup ++] direco] 0 . swap [dup ++] direco - 0 [0 swap [dup ++] direco] . [dup ++] direco - 0 [0 swap [dup ++] direco] [dup ++] . direco - 0 [0 swap [dup ++] direco] [dup ++] . dip rest cons - 0 . dup ++ [0 swap [dup ++] direco] rest cons - 0 0 . ++ [0 swap [dup ++] direco] rest cons - 0 1 . [0 swap [dup ++] direco] rest cons - 0 1 [0 swap [dup ++] direco] . rest cons - 0 1 [swap [dup ++] direco] . cons - 0 [1 swap [dup ++] direco] . - - -Making Generators ------------------ - -We want to define a function that accepts ``a`` and ``[C]`` and builds -our quoted program: - -:: - - a [C] G - ------------------------- - [a swap [C] direco] - -Working in reverse: - -:: - - [a swap [C] direco] cons - a [swap [C] direco] concat - a [swap] [[C] direco] swap - a [[C] direco] [swap] - a [C] [direco] cons [swap] - -Reading from the bottom up: - -:: - - G == [direco] cons [swap] swap concat cons - G == [direco] cons [swap] swoncat cons - -.. code:: ipython2 - - define('G == [direco] cons [swap] swoncat cons') - -Let's try it out: - -.. code:: ipython2 - - J('0 [dup ++] G') - - -.. parsed-literal:: - - [0 swap [dup ++] direco] - - -.. code:: ipython2 - - J('0 [dup ++] G x x x pop') - - -.. parsed-literal:: - - 0 1 2 - - -Powers of 2 -~~~~~~~~~~~ - -.. code:: ipython2 - - J('1 [dup 1 <<] G x x x x x x x x x pop') - - -.. parsed-literal:: - - 1 2 4 8 16 32 64 128 256 - - -``[x] times`` -~~~~~~~~~~~~~ - -If we have one of these quoted programs we can drive it using ``times`` -with the ``x`` combinator. - -.. code:: ipython2 - - J('23 [dup ++] G 5 [x] times') - - -.. parsed-literal:: - - 23 24 25 26 27 [28 swap [dup ++] direco] - - -Generating Multiples of Three and Five --------------------------------------- - -Look at the treatment of the Project Euler Problem One in the -"Developing a Program" notebook and you'll see that we might be -interested in generating an endless cycle of: - -:: - - 3 2 1 3 1 2 3 - -To do this we want to encode the numbers as pairs of bits in a single -int: - -:: - - 3 2 1 3 1 2 3 - 0b 11 10 01 11 01 10 11 == 14811 - -And pick them off by masking with 3 (binary 11) and then shifting the -int right two bits. - -.. code:: ipython2 - - define('PE1.1 == dup [3 &] dip 2 >>') - -.. code:: ipython2 - - V('14811 PE1.1') - - -.. parsed-literal:: - - . 14811 PE1.1 - 14811 . PE1.1 - 14811 . dup [3 &] dip 2 >> - 14811 14811 . [3 &] dip 2 >> - 14811 14811 [3 &] . dip 2 >> - 14811 . 3 & 14811 2 >> - 14811 3 . & 14811 2 >> - 3 . 14811 2 >> - 3 14811 . 2 >> - 3 14811 2 . >> - 3 3702 . - - -If we plug ``14811`` and ``[PE1.1]`` into our generator form... - -.. code:: ipython2 - - J('14811 [PE1.1] G') - - -.. parsed-literal:: - - [14811 swap [PE1.1] direco] - - -...we get a generator that works for seven cycles before it reaches -zero: - -.. code:: ipython2 - - J('[14811 swap [PE1.1] direco] 7 [x] times') - - -.. parsed-literal:: - - 3 2 1 3 1 2 3 [0 swap [PE1.1] direco] - - -Reset at Zero -~~~~~~~~~~~~~ - -We need a function that checks if the int has reached zero and resets it -if so. - -.. code:: ipython2 - - define('PE1.1.check == dup [pop 14811] [] branch') - -.. code:: ipython2 - - J('14811 [PE1.1.check PE1.1] G') - - -.. parsed-literal:: - - [14811 swap [PE1.1.check PE1.1] direco] - - -.. code:: ipython2 - - J('[14811 swap [PE1.1.check PE1.1] direco] 21 [x] times') - - -.. parsed-literal:: - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 [0 swap [PE1.1.check PE1.1] direco] - - -(It would be more efficient to reset the int every seven cycles but -that's a little beyond the scope of this article. This solution does -extra work, but not much, and we're not using it "in production" as they -say.) - -Run 466 times -~~~~~~~~~~~~~ - -In the PE1 problem we are asked to sum all the multiples of three and -five less than 1000. It's worked out that we need to use all seven -numbers sixty-six times and then four more. - -.. code:: ipython2 - - J('7 66 * 4 +') - - -.. parsed-literal:: - - 466 - - -If we drive our generator 466 times and sum the stack we get 999. - -.. code:: ipython2 - - J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times') - - -.. parsed-literal:: - - 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 1 2 3 3 2 1 3 [57 swap [PE1.1.check PE1.1] direco] - - -.. code:: ipython2 - - J('[14811 swap [PE1.1.check PE1.1] direco] 466 [x] times pop enstacken sum') - - -.. parsed-literal:: - - 999 - - -Project Euler Problem One -------------------------- - -.. code:: ipython2 - - define('PE1.2 == + dup [+] dip') - -Now we can add ``PE1.2`` to the quoted program given to ``G``. - -.. code:: ipython2 - - J('0 0 0 [PE1.1.check PE1.1] G 466 [x [PE1.2] dip] times popop') - - -.. parsed-literal:: - - 233168 - - -A generator for the Fibonacci Sequence. ---------------------------------------- - -Consider: - -:: - - [b a F] x - [b a F] b a F - -The obvious first thing to do is just add ``b`` and ``a``: - -:: - - [b a F] b a + - [b a F] b+a - -From here we want to arrive at: - -:: - - b [b+a b F] - -Let's start with ``swons``: - -:: - - [b a F] b+a swons - [b+a b a F] - -Considering this quote as a stack: - -:: - - F a b b+a - -We want to get it to: - -:: - - F b b+a b - -So: - -:: - - F a b b+a popdd over - F b b+a b - -And therefore: - -:: - - [b+a b a F] [popdd over] infra - [b b+a b F] - -But we can just use ``cons`` to carry ``b+a`` into the quote: - -:: - - [b a F] b+a [popdd over] cons infra - [b a F] [b+a popdd over] infra - [b b+a b F] - -Lastly: - -:: - - [b b+a b F] uncons - b [b+a b F] - -Putting it all together: - -:: - - F == + [popdd over] cons infra uncons - fib_gen == [1 1 F] - -.. code:: ipython2 - - define('fib == + [popdd over] cons infra uncons') - -.. code:: ipython2 - - define('fib_gen == [1 1 fib]') - -.. code:: ipython2 - - J('fib_gen 10 [x] times') - - -.. parsed-literal:: - - 1 2 3 5 8 13 21 34 55 89 [144 89 fib] - - -Project Euler Problem Two -------------------------- - -:: - - By considering the terms in the Fibonacci sequence whose values do not exceed four million, - find the sum of the even-valued terms. - -Now that we have a generator for the Fibonacci sequence, we need a -function that adds a term in the sequence to a sum if it is even, and -``pop``\ s it otherwise. - -.. code:: ipython2 - - define('PE2.1 == dup 2 % [+] [pop] branch') - -And a predicate function that detects when the terms in the series -"exceed four million". - -.. code:: ipython2 - - define('>4M == 4000000 >') - -Now it's straightforward to define ``PE2`` as a recursive function that -generates terms in the Fibonacci sequence until they exceed four million -and sums the even ones. - -.. code:: ipython2 - - define('PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec') - -.. code:: ipython2 - - J('PE2') - - -.. parsed-literal:: - - 4613732 - - -Here's the collected program definitions: - -:: - - fib == + swons [popdd over] infra uncons - fib_gen == [1 1 fib] - - even == dup 2 % - >4M == 4000000 > - - PE2.1 == even [+] [pop] branch - PE2 == 0 fib_gen x [pop >4M] [popop] [[PE2.1] dip x] primrec - -Even-valued Fibonacci Terms -~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Using ``o`` for odd and ``e`` for even: - -:: - - o + o = e - e + e = e - o + e = o - -So the Fibonacci sequence considered in terms of just parity would be: - -:: - - o o e o o e o o e o o e o o e o o e - 1 1 2 3 5 8 . . . - -Every third term is even. - -.. code:: ipython2 - - J('[1 0 fib] x x x') # To start the sequence with 1 1 2 3 instead of 1 2 3. - - -.. parsed-literal:: - - 1 1 2 [3 2 fib] - - -Drive the generator three times and ``popop`` the two odd terms. - -.. code:: ipython2 - - J('[1 0 fib] x x x [popop] dipd') - - -.. parsed-literal:: - - 2 [3 2 fib] - - -.. code:: ipython2 - - define('PE2.2 == x x x [popop] dipd') - -.. code:: ipython2 - - J('[1 0 fib] 10 [PE2.2] times') - - -.. parsed-literal:: - - 2 8 34 144 610 2584 10946 46368 196418 832040 [1346269 832040 fib] - - -Replace ``x`` with our new driver function ``PE2.2`` and start our -``fib`` generator at ``1 0``. - -.. code:: ipython2 - - J('0 [1 0 fib] PE2.2 [pop >4M] [popop] [[PE2.1] dip PE2.2] primrec') - - -.. parsed-literal:: - - 4613732 - - -How to compile these? ---------------------- - -You would probably start with a special version of ``G``, and perhaps -modifications to the default ``x``? - -An Interesting Variation ------------------------- - -.. code:: ipython2 - - define('codireco == cons dip rest cons') - -.. code:: ipython2 - - V('[0 [dup ++] codireco] x') - - -.. parsed-literal:: - - . [0 [dup ++] codireco] x - [0 [dup ++] codireco] . x - [0 [dup ++] codireco] . 0 [dup ++] codireco - [0 [dup ++] codireco] 0 . [dup ++] codireco - [0 [dup ++] codireco] 0 [dup ++] . codireco - [0 [dup ++] codireco] 0 [dup ++] . cons dip rest cons - [0 [dup ++] codireco] [0 dup ++] . dip rest cons - . 0 dup ++ [0 [dup ++] codireco] rest cons - 0 . dup ++ [0 [dup ++] codireco] rest cons - 0 0 . ++ [0 [dup ++] codireco] rest cons - 0 1 . [0 [dup ++] codireco] rest cons - 0 1 [0 [dup ++] codireco] . rest cons - 0 1 [[dup ++] codireco] . cons - 0 [1 [dup ++] codireco] . - - -.. code:: ipython2 - - define('G == [codireco] cons cons') - -.. code:: ipython2 - - J('230 [dup ++] G 5 [x] times pop') - - -.. parsed-literal:: - - 230 231 232 233 234 - diff --git a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.html b/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.html deleted file mode 100644 index ff494b5..0000000 --- a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.html +++ /dev/null @@ -1,15184 +0,0 @@ - - - -Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators - - - - - - - - - - - - - - - - - - - -
-
- -
-
-
-
-

Cf. "Bananas, Lenses, & Barbed Wire"

- -
-
-
-
-
-
-
-

Hylomorphism

A hylomorphism H :: A -> B converts a value of type A into a value of type B by means of:

-
    -
  • A generator G :: A -> (A, B)
    • -
  • A combiner F :: (B, B) -> B
    • -
  • A predicate P :: A -> Bool to detect the base case
    • -
  • A base case value c :: B
    • -
  • Recursive calls (zero or more); it has a "call stack in the form of a cons list".
    • -
-

It may be helpful to see this function implemented in imperative Python code.

- -
-
-
-
-
-
In [1]:
-
-
-
def hylomorphism(c, F, P, G):
-    '''Return a hylomorphism function H.'''
-
-    def H(a):
-        if P(a):
-            result = c
-        else:
-            b, aa = G(a)
-            result = F(b, H(aa))
-        return result
-
-    return H
-
- -
-
-
- -
-
-
-
-
-

Finding Triangular Numbers

As a concrete example let's use a function that, given a positive integer, returns the sum of all positive integers less than that one. (In this case the types A and B are both int.)

-

With range() and sum()

-
-
-
-
-
-
In [2]:
-
-
-
r = range(10)
-r
-
- -
-
-
- -
-
- - -
- -
Out[2]:
- - - - -
-
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
-
- -
- -
-
- -
-
-
-
In [3]:
-
-
-
sum(r)
-
- -
-
-
- -
-
- - -
- -
Out[3]:
- - - - -
-
45
-
- -
- -
-
- -
-
-
-
In [4]:
-
-
-
range_sum = lambda n: sum(range(n))
-range_sum(10)
-
- -
-
-
- -
-
- - -
- -
Out[4]:
- - - - -
-
45
-
- -
- -
-
- -
-
-
-
-
-

As a hylomorphism

-
-
-
-
-
-
In [5]:
-
-
-
G = lambda n: (n - 1, n - 1)
-F = lambda a, b: a + b
-P = lambda n: n <= 1
-
-H = hylomorphism(0, F, P, G)
-
- -
-
-
- -
-
-
-
In [6]:
-
-
-
H(10)
-
- -
-
-
- -
-
- - -
- -
Out[6]:
- - - - -
-
45
-
- -
- -
-
- -
-
-
-
-
-

If you were to run the above code in a debugger and check out the call stack you would find that the variable b in each call to H() is storing the intermediate values as H() recurses. This is what was meant by "call stack in the form of a cons list".

- -
-
-
-
-
-
-
-

Joy Preamble

-
-
-
-
-
-
In [7]:
-
-
-
from notebook_preamble import D, DefinitionWrapper, J, V, define
-
- -
-
-
- -
-
-
-
-
-

Hylomorphism in Joy

We can define a combinator hylomorphism that will make a hylomorphism combinator H from constituent parts.

- -
H == c [F] [P] [G] hylomorphism
-
-
-

The function H is recursive, so we start with ifte and set the else-part to -some function J that will contain a quoted copy of H. (The then-part just -discards the leftover a and replaces it with the base case value c.)

- -
H == [P] [pop c] [J] ifte
-
-
-

The else-part J gets just the argument a on the stack.

- -
a J
-a G              The first thing to do is use the generator G
-aa b             which produces b and a new aa
-aa b [H] dip     we recur with H on the new aa
-aa H b F         and run F on the result.
-
-
-

This gives us a definition for J.

- -
J == G [H] dip F
-
-
-

Plug it in and convert to genrec.

- -
H == [P] [pop c] [G [H] dip F] ifte
-H == [P] [pop c] [G]   [dip F] genrec
-
-
-

This is the form of a hylomorphism in Joy, which nicely illustrates that -it is a simple specialization of the general recursion combinator.

- -
H == [P] [pop c] [G] [dip F] genrec
- -
-
-
-
-
-
-
-

Derivation of hylomorphism

Now we just need to derive a definition that builds the genrec arguments -out of the pieces given to the hylomorphism combinator.

- -
H == [P] [pop c]              [G]                  [dip F] genrec
-     [P] [c]    [pop] swoncat [G]        [F] [dip] swoncat genrec
-     [P] c unit [pop] swoncat [G]        [F] [dip] swoncat genrec
-     [P] c [G] [F] [unit [pop] swoncat] dipd [dip] swoncat genrec
-
-
-

Working in reverse:

-
    -
  • Use swoncat twice to decouple [c] and [F].
    • -
  • Use unit to dequote c.
    • -
  • Use dipd to untangle [unit [pop] swoncat] from the givens.
    • -
-

At this point all of the arguments (givens) to the hylomorphism are to the left so we have -a definition for hylomorphism:

- -
hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec
-
-
-

The order of parameters is different than the one we started with but -that hardly matters, you can rearrange them or just supply them in the -expected order.

- -
[P] c [G] [F] hylomorphism == H
- -
-
-
-
-
-
In [8]:
-
-
-
define('hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec')
-
- -
-
-
- -
-
-
-
-
-

Demonstrate summing a range of integers from 0 to n-1.

-
    -
  • [P] is [0 <=]
    • -
  • c is 0
    • -
  • [G] is [1 - dup]
    • -
  • [F] is [+]
    • -
-

So to sum the positive integers less than five we can do this.

- -
-
-
-
-
-
In [9]:
-
-
-
V('5 [0 <=] 0 [1 - dup] [+] hylomorphism')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                               . 5 [0 <=] 0 [1 - dup] [+] hylomorphism
-                                                                             5 . [0 <=] 0 [1 - dup] [+] hylomorphism
-                                                                      5 [0 <=] . 0 [1 - dup] [+] hylomorphism
-                                                                    5 [0 <=] 0 . [1 - dup] [+] hylomorphism
-                                                          5 [0 <=] 0 [1 - dup] . [+] hylomorphism
-                                                      5 [0 <=] 0 [1 - dup] [+] . hylomorphism
-                                                      5 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec
-                                 5 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec
-                                                                    5 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                                    5 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                                 5 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                                  5 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                            5 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                            5 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec
-                                                            5 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec
-                                                              5 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec
-                                                    5 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec
-                                                5 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec
-                                          5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec
-                                          5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec
-                                          5 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec
-                                            5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec
-    5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte
-5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i
-                                                                             5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i
-                                                                           5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i
-                                                                         False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i
-   False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i
-   5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i
-     5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i
-                   5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i
-                                                                             5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                                                           5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                                                             4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                                                           4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip +
-                                                                             4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 +
-                                                                      4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 +
-                                                              4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 +
-                                                    4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 +
-                                            4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 +
-    4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 +
-4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 +
-                                                                             4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 +
-                                                                           4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 +
-                                                                         False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 +
-   False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 +
-   4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 +
-     4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 +
-                   4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 +
-                                                                             4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +
-                                                                           4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +
-                                                                             3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +
-                                                                           3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +
-                                 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 +
-                                                                             3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 +
-                                                                      3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 +
-                                                              3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 +
-                                                    3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 +
-                                            3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 +
-    3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 +
-3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 +
-                                                                             3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 +
-                                                                           3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 +
-                                                                         False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 +
-   False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 +
-   3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 +
-     3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 +
-                   3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 +
-                                                                             3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +
-                                                                           3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +
-                                                                             2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +
-                                                                           2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +
-                                 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 +
-                                                                             2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 +
-                                                                      2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 +
-                                                              2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 +
-                                                    2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 +
-                                            2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 +
-    2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 +
-2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 +
-                                                                             2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 +
-                                                                           2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 +
-                                                                         False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 +
-   False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 +
-   2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 +
-     2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 +
-                   2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 +
-                                                                             2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +
-                                                                           2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +
-                                                                             1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +
-                                                                           1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +
-                                 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 +
-                                                                             1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 +
-                                                                      1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 +
-                                                              1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 +
-                                                    1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 +
-                                            1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 +
-    1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 +
-1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 +
-                                                                             1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 +
-                                                                           1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 +
-                                                                         False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 +
-   False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 +
-   1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 +
-     1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 +
-                   1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 +
-                                                                             1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +
-                                                                           1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +
-                                                                             0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +
-                                                                           0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +
-                                 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 +
-                                                                             0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 +
-                                                                      0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 +
-                                                              0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 +
-                                                    0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 +
-                                            0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 +
-    0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 +
-0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 +
-                                                                             0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 +
-                                                                           0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 +
-                                                                          True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 +
-    True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 +
-    0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 +
-      0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 +
-                                                                     0 [pop 0] . i 0 + 1 + 2 + 3 + 4 +
-                                                                             0 . pop 0 0 + 1 + 2 + 3 + 4 +
-                                                                               . 0 0 + 1 + 2 + 3 + 4 +
-                                                                             0 . 0 + 1 + 2 + 3 + 4 +
-                                                                           0 0 . + 1 + 2 + 3 + 4 +
-                                                                             0 . 1 + 2 + 3 + 4 +
-                                                                           0 1 . + 2 + 3 + 4 +
-                                                                             1 . 2 + 3 + 4 +
-                                                                           1 2 . + 3 + 4 +
-                                                                             3 . 3 + 4 +
-                                                                           3 3 . + 4 +
-                                                                             6 . 4 +
-                                                                           6 4 . +
-                                                                            10 . 
-
-
-
- -
-
- -
-
-
-
-
-

Anamorphism

An anamorphism can be defined as a hylomorphism that uses [] for c and -swons for F.

- -
[P] [G] anamorphism == [P] [] [G] [swons] hylomorphism == A
-
-
-

This allows us to define an anamorphism combinator in terms of -the hylomorphism combinator.

- -
[] swap [swons] hylomorphism == anamorphism
-
-
-

Partial evaluation gives us a "pre-cooked" form.

- -
[P] [G] . anamorphism
-[P] [G] . [] swap [swons] hylomorphism
-[P] [G] [] . swap [swons] hylomorphism
-[P] [] [G] . [swons] hylomorphism
-[P] [] [G] [swons] . hylomorphism
-[P] [] [G] [swons] . [unit [pop] swoncat] dipd [dip] swoncat genrec
-[P] [] [G] [swons] [unit [pop] swoncat] . dipd [dip] swoncat genrec
-[P] [] . unit [pop] swoncat [G] [swons] [dip] swoncat genrec
-[P] [[]] [pop] . swoncat [G] [swons] [dip] swoncat genrec
-[P] [pop []] [G] [swons] [dip] . swoncat genrec
-
-[P] [pop []] [G] [dip swons] genrec
-
-
-

(We could also have just substituted for c and F in the definition of H.)

- -
H == [P] [pop c ] [G] [dip F    ] genrec
-A == [P] [pop []] [G] [dip swons] genrec
-
-
-

The partial evaluation is overkill in this case but it serves as a -reminder that this sort of program specialization can, in many cases, be -carried out automatically.)

-

Untangle [G] from [pop []] using swap.

- -
[P] [G] [pop []] swap [dip swons] genrec
-
-
-

All of the arguments to anamorphism are to the left, so we have a definition for it.

- -
anamorphism == [pop []] swap [dip swons] genrec
-
-
-

An example of an anamorphism is the range function.

- -
range == [0 <=] [1 - dup] anamorphism
- -
-
-
-
-
-
-
-

Catamorphism

A catamorphism can be defined as a hylomorphism that uses [uncons swap] for [G] -and [[] =] for the predicate [P].

- -
c [F] catamorphism == [[] =] c [uncons swap] [F] hylomorphism == C
-
-
-

This allows us to define a catamorphism combinator in terms of -the hylomorphism combinator.

- -
[[] =] roll> [uncons swap] swap hylomorphism == catamorphism
-
-
-

Partial evaluation doesn't help much.

- -
c [F] . catamorphism
-c [F] . [[] =] roll> [uncons swap] swap hylomorphism
-c [F] [[] =] . roll> [uncons swap] swap hylomorphism
-[[] =] c [F] [uncons swap] . swap hylomorphism
-[[] =] c [uncons swap] [F] . hylomorphism
-[[] =] c [uncons swap] [F] [unit [pop] swoncat] . dipd [dip] swoncat genrec
-[[] =] c . unit [pop] swoncat [uncons swap] [F] [dip] swoncat genrec
-[[] =] [c] [pop] . swoncat [uncons swap] [F] [dip] swoncat genrec
-[[] =] [pop c] [uncons swap] [F] [dip] . swoncat genrec
-[[] =] [pop c] [uncons swap] [dip F] genrec
-
-
-

Because the arguments to catamorphism have to be prepared (unlike the arguments -to anamorphism, which only need to be rearranged slightly) there isn't much point -to "pre-cooking" the definition.

- -
catamorphism == [[] =] roll> [uncons swap] swap hylomorphism
-
-
-

An example of a catamorphism is the sum function.

- -
sum == 0 [+] catamorphism
- -
-
-
-
-
-
-
-

"Fusion Law" for catas (UNFINISHED!!!)

I'm not sure exactly how to translate the "Fusion Law" for catamorphisms into Joy.

-

I know that a map composed with a cata can be expressed as a new cata:

- -
[F] map b [B] cata == b [F B] cata
-
-
-

But this isn't the one described in "Bananas...". That's more like:

-

A cata composed with some function can be expressed as some other cata:

- -
b [B] catamorphism F == c [C] catamorphism
-
-
-

Given:

- -
b F == c
-
-...
-
-B F == [F] dip C
-
-...
-
-b[B]cata F == c[C]cata
-
-F(B(head, tail)) == C(head, F(tail))
-
-1 [2 3] B F         1 [2 3] F C
-
-
-b F == c
-B F == F C
-
-b [B] catamorphism F == c [C] catamorphism
-b [B] catamorphism F == b F [C] catamorphism
-
-...
-
-
-

Or maybe,

- -
[F] map b [B] cata == c [C] cata     ???
-
-[F] map b [B] cata == b [F B] cata    I think this is generally true, unless F consumes stack items
-                                        instead of just transforming TOS.  Of course, there's always [F] unary.
-b [F] unary [[F] unary B] cata
-
-[10 *] map 0 swap [+] step == 0 swap [10 * +] step
-
-
-
-

For example:

- -
F == 10 *
-b == 0
-B == +
-c == 0
-C == F +
-
-b F    == c
-0 10 * == 0
-
-B F    == [F]    dip C
-+ 10 * == [10 *] dip F +
-+ 10 * == [10 *] dip 10 * +
-
-n m + 10 * == 10(n+m)
-
-n m [10 *] dip 10 * +
-n 10 * m 10 * +
-10n m 10 * +
-10n 10m +
-10n+10m
-
-10n+10m = 10(n+m)
-
-
-

Ergo:

- -
0 [+] catamorphism 10 * == 0 [10 * +] catamorphism
- -
-
-
-
-
-
-
-

The step combinator will usually be better to use than catamorphism.

-
sum == 0 swap [+] step
-sum == 0 [+] catamorphism
- -
-
-
-
-
-
-
-

anamorphism catamorphism == hylomorphism

Here is (part of) the payoff.

-

An anamorphism followed by (composed with) a -catamorphism is a hylomorphism, with the advantage that the hylomorphism -does not create the intermediate list structure. The values are stored in -either the call stack, for those implementations that use one, or in the pending -expression ("continuation") for the Joypy interpreter. They still have to -be somewhere, converting from an anamorphism and catamorphism to a hylomorphism -just prevents using additional storage and doing additional processing.

- -
    range == [0 <=] [1 - dup] anamorphism
-      sum == 0 [+] catamorphism
-
-range sum == [0 <=] [1 - dup] anamorphism 0 [+] catamorphism
-          == [0 <=] 0 [1 - dup] [+] hylomorphism
-
-
-

We can let the hylomorphism combinator build range_sum for us or just -substitute ourselves.

- -
        H == [P]    [pop c] [G]       [dip F] genrec
-range_sum == [0 <=] [pop 0] [1 - dup] [dip +] genrec
- -
-
-
-
-
-
In [8]:
-
-
-
defs = '''
-anamorphism == [pop []] swap [dip swons] genrec
-hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec
-catamorphism == [[] =] roll> [uncons swap] swap hylomorphism
-range == [0 <=] [1 - dup] anamorphism
-sum == 0 [+] catamorphism
-range_sum == [0 <=] 0 [1 - dup] [+] hylomorphism
-'''
-
-DefinitionWrapper.add_definitions(defs, D)
-
- -
-
-
- -
-
-
-
In [9]:
-
-
-
J('10 range')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[9 8 7 6 5 4 3 2 1 0]
-
-
-
- -
-
- -
-
-
-
In [10]:
-
-
-
J('[9 8 7 6 5 4 3 2 1 0] sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
45
-
-
-
- -
-
- -
-
-
-
In [11]:
-
-
-
V('10 range sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                                                               . 10 range sum
-                                                                                                                            10 . range sum
-                                                                                                                            10 . [0 <=] [1 - dup] anamorphism sum
-                                                                                                                     10 [0 <=] . [1 - dup] anamorphism sum
-                                                                                                           10 [0 <=] [1 - dup] . anamorphism sum
-                                                                                                           10 [0 <=] [1 - dup] . [pop []] swap [dip swons] genrec sum
-                                                                                                  10 [0 <=] [1 - dup] [pop []] . swap [dip swons] genrec sum
-                                                                                                  10 [0 <=] [pop []] [1 - dup] . [dip swons] genrec sum
-                                                                                      10 [0 <=] [pop []] [1 - dup] [dip swons] . genrec sum
-                                         10 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte sum
-                                    10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [10] [0 <=] . infra first choice i sum
-                                                                                                                            10 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum
-                                                                                                                          10 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum
-                                        False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] . swaack first choice i sum
-                                        10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i sum
-                                          10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i sum
-                                                         10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i sum
-                                                                                                                            10 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum
-                                                                                                                          10 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum
-                                                                                                                             9 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum
-                                                                                                                           9 9 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum
-                                                                            9 9 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons sum
-                                                                                                                             9 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 9 swons sum
-                                                                                                                      9 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 9 swons sum
-                                                                                                             9 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 9 swons sum
-                                                                                                   9 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 9 swons sum
-                                                                                       9 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 9 swons sum
-                                          9 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 9 swons sum
-                                      9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [9] [0 <=] . infra first choice i 9 swons sum
-                                                                                                                             9 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum
-                                                                                                                           9 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] . swaack first choice i 9 swons sum
-                                         9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 9 swons sum
-                                           9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 9 swons sum
-                                                          9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 9 swons sum
-                                                                                                                             9 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum
-                                                                                                                           9 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum
-                                                                                                                             8 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum
-                                                                                                                           8 8 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum
-                                                                            8 8 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 9 swons sum
-                                                                                                                             8 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum
-                                                                                                                      8 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum
-                                                                                                             8 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 8 swons 9 swons sum
-                                                                                                   8 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 8 swons 9 swons sum
-                                                                                       8 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 8 swons 9 swons sum
-                                          8 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 8 swons 9 swons sum
-                                      8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [8] [0 <=] . infra first choice i 8 swons 9 swons sum
-                                                                                                                             8 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum
-                                                                                                                           8 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] . swaack first choice i 8 swons 9 swons sum
-                                         8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 8 swons 9 swons sum
-                                           8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 8 swons 9 swons sum
-                                                          8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 8 swons 9 swons sum
-                                                                                                                             8 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum
-                                                                                                                           8 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum
-                                                                                                                             7 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum
-                                                                                                                           7 7 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum
-                                                                            7 7 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 8 swons 9 swons sum
-                                                                                                                             7 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum
-                                                                                                                      7 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum
-                                                                                                             7 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum
-                                                                                                   7 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 7 swons 8 swons 9 swons sum
-                                                                                       7 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 7 swons 8 swons 9 swons sum
-                                          7 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 7 swons 8 swons 9 swons sum
-                                      7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [7] [0 <=] . infra first choice i 7 swons 8 swons 9 swons sum
-                                                                                                                             7 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum
-                                                                                                                           7 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] . swaack first choice i 7 swons 8 swons 9 swons sum
-                                         7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 7 swons 8 swons 9 swons sum
-                                           7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 7 swons 8 swons 9 swons sum
-                                                          7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 7 swons 8 swons 9 swons sum
-                                                                                                                             7 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum
-                                                                                                                           7 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum
-                                                                                                                             6 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum
-                                                                                                                           6 6 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum
-                                                                            6 6 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 7 swons 8 swons 9 swons sum
-                                                                                                                             6 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      6 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             6 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   6 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       6 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 6 swons 7 swons 8 swons 9 swons sum
-                                          6 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 6 swons 7 swons 8 swons 9 swons sum
-                                      6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [6] [0 <=] . infra first choice i 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             6 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           6 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] . swaack first choice i 6 swons 7 swons 8 swons 9 swons sum
-                                         6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 6 swons 7 swons 8 swons 9 swons sum
-                                           6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 6 swons 7 swons 8 swons 9 swons sum
-                                                          6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             6 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           6 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             5 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           5 5 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                            5 5 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             5 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      5 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             5 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   5 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       5 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          5 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                      5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [5] [0 <=] . infra first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             5 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           5 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] . swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                           5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                          5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             5 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           5 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             4 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           4 4 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                            4 4 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             4 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      4 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             4 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   4 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       4 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          4 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                      4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [4] [0 <=] . infra first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             4 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           4 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] . swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                           4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                          4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             4 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           4 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             3 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           3 3 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                            3 3 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             3 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      3 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             3 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   3 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       3 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          3 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                      3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [3] [0 <=] . infra first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             3 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           3 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] . swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                           3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                          3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             3 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           3 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             2 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           2 2 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                            2 2 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             2 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      2 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             2 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   2 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       2 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          2 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                      2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [2] [0 <=] . infra first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             2 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           2 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                           2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                          2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             2 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           2 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             1 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           1 1 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                            1 1 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             1 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      1 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             1 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   1 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       1 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          1 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                      1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [1] [0 <=] . infra first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             1 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           1 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                         1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                           1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                          1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             1 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           1 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             0 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           0 0 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                            0 0 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             0 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                      0 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                             0 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                   0 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                       0 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          0 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                      0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [0] [0 <=] . infra first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             0 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           0 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                          True . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          True [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] . swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                          0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                            0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] True . choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                    0 [pop []] . i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                             0 . pop [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                               . [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                            [] . 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                          [] 0 . swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                          [] 0 . swap cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                          0 [] . cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                           [0] . 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         [0] 1 . swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         [0] 1 . swap cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         1 [0] . cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                         [1 0] . 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                       [1 0] 2 . swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                       [1 0] 2 . swap cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                       2 [1 0] . cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                       [2 1 0] . 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                     [2 1 0] 3 . swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                     [2 1 0] 3 . swap cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                     3 [2 1 0] . cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                     [3 2 1 0] . 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                   [3 2 1 0] 4 . swons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                   [3 2 1 0] 4 . swap cons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                   4 [3 2 1 0] . cons 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                   [4 3 2 1 0] . 5 swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                 [4 3 2 1 0] 5 . swons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                 [4 3 2 1 0] 5 . swap cons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                 5 [4 3 2 1 0] . cons 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                                 [5 4 3 2 1 0] . 6 swons 7 swons 8 swons 9 swons sum
-                                                                                                               [5 4 3 2 1 0] 6 . swons 7 swons 8 swons 9 swons sum
-                                                                                                               [5 4 3 2 1 0] 6 . swap cons 7 swons 8 swons 9 swons sum
-                                                                                                               6 [5 4 3 2 1 0] . cons 7 swons 8 swons 9 swons sum
-                                                                                                               [6 5 4 3 2 1 0] . 7 swons 8 swons 9 swons sum
-                                                                                                             [6 5 4 3 2 1 0] 7 . swons 8 swons 9 swons sum
-                                                                                                             [6 5 4 3 2 1 0] 7 . swap cons 8 swons 9 swons sum
-                                                                                                             7 [6 5 4 3 2 1 0] . cons 8 swons 9 swons sum
-                                                                                                             [7 6 5 4 3 2 1 0] . 8 swons 9 swons sum
-                                                                                                           [7 6 5 4 3 2 1 0] 8 . swons 9 swons sum
-                                                                                                           [7 6 5 4 3 2 1 0] 8 . swap cons 9 swons sum
-                                                                                                           8 [7 6 5 4 3 2 1 0] . cons 9 swons sum
-                                                                                                           [8 7 6 5 4 3 2 1 0] . 9 swons sum
-                                                                                                         [8 7 6 5 4 3 2 1 0] 9 . swons sum
-                                                                                                         [8 7 6 5 4 3 2 1 0] 9 . swap cons sum
-                                                                                                         9 [8 7 6 5 4 3 2 1 0] . cons sum
-                                                                                                         [9 8 7 6 5 4 3 2 1 0] . sum
-                                                                                                         [9 8 7 6 5 4 3 2 1 0] . 0 [+] catamorphism
-                                                                                                       [9 8 7 6 5 4 3 2 1 0] 0 . [+] catamorphism
-                                                                                                   [9 8 7 6 5 4 3 2 1 0] 0 [+] . catamorphism
-                                                                                                   [9 8 7 6 5 4 3 2 1 0] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism
-                                                                                            [9 8 7 6 5 4 3 2 1 0] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism
-                                                                                            [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] . [uncons swap] swap hylomorphism
-                                                                              [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] [uncons swap] . swap hylomorphism
-                                                                              [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . hylomorphism
-                                                                              [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec
-                                                         [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec
-                                                                                                [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec
-                                                                                                [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec
-                                                                                             [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec
-                                                                                              [9 8 7 6 5 4 3 2 1 0] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec
-                                                                                        [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec
-                                                                                        [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec
-                                                                                        [9 8 7 6 5 4 3 2 1 0] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec
-                                                                                          [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec
-                                                                            [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec
-                                                                        [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec
-                                                                  [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec
-                                                                  [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec
-                                                                  [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec
-                                                                    [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec
-                        [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte
-[9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[9 8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i
-                                                                                                         [9 8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i
-                                                                                                      [9 8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i
-                       False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] . swaack first choice i
-                       [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i
-                         [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i
-                                       [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i
-                                                                                                         [9 8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +
-                                                                                                         9 [8 7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +
-                                                                                                         [8 7 6 5 4 3 2 1 0] 9 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +
-                                                           [8 7 6 5 4 3 2 1 0] 9 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip +
-                                                                                                           [8 7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 9 +
-                                                                                                    [8 7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 9 +
-                                                                                            [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 9 +
-                                                                              [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 9 +
-                                                                      [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 9 +
-                          [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 9 +
-    [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 9 +
-                                                                                                           [8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 +
-                                                                                                        [8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 +
-                         False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] . swaack first choice i 9 +
-                         [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 +
-                           [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 9 +
-                                         [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 9 +
-                                                                                                           [8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 +
-                                                                                                           8 [7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 +
-                                                                                                           [7 6 5 4 3 2 1 0] 8 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 +
-                                                             [7 6 5 4 3 2 1 0] 8 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 9 +
-                                                                                                             [7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 8 + 9 +
-                                                                                                      [7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 8 + 9 +
-                                                                                              [7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 8 + 9 +
-                                                                                [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 8 + 9 +
-                                                                        [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 8 + 9 +
-                            [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 8 + 9 +
-        [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 8 + 9 +
-                                                                                                             [7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 +
-                                                                                                          [7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 +
-                           False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] . swaack first choice i 8 + 9 +
-                           [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 +
-                             [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 +
-                                           [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 8 + 9 +
-                                                                                                             [7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 +
-                                                                                                             7 [6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 +
-                                                                                                             [6 5 4 3 2 1 0] 7 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 +
-                                                               [6 5 4 3 2 1 0] 7 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 8 + 9 +
-                                                                                                               [6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 +
-                                                                                                        [6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 +
-                                                                                                [6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 7 + 8 + 9 +
-                                                                                  [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 7 + 8 + 9 +
-                                                                          [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 7 + 8 + 9 +
-                              [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 7 + 8 + 9 +
-            [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[6 5 4 3 2 1 0]] [[] =] . infra first choice i 7 + 8 + 9 +
-                                                                                                               [6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 +
-                                                                                                            [6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 +
-                             False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] . swaack first choice i 7 + 8 + 9 +
-                             [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 +
-                               [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 +
-                                             [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 7 + 8 + 9 +
-                                                                                                               [6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 +
-                                                                                                               6 [5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 +
-                                                                                                               [5 4 3 2 1 0] 6 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 +
-                                                                 [5 4 3 2 1 0] 6 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 7 + 8 + 9 +
-                                                                                                                 [5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 +
-                                                                                                          [5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 +
-                                                                                                  [5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 +
-                                                                                    [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 6 + 7 + 8 + 9 +
-                                                                            [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 6 + 7 + 8 + 9 +
-                                [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 +
-                [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[5 4 3 2 1 0]] [[] =] . infra first choice i 6 + 7 + 8 + 9 +
-                                                                                                                 [5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 +
-                                                                                                              [5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 +
-                               False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] . swaack first choice i 6 + 7 + 8 + 9 +
-                               [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 +
-                                 [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 +
-                                               [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 +
-                                                                                                                 [5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                                                                                                 5 [4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                                                                                                 [4 3 2 1 0] 5 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                                                   [4 3 2 1 0] 5 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 6 + 7 + 8 + 9 +
-                                                                                                                   [4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                                                                            [4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                                                                    [4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                                                      [4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                                              [4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 5 + 6 + 7 + 8 + 9 +
-                                  [4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 +
-                    [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[4 3 2 1 0]] [[] =] . infra first choice i 5 + 6 + 7 + 8 + 9 +
-                                                                                                                   [4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 +
-                                                                                                                [4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 +
-                                 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] . swaack first choice i 5 + 6 + 7 + 8 + 9 +
-                                 [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 +
-                                   [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 +
-                                                 [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 +
-                                                                                                                   [4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                   4 [3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                   [3 2 1 0] 4 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                                                     [3 2 1 0] 4 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                     [3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                              [3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                      [3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                        [3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                [3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                    [3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 +
-                        [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3 2 1 0]] [[] =] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                     [3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                  [3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                   False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                   [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                     [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                   [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                     [3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                     3 [2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                     [2 1 0] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                       [2 1 0] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                       [2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                [2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                        [2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                          [2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                  [2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                      [2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                            [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 1 0]] [[] =] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                       [2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                    [2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                     False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                     [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                       [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                     [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                       [2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                       2 [1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                       [1 0] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                         [1 0] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         [1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                  [1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                          [1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                            [1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                    [1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                        [1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[1 0]] [[] =] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         [1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                      [1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                       False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                       [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                         [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                       [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         [1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         1 [0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         [0] 1 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                           [0] 1 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           [0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                    [0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                            [0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                              [0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                      [0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                          [0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                    [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[0]] [[] =] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           [0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                        [0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                         False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                         [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                           [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                         [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           [0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                          0 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                          [] 0 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                            [] 0 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                            [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                     [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                             [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                               [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                       [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                           [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                      [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[]] [[] =] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                            [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                         [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                          True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                           True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                           [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                             [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                    [] [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                            [] . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                               . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                             0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                             0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                             1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                             3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           3 3 . + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                             6 . 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                           6 4 . + 5 + 6 + 7 + 8 + 9 +
-                                                                                                                            10 . 5 + 6 + 7 + 8 + 9 +
-                                                                                                                          10 5 . + 6 + 7 + 8 + 9 +
-                                                                                                                            15 . 6 + 7 + 8 + 9 +
-                                                                                                                          15 6 . + 7 + 8 + 9 +
-                                                                                                                            21 . 7 + 8 + 9 +
-                                                                                                                          21 7 . + 8 + 9 +
-                                                                                                                            28 . 8 + 9 +
-                                                                                                                          28 8 . + 9 +
-                                                                                                                            36 . 9 +
-                                                                                                                          36 9 . +
-                                                                                                                            45 . 
-
-
-
- -
-
- -
-
-
-
In [12]:
-
-
-
V('10 range_sum')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                 . 10 range_sum
-                                                                              10 . range_sum
-                                                                              10 . [0 <=] 0 [1 - dup] [+] hylomorphism
-                                                                       10 [0 <=] . 0 [1 - dup] [+] hylomorphism
-                                                                     10 [0 <=] 0 . [1 - dup] [+] hylomorphism
-                                                           10 [0 <=] 0 [1 - dup] . [+] hylomorphism
-                                                       10 [0 <=] 0 [1 - dup] [+] . hylomorphism
-                                                       10 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec
-                                  10 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec
-                                                                     10 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                                     10 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                                  10 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                                   10 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                             10 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec
-                                                             10 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec
-                                                             10 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec
-                                                               10 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec
-                                                     10 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec
-                                                 10 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec
-                                           10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec
-                                           10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec
-                                           10 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec
-                                             10 [0 <=] [pop 0] [1 - dup] [dip +] . genrec
-     10 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte
-10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [10] [0 <=] . infra first choice i
-                                                                              10 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i
-                                                                            10 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i
-    False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] . swaack first choice i
-    10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i
-      10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i
-                    10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i
-                                                                              10 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                                                            10 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                                                               9 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                                                             9 9 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +
-                                   9 9 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip +
-                                                                               9 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 9 +
-                                                                        9 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 9 +
-                                                                9 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 9 +
-                                                      9 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 9 +
-                                              9 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 9 +
-      9 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 9 +
-  9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [9] [0 <=] . infra first choice i 9 +
-                                                                               9 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 +
-                                                                             9 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] . swaack first choice i 9 +
-     9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 +
-       9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 9 +
-                     9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 9 +
-                                                                               9 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +
-                                                                             9 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +
-                                                                               8 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +
-                                                                             8 8 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +
-                                   8 8 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 9 +
-                                                                               8 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 8 + 9 +
-                                                                        8 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 8 + 9 +
-                                                                8 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 8 + 9 +
-                                                      8 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 8 + 9 +
-                                              8 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 8 + 9 +
-      8 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 8 + 9 +
-  8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [8] [0 <=] . infra first choice i 8 + 9 +
-                                                                               8 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 +
-                                                                             8 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] . swaack first choice i 8 + 9 +
-     8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 +
-       8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 +
-                     8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 8 + 9 +
-                                                                               8 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +
-                                                                             8 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +
-                                                                               7 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +
-                                                                             7 7 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +
-                                   7 7 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 8 + 9 +
-                                                                               7 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 +
-                                                                        7 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 +
-                                                                7 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 7 + 8 + 9 +
-                                                      7 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 7 + 8 + 9 +
-                                              7 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 7 + 8 + 9 +
-      7 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 7 + 8 + 9 +
-  7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [7] [0 <=] . infra first choice i 7 + 8 + 9 +
-                                                                               7 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 +
-                                                                             7 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] . swaack first choice i 7 + 8 + 9 +
-     7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 +
-       7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 +
-                     7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 7 + 8 + 9 +
-                                                                               7 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +
-                                                                             7 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +
-                                                                               6 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +
-                                                                             6 6 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +
-                                   6 6 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 7 + 8 + 9 +
-                                                                               6 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 +
-                                                                        6 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 +
-                                                                6 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 +
-                                                      6 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 6 + 7 + 8 + 9 +
-                                              6 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 6 + 7 + 8 + 9 +
-      6 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 +
-  6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [6] [0 <=] . infra first choice i 6 + 7 + 8 + 9 +
-                                                                               6 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 +
-                                                                             6 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] . swaack first choice i 6 + 7 + 8 + 9 +
-     6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 +
-       6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 +
-                     6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 +
-                                                                               6 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                                                             6 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                                                               5 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                                                             5 5 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +
-                                   5 5 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 6 + 7 + 8 + 9 +
-                                                                               5 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                                        5 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                                5 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                                      5 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 5 + 6 + 7 + 8 + 9 +
-                                              5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 5 + 6 + 7 + 8 + 9 +
-      5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 +
-  5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i 5 + 6 + 7 + 8 + 9 +
-                                                                               5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 +
-                                                                             5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i 5 + 6 + 7 + 8 + 9 +
-     5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 +
-       5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 +
-                     5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 +
-                                                                               5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                                                             5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                                                               4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                                                             4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +
-                                   4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 +
-                                                                               4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                        4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                                      4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +
-                                              4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 +
-      4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 +
-  4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-     4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 +
-       4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 +
-                     4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                   3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                        3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                      3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                              3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-      3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-  3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-     3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-       3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                     3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                   2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                        2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                      2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                              2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-      2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-  2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-     2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-       2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                     2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                   1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                        1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                      1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                              1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-      1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-  1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                           False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-     False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-     1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-       1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                     1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                   0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                        0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                      0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                              0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-      0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-  0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                            True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-      True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-      0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-        0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                       0 [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               0 . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                                 . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             3 3 . + 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                               6 . 4 + 5 + 6 + 7 + 8 + 9 +
-                                                                             6 4 . + 5 + 6 + 7 + 8 + 9 +
-                                                                              10 . 5 + 6 + 7 + 8 + 9 +
-                                                                            10 5 . + 6 + 7 + 8 + 9 +
-                                                                              15 . 6 + 7 + 8 + 9 +
-                                                                            15 6 . + 7 + 8 + 9 +
-                                                                              21 . 7 + 8 + 9 +
-                                                                            21 7 . + 8 + 9 +
-                                                                              28 . 8 + 9 +
-                                                                            28 8 . + 9 +
-                                                                              36 . 9 +
-                                                                            36 9 . +
-                                                                              45 . 
-
-
-
- -
-
- -
-
-
-
-
-

Factorial Function and Paramorphisms

A paramorphism P :: B -> A is a recursion combinator that uses dup on intermediate values.

- -
n swap [P] [pop] [[F] dupdip G] primrec
-
-
-

With

-
    -
  • n :: A is the "identity" for F (like 1 for multiplication, 0 for addition)
    • -
  • F :: (A, B) -> A
    • -
  • G :: B -> B generates the next B value.
    • -
  • and lastly P :: B -> Bool detects the end of the series.
    • -
- -
-
-
-
-
-
-
-

For Factorial function (types A and B are both integer):

- -
n == 1
-F == *
-G == --
-P == 1 <=
- -
-
-
-
-
-
In [15]:
-
-
-
define('factorial == 1 swap [1 <=] [pop] [[*] dupdip --] primrec')
-
- -
-
-
- -
-
-
-
-
-

Try it with input 3 (omitting evaluation of predicate):

- -
3 1 swap [1 <=] [pop] [[*] dupdip --] primrec
-1 3      [1 <=] [pop] [[*] dupdip --] primrec
-
-1 3 [*] dupdip --
-1 3  * 3      --
-3      3      --
-3      2
-
-3 2 [*] dupdip --
-3 2  *  2      --
-6       2      --
-6       1
-
-6 1 [1 <=] [pop] [[*] dupdip --] primrec
-
-6 1 pop
-6
- -
-
-
-
-
-
In [16]:
-
-
-
J('3 factorial')
-
- -
-
-
- -
-
- - -
- -
- - -
-
6
-
-
-
- -
-
- -
-
-
-
-
-

Derive paramorphism from the form above.

-
n swap [P] [pop] [[F] dupdip G] primrec
-
-n swap [P]       [pop]     [[F] dupdip G]                  primrec
-n [P] [swap] dip [pop]     [[F] dupdip G]                  primrec
-n [P] [[F] dupdip G]                [[swap] dip [pop]] dip primrec
-n [P] [F] [dupdip G]           cons [[swap] dip [pop]] dip primrec
-n [P] [F] [G] [dupdip] swoncat cons [[swap] dip [pop]] dip primrec
-
-paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec
- -
-
-
-
-
-
In [17]:
-
-
-
define('paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec')
-define('factorial == 1 [1 <=] [*] [--] paramorphism')
-
- -
-
-
- -
-
-
-
In [18]:
-
-
-
J('3 factorial')
-
- -
-
-
- -
-
- - -
- -
- - -
-
6
-
-
-
- -
-
- -
-
-
-
-
-

tails

An example of a paramorphism for lists given in the "Bananas..." paper is tails which returns the list of "tails" of a list.

- -
[1 2 3] tails == [[] [3] [2 3]]
-
-
-

Using paramorphism we would write:

- -
n == []
-F == rest swons
-G == rest
-P == not
-
-tails == [] [not] [rest swons] [rest] paramorphism
- -
-
-
-
-
-
In [19]:
-
-
-
define('tails == [] [not] [rest swons] [rest] paramorphism')
-
- -
-
-
- -
-
-
-
In [20]:
-
-
-
J('[1 2 3] tails')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[[] [3] [2 3]]
-
-
-
- -
-
- -
-
-
-
In [21]:
-
-
-
J('25 range tails [popop] infra [sum] map')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276]
-
-
-
- -
-
- -
-
-
-
In [22]:
-
-
-
J('25 range [range_sum] map')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[276 253 231 210 190 171 153 136 120 105 91 78 66 55 45 36 28 21 15 10 6 3 1 0 0]
-
-
-
- -
-
- -
-
-
-
-
-

Factoring rest

Right before the recursion begins we have:

- -
[] [1 2 3] [not] [pop] [[rest swons] dupdip rest] primrec
-
-
-

But we might prefer to factor rest in the quote:

- -
[] [1 2 3] [not] [pop] [rest [swons] dupdip] primrec
-
-
-

There's no way to do that with the paramorphism combinator as defined. We would have to write and use a slightly different recursion combinator that accepted an additional "preprocessor" function [H] and built:

- -
n swap [P] [pop] [H [F] dupdip G] primrec
-
-
-

Or just write it out manually. This is yet another place where the sufficiently smart compiler will one day automatically refactor the code. We could write a paramorphism combinator that checked [F] and [G] for common prefix and extracted it.

- -
-
-
-
-
-
-
-

Patterns of Recursion

Our story so far...

-
    -
  • A combiner F :: (B, B) -> B
    • -
  • A predicate P :: A -> Bool to detect the base case
    • -
  • A base case value c :: B
    • -
-

Hylo-, Ana-, Cata-

-
w/ G :: A -> (A, B)
-
-H == [P   ] [pop c ] [G          ] [dip F    ] genrec
-A == [P   ] [pop []] [G          ] [dip swons] genrec
-C == [[] =] [pop c ] [uncons swap] [dip F    ] genrec
-
-
-

Para-, ?-, ?-

-
w/ G :: B -> B
-
-P == c  swap [P   ] [pop] [[F    ] dupdip G          ] primrec
-? == [] swap [P   ] [pop] [[swons] dupdip G          ] primrec
-? == c  swap [[] =] [pop] [[F    ] dupdip uncons swap] primrec
- -
-
-
-
-
-
-
-

Four Generalizations

There are at least four kinds of recursive combinator, depending on two choices. The first choice is whether the combiner function should be evaluated during the recursion or pushed into the pending expression to be "collapsed" at the end. The second choice is whether the combiner needs to operate on the current value of the datastructure or the generator's output.

- -
H ==        [P] [pop c] [G             ] [dip F] genrec
-H == c swap [P] [pop]   [G [F]    dip  ] [i]     genrec
-H ==        [P] [pop c] [  [G] dupdip  ] [dip F] genrec
-H == c swap [P] [pop]   [  [F] dupdip G] [i]     genrec
-
-
-

Consider:

- -
... a G [H] dip F                w/ a G == a' b
-... c a G [F] dip H                 a G == b  a'
-... a [G] dupdip [H] dip F          a G == a'
-... c a [F] dupdip G H              a G == a'
- -
-
-
-
-
-
-
-

1

-
H == [P] [pop c] [G] [dip F] genrec
-
-
-

Iterate n times.

- -
... a [P] [pop c] [G] [dip F] genrec
-... a  G [H] dip F
-... a' b [H] dip F
-... a' H b F
-... a'  G [H] dip F b F
-... a'' b [H] dip F b F
-... a'' H b F b F
-... a''  G [H] dip F b F b F
-... a''' b [H] dip F b F b F
-... a''' H b F b F b F
-... a''' pop c b F b F b F
-... c b F b F b F
-
-
-

This form builds up a continuation that contains the intermediate results along with the pending combiner functions. When the base case is reached the last term is replaced by the identity value c and the continuation "collapses" into the final result.

- -
-
-
-
-
-
-
-

2

When you can start with the identity value c on the stack and the combiner can operate as you go, using the intermediate results immediately rather than queuing them up, use this form. An important difference is that the generator function must return its results in the reverse order.

- -
H == c swap [P] [pop] [G [F] dip] primrec
-
-... c a G [F] dip H
-... c b a' [F] dip H
-... c b F a' H
-... c b F a' G [F] dip H
-... c b F b a'' [F] dip H
-... c b F b F a'' H
-... c b F b F a'' G [F] dip H
-... c b F b F b a''' [F] dip H
-... c b F b F b F a''' H
-... c b F b F b F a''' pop
-... c b F b F b F
-
-
-

The end line here is the same as for above, but only because we didn't evaluate F when it normally would have been.

- -
-
-
-
-
-
-
-

3

If the combiner and the generator both need to work on the current value then dup must be used at some point, and the generator must produce one item instead of two (the b is instead the duplicate of a.)

- -
H == [P] [pop c] [[G] dupdip] [dip F] genrec
-
-... a [G] dupdip [H] dip F
-... a  G a       [H] dip F
-... a'   a       [H] dip F
-... a' H a F
-... a' [G] dupdip [H] dip F a F
-... a'  G  a'     [H] dip F a F
-... a''    a'     [H] dip F a F
-... a'' H  a' F a F
-... a'' [G] dupdip [H] dip F a' F a F
-... a''  G  a''    [H] dip F a' F a F
-... a'''    a''    [H] dip F a' F a F
-... a''' H  a'' F a' F a F
-... a''' pop c  a'' F a' F a F
-...          c  a'' F a' F a F
- -
-
-
-
-
-
-
-

4

And, last but not least, if you can combine as you go, starting with c, and the combiner needs to work on the current item, this is the form:

- -
W == c swap [P] [pop] [[F] dupdip G] primrec
-
-... a c swap [P] [pop] [[F] dupdip G] primrec
-... c a [P] [pop] [[F] dupdip G] primrec
-... c a [F] dupdip G W
-... c a  F a G W
-... c a  F a'  W
-... c a  F a'  [F] dupdip G W
-... c a  F a'   F  a'     G W
-... c a  F a'   F  a''      W
-... c a  F a'   F  a''      [F] dupdip G W
-... c a  F a'   F  a''       F  a''    G W
-... c a  F a'   F  a''       F  a'''     W
-... c a  F a'   F  a''       F  a'''     pop
-... c a  F a'   F  a''       F
- -
-
-
-
-
-
-
-

Each of the four variations above can be specialized to ana- and catamorphic forms.

- -
-
-
-
-
-
In [23]:
-
-
-
def WTFmorphism(c, F, P, G):
-    '''Return a hylomorphism function H.'''
-
-    def H(a, d=c):
-        if P(a):
-            result = d
-        else:
-            a, b = G(a)
-            result = H(a, F(d, b))
-        return result
-
-    return H
-
- -
-
-
- -
-
-
-
In [24]:
-
-
-
F = lambda a, b: a + b
-P = lambda n: n <= 1
-G = lambda n: (n - 1, n - 1)
-
-wtf = WTFmorphism(0, F, P, G)
-
-print wtf(5)
-
- -
-
-
- -
-
- - -
- -
- - -
-
10
-
-
-
- -
-
- -
-
-
-
-
- -
H == [P   ] [pop c ] [G          ] [dip F    ] genrec
- -
-
-
-
-
-
In [25]:
-
-
-
DefinitionWrapper.add_definitions('''
-P == 1 <=
-Ga == -- dup
-Gb == --
-c == 0
-F == +
-''', D)
-
- -
-
-
- -
-
-
-
In [26]:
-
-
-
V('[1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                                             . [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec
-                                                                                                     [1 2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec
-                                                                                              [1 2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec
-                                                                                     [1 2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec
-                                                                       [1 2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec
-                                                           [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec
-          [1 2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte
-[1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[1 2 3]] [[] =] . infra first choice i
-                                                                                                     [1 2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i
-                                                                                                  [1 2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i
-                                                                                                       False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i
-         False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] . swaack first choice i
-         [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i
-           [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i
-                          [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i
-                                                                                                     [1 2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons
-                                                                                                     1 [2 3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons
-                                                                                                     [2 3] 1 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons
-                                                  [2 3] 1 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons
-                                                                                                       [2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 1 swons
-                                                                                                [2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 1 swons
-                                                                                       [2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 1 swons
-                                                                         [2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 1 swons
-                                                             [2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 1 swons
-            [2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 1 swons
-    [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[2 3]] [[] =] . infra first choice i 1 swons
-                                                                                                       [2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons
-                                                                                                    [2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons
-                                                                                                       False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons
-           False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] . swaack first choice i 1 swons
-           [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons
-             [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons
-                            [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 1 swons
-                                                                                                       [2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons
-                                                                                                       2 [3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons
-                                                                                                       [3] 2 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons
-                                                    [3] 2 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 1 swons
-                                                                                                         [3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons
-                                                                                                  [3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons
-                                                                                         [3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 2 swons 1 swons
-                                                                           [3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 2 swons 1 swons
-                                                               [3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 2 swons 1 swons
-              [3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 2 swons 1 swons
-        [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[3]] [[] =] . infra first choice i 2 swons 1 swons
-                                                                                                         [3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons
-                                                                                                      [3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons
-                                                                                                       False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons
-             False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] . swaack first choice i 2 swons 1 swons
-             [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 1 swons
-               [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 1 swons
-                              [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 2 swons 1 swons
-                                                                                                         [3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons
-                                                                                                        3 [] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons
-                                                                                                        [] 3 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons
-                                                     [] 3 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 2 swons 1 swons
-                                                                                                          [] . [[] =] [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons
-                                                                                                   [] [[] =] . [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons
-                                                                                          [] [[] =] [pop []] . [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons
-                                                                            [] [[] =] [pop []] [uncons swap] . [dip swons] genrec 3 swons 2 swons 1 swons
-                                                                [] [[] =] [pop []] [uncons swap] [dip swons] . genrec 3 swons 2 swons 1 swons
-               [] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 3 swons 2 swons 1 swons
-          [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[]] [[] =] . infra first choice i 3 swons 2 swons 1 swons
-                                                                                                          [] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons
-                                                                                                       [] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons
-                                                                                                        True . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons
-               True [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] . swaack first choice i 3 swons 2 swons 1 swons
-               [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 3 swons 2 swons 1 swons
-                 [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] True . choice i 3 swons 2 swons 1 swons
-                                                                                                 [] [pop []] . i 3 swons 2 swons 1 swons
-                                                                                                          [] . pop [] 3 swons 2 swons 1 swons
-                                                                                                             . [] 3 swons 2 swons 1 swons
-                                                                                                          [] . 3 swons 2 swons 1 swons
-                                                                                                        [] 3 . swons 2 swons 1 swons
-                                                                                                        [] 3 . swap cons 2 swons 1 swons
-                                                                                                        3 [] . cons 2 swons 1 swons
-                                                                                                         [3] . 2 swons 1 swons
-                                                                                                       [3] 2 . swons 1 swons
-                                                                                                       [3] 2 . swap cons 1 swons
-                                                                                                       2 [3] . cons 1 swons
-                                                                                                       [2 3] . 1 swons
-                                                                                                     [2 3] 1 . swons
-                                                                                                     [2 3] 1 . swap cons
-                                                                                                     1 [2 3] . cons
-                                                                                                     [1 2 3] . 
-
-
-
- -
-
- -
-
-
-
In [27]:
-
-
-
V('3 [P] [pop c] [Ga] [dip F] genrec')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                               . 3 [P] [pop c] [Ga] [dip F] genrec
-                                                             3 . [P] [pop c] [Ga] [dip F] genrec
-                                                         3 [P] . [pop c] [Ga] [dip F] genrec
-                                                 3 [P] [pop c] . [Ga] [dip F] genrec
-                                            3 [P] [pop c] [Ga] . [dip F] genrec
-                                    3 [P] [pop c] [Ga] [dip F] . genrec
-    3 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte
-3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [3] [P] . infra first choice i
-                                                             3 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i
-                                                             3 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i
-                                                           3 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i
-                                                         False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i
-False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] . swaack first choice i
-3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i
-  3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i
-                3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i
-                                                             3 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F
-                                                             3 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F
-                                                             2 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F
-                                                           2 2 . [[P] [pop c] [Ga] [dip F] genrec] dip F
-                         2 2 [[P] [pop c] [Ga] [dip F] genrec] . dip F
-                                                             2 . [P] [pop c] [Ga] [dip F] genrec 2 F
-                                                         2 [P] . [pop c] [Ga] [dip F] genrec 2 F
-                                                 2 [P] [pop c] . [Ga] [dip F] genrec 2 F
-                                            2 [P] [pop c] [Ga] . [dip F] genrec 2 F
-                                    2 [P] [pop c] [Ga] [dip F] . genrec 2 F
-    2 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 2 F
-2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [2] [P] . infra first choice i 2 F
-                                                             2 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F
-                                                             2 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F
-                                                           2 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F
-                                                         False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F
-False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] . swaack first choice i 2 F
-2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F
-  2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i 2 F
-                2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i 2 F
-                                                             2 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F
-                                                             2 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F
-                                                             1 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F
-                                                           1 1 . [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F
-                         1 1 [[P] [pop c] [Ga] [dip F] genrec] . dip F 2 F
-                                                             1 . [P] [pop c] [Ga] [dip F] genrec 1 F 2 F
-                                                         1 [P] . [pop c] [Ga] [dip F] genrec 1 F 2 F
-                                                 1 [P] [pop c] . [Ga] [dip F] genrec 1 F 2 F
-                                            1 [P] [pop c] [Ga] . [dip F] genrec 1 F 2 F
-                                    1 [P] [pop c] [Ga] [dip F] . genrec 1 F 2 F
-    1 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 1 F 2 F
-1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [1] [P] . infra first choice i 1 F 2 F
-                                                             1 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F
-                                                             1 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F
-                                                           1 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F
-                                                          True . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F
- True [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] . swaack first choice i 1 F 2 F
- 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F
-   1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F
-                                                     1 [pop c] . i 1 F 2 F
-                                                             1 . pop c 1 F 2 F
-                                                               . c 1 F 2 F
-                                                               . 0 1 F 2 F
-                                                             0 . 1 F 2 F
-                                                           0 1 . F 2 F
-                                                           0 1 . + 2 F
-                                                             1 . 2 F
-                                                           1 2 . F
-                                                           1 2 . +
-                                                             3 . 
-
-
-
- -
-
- -
-
-
-
In [28]:
-
-
-
V('3 [P] [pop []] [Ga] [dip swons] genrec')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                         . 3 [P] [pop []] [Ga] [dip swons] genrec
-                                                                       3 . [P] [pop []] [Ga] [dip swons] genrec
-                                                                   3 [P] . [pop []] [Ga] [dip swons] genrec
-                                                          3 [P] [pop []] . [Ga] [dip swons] genrec
-                                                     3 [P] [pop []] [Ga] . [dip swons] genrec
-                                         3 [P] [pop []] [Ga] [dip swons] . genrec
-    3 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte
-3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [3] [P] . infra first choice i
-                                                                       3 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i
-                                                                       3 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i
-                                                                     3 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i
-                                                                   False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i
-False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] . swaack first choice i
-3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i
-  3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i
-                 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i
-                                                                       3 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons
-                                                                       3 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons
-                                                                       2 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons
-                                                                     2 2 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons
-                              2 2 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons
-                                                                       2 . [P] [pop []] [Ga] [dip swons] genrec 2 swons
-                                                                   2 [P] . [pop []] [Ga] [dip swons] genrec 2 swons
-                                                          2 [P] [pop []] . [Ga] [dip swons] genrec 2 swons
-                                                     2 [P] [pop []] [Ga] . [dip swons] genrec 2 swons
-                                         2 [P] [pop []] [Ga] [dip swons] . genrec 2 swons
-    2 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 2 swons
-2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [2] [P] . infra first choice i 2 swons
-                                                                       2 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons
-                                                                       2 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons
-                                                                     2 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons
-                                                                   False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons
-False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons
-2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons
-  2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons
-                 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i 2 swons
-                                                                       2 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons
-                                                                       2 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons
-                                                                       1 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons
-                                                                     1 1 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons
-                              1 1 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons 2 swons
-                                                                       1 . [P] [pop []] [Ga] [dip swons] genrec 1 swons 2 swons
-                                                                   1 [P] . [pop []] [Ga] [dip swons] genrec 1 swons 2 swons
-                                                          1 [P] [pop []] . [Ga] [dip swons] genrec 1 swons 2 swons
-                                                     1 [P] [pop []] [Ga] . [dip swons] genrec 1 swons 2 swons
-                                         1 [P] [pop []] [Ga] [dip swons] . genrec 1 swons 2 swons
-    1 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons
-1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [1] [P] . infra first choice i 1 swons 2 swons
-                                                                       1 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons
-                                                                       1 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons
-                                                                     1 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons
-                                                                    True . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons
- True [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons
- 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 1 swons 2 swons
-   1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] True . choice i 1 swons 2 swons
-                                                              1 [pop []] . i 1 swons 2 swons
-                                                                       1 . pop [] 1 swons 2 swons
-                                                                         . [] 1 swons 2 swons
-                                                                      [] . 1 swons 2 swons
-                                                                    [] 1 . swons 2 swons
-                                                                    [] 1 . swap cons 2 swons
-                                                                    1 [] . cons 2 swons
-                                                                     [1] . 2 swons
-                                                                   [1] 2 . swons
-                                                                   [1] 2 . swap cons
-                                                                   2 [1] . cons
-                                                                   [2 1] . 
-
-
-
- -
-
- -
-
-
-
In [29]:
-
-
-
V('[2 1] [[] =] [pop c ] [uncons swap] [dip F] genrec')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                               . [2 1] [[] =] [pop c] [uncons swap] [dip F] genrec
-                                                                                         [2 1] . [[] =] [pop c] [uncons swap] [dip F] genrec
-                                                                                  [2 1] [[] =] . [pop c] [uncons swap] [dip F] genrec
-                                                                          [2 1] [[] =] [pop c] . [uncons swap] [dip F] genrec
-                                                            [2 1] [[] =] [pop c] [uncons swap] . [dip F] genrec
-                                                    [2 1] [[] =] [pop c] [uncons swap] [dip F] . genrec
-        [2 1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte
-[2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[2 1]] [[] =] . infra first choice i
-                                                                                         [2 1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i
-                                                                                      [2 1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i
-                                                                                         False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i
-       False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] . swaack first choice i
-       [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i
-         [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i
-                       [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i
-                                                                                         [2 1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F
-                                                                                         2 [1] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F
-                                                                                         [1] 2 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F
-                                           [1] 2 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F
-                                                                                           [1] . [[] =] [pop c] [uncons swap] [dip F] genrec 2 F
-                                                                                    [1] [[] =] . [pop c] [uncons swap] [dip F] genrec 2 F
-                                                                            [1] [[] =] [pop c] . [uncons swap] [dip F] genrec 2 F
-                                                              [1] [[] =] [pop c] [uncons swap] . [dip F] genrec 2 F
-                                                      [1] [[] =] [pop c] [uncons swap] [dip F] . genrec 2 F
-          [1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 2 F
-    [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[1]] [[] =] . infra first choice i 2 F
-                                                                                           [1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F
-                                                                                        [1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F
-                                                                                         False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F
-         False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] . swaack first choice i 2 F
-         [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F
-           [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i 2 F
-                         [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i 2 F
-                                                                                           [1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F
-                                                                                          1 [] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F
-                                                                                          [] 1 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F
-                                            [] 1 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F 2 F
-                                                                                            [] . [[] =] [pop c] [uncons swap] [dip F] genrec 1 F 2 F
-                                                                                     [] [[] =] . [pop c] [uncons swap] [dip F] genrec 1 F 2 F
-                                                                             [] [[] =] [pop c] . [uncons swap] [dip F] genrec 1 F 2 F
-                                                               [] [[] =] [pop c] [uncons swap] . [dip F] genrec 1 F 2 F
-                                                       [] [[] =] [pop c] [uncons swap] [dip F] . genrec 1 F 2 F
-           [] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 1 F 2 F
-      [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[]] [[] =] . infra first choice i 1 F 2 F
-                                                                                            [] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F
-                                                                                         [] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F
-                                                                                          True . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F
-           True [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] . swaack first choice i 1 F 2 F
-           [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F
-             [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F
-                                                                                    [] [pop c] . i 1 F 2 F
-                                                                                            [] . pop c 1 F 2 F
-                                                                                               . c 1 F 2 F
-                                                                                               . 0 1 F 2 F
-                                                                                             0 . 1 F 2 F
-                                                                                           0 1 . F 2 F
-                                                                                           0 1 . + 2 F
-                                                                                             1 . 2 F
-                                                                                           1 2 . F
-                                                                                           1 2 . +
-                                                                                             3 . 
-
-
-
- -
-
- -
-
-
-
-
-

Appendix - Fun with Symbols

-
|[ (c, F), (G, P) ]| == (|c, F|) • [(G, P)]
-
-
-

"Bananas, Lenses, & Barbed Wire"

- -
(|...|)  [(...)]  [<...>]
-
-
-

I think they are having slightly too much fun with the symbols.

-

"Too much is always better than not enough."

- -
-
-
-
-
-
-
-

Tree with node and list of trees.

-
tree = [] | [node [tree*]]
- -
-
-
-
-
-
-
-

treestep

-
tree z [C] [N] treestep
-
-
-   [] z [C] [N] treestep
----------------------------
-      z
-
-
-   [node [tree*]] z [C] [N] treestep
---------------------------------------- w/ K == z [C] [N] treestep
-       node N [tree*] [K] map C
- -
-
-
-
-
-
-
-

Derive the recursive form.

-
K == [not] [pop z] [J] ifte
-
-
-       [node [tree*]] J
-------------------------------
-   node N [tree*] [K] map C
-
-
-J == .. [N] .. [K] .. [C] ..
-
-[node [tree*]] uncons [N] dip
-node [[tree*]]        [N] dip
-node N [[tree*]]
-
-node N [[tree*]] i [K] map
-node N  [tree*]    [K] map
-node N  [K.tree*]
-
-J == uncons [N] dip i [K] map [C] i
-
-K == [not] [pop z] [uncons [N] dip i [K] map [C] i] ifte
-K == [not] [pop z] [uncons [N] dip i]   [map [C] i] genrec
- -
-
-
-
-
-
-
-

Extract the givens to parameterize the program.

-
[not] [pop z]                   [uncons [N] dip unquote] [map [C] i] genrec
-[not] [z]         [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec
-[not]  z     unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec
-z [not] swap unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec
-  \............TS0............/
-z TS0 [uncons [N] dip unquote]                      [map [C] i] genrec
-z [uncons [N] dip unquote]                [TS0] dip [map [C] i] genrec
-z [[N] dip unquote]      [uncons] swoncat [TS0] dip [map [C] i] genrec
-z [N] [dip unquote] cons [uncons] swoncat [TS0] dip [map [C] i] genrec
-      \...........TS1.................../
-z [N] TS1 [TS0] dip [map [C] i]                       genrec
-z [N]               [map [C] i]            [TS1 [TS0] dip] dip      genrec
-z [N]               [map  C   ]            [TS1 [TS0] dip] dip      genrec
-z [N]                    [C] [map] swoncat [TS1 [TS0] dip] dip genrec
-z [C] [N] swap               [map] swoncat [TS1 [TS0] dip] dip genrec
- -
-
-
-
-
-
-
- -
     TS0 == [not] swap unit [pop] swoncat
-     TS1 == [dip i] cons [uncons] swoncat
-treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec
- -
-
-
-
-
-
-
- -
   [] 0 [C] [N] treestep
----------------------------
-      0
-
-
-      [n [tree*]] 0 [sum +] [] treestep
-   --------------------------------------------------
-       n [tree*] [0 [sum +] [] treestep] map sum +
- -
-
-
-
-
-
In [40]:
-
-
-
DefinitionWrapper.add_definitions('''
-
-     TS0 == [not] swap unit [pop] swoncat
-     TS1 == [dip i] cons [uncons] swoncat
-treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec
-
-''', D)
-
- -
-
-
- -
-
-
-
In [31]:
-
-
-
V('[] 0 [sum +] [] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                                       . [] 0 [sum +] [] treestep
-                                                                                                    [] . 0 [sum +] [] treestep
-                                                                                                  [] 0 . [sum +] [] treestep
-                                                                                          [] 0 [sum +] . [] treestep
-                                                                                       [] 0 [sum +] [] . treestep
-                                                                                       [] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec
-                                                                                       [] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec
-                                                                                 [] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec
-                                                                                 [] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec
-                                                                                 [] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec
-                                                                                   [] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec
-                                                                   [] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec
-                                                                                               [] 0 [] . TS1 [TS0] dip [map sum +] genrec
-                                                                                               [] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                       [] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                       [] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                              [] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec
-                                                                              [] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec
-                                                                              [] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec
-                                                                                [] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec
-                                                                          [] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec
-                                                                                                  [] 0 . TS0 [uncons [] dip i] [map sum +] genrec
-                                                                                                  [] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                            [] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                            [] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                            [] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                         [] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                          [] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                    [] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                    [] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec
-                                                                                    [] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec
-                                                                                      [] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec
-                                                                    [] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec
-                                                        [] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec
-     [] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte
-[] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[]] [not] . infra first choice i
-                                                                                                    [] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i
-                                                                                                  True . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i
-    True [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] . swaack first choice i
-    [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [True] . first choice i
-      [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] True . choice i
-                                                                                            [] [pop 0] . i
-                                                                                                    [] . pop 0
-                                                                                                       . 0
-                                                                                                     0 . 
-
-
-
- -
-
- -
-
-
-
In [32]:
-
-
-
V('[23 []] 0 [sum +] [] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                                                 . [23 []] 0 [sum +] [] treestep
-                                                                                                         [23 []] . 0 [sum +] [] treestep
-                                                                                                       [23 []] 0 . [sum +] [] treestep
-                                                                                               [23 []] 0 [sum +] . [] treestep
-                                                                                            [23 []] 0 [sum +] [] . treestep
-                                                                                            [23 []] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec
-                                                                                            [23 []] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec
-                                                                                      [23 []] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec
-                                                                                      [23 []] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec
-                                                                                      [23 []] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec
-                                                                                        [23 []] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec
-                                                                        [23 []] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec
-                                                                                                    [23 []] 0 [] . TS1 [TS0] dip [map sum +] genrec
-                                                                                                    [23 []] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                            [23 []] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                            [23 []] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                   [23 []] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec
-                                                                                   [23 []] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec
-                                                                                   [23 []] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec
-                                                                                     [23 []] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec
-                                                                               [23 []] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec
-                                                                                                       [23 []] 0 . TS0 [uncons [] dip i] [map sum +] genrec
-                                                                                                       [23 []] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                 [23 []] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                 [23 []] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                 [23 []] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                              [23 []] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                               [23 []] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                         [23 []] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                         [23 []] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec
-                                                                                         [23 []] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec
-                                                                                           [23 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec
-                                                                         [23 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec
-                                                             [23 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec
-          [23 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte
-[23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 []]] [not] . infra first choice i
-                                                                                                         [23 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i
-                                                                                                           False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i
-        False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] . swaack first choice i
-        [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i
-          [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i
-                        [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i
-                                                                                                         [23 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                         23 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                      23 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                              23 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                         23 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                              23 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                           23 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                      23 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum +
-                                                                                                           23 [] . sum +
-                                                                                                           23 [] . 0 [+] catamorphism +
-                                                                                                         23 [] 0 . [+] catamorphism +
-                                                                                                     23 [] 0 [+] . catamorphism +
-                                                                                                     23 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism +
-                                                                                              23 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism +
-                                                                                              23 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism +
-                                                                                23 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism +
-                                                                                23 [] [[] =] 0 [uncons swap] [+] . hylomorphism +
-                                                                                23 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec +
-                                                           23 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec +
-                                                                                                  23 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                  23 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                               23 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                23 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                          23 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                          23 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                          23 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                            23 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec +
-                                                                              23 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec +
-                                                                          23 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec +
-                                                                    23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec +
-                                                                    23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec +
-                                                                    23 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec +
-                                                                      23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec +
-                          23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte +
-                  23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i +
-                                                                                                           23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i +
-                                                                                                        23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i +
-                                                                                                         23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i +
-                       23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i +
-                       23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i +
-                            23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i +
-                                                                                                   23 [] [pop 0] . i +
-                                                                                                           23 [] . pop 0 +
-                                                                                                              23 . 0 +
-                                                                                                            23 0 . +
-                                                                                                              23 . 
-
-
-
- -
-
- -
-
-
-
In [33]:
-
-
-
V('[23 [[2 []] [3 []]]] 0 [sum +] [] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
                                                                                                                                                                  . [23 [[2 []] [3 []]]] 0 [sum +] [] treestep
-                                                                                                                                             [23 [[2 []] [3 []]]] . 0 [sum +] [] treestep
-                                                                                                                                           [23 [[2 []] [3 []]]] 0 . [sum +] [] treestep
-                                                                                                                                   [23 [[2 []] [3 []]]] 0 [sum +] . [] treestep
-                                                                                                                                [23 [[2 []] [3 []]]] 0 [sum +] [] . treestep
-                                                                                                                                [23 [[2 []] [3 []]]] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec
-                                                                                                                                [23 [[2 []] [3 []]]] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec
-                                                                                                                          [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec
-                                                                                                                          [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec
-                                                                                                                          [23 [[2 []] [3 []]]] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec
-                                                                                                                            [23 [[2 []] [3 []]]] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec
-                                                                                                            [23 [[2 []] [3 []]]] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec
-                                                                                                                                        [23 [[2 []] [3 []]]] 0 [] . TS1 [TS0] dip [map sum +] genrec
-                                                                                                                                        [23 [[2 []] [3 []]]] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                                                                [23 [[2 []] [3 []]]] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                                                                [23 [[2 []] [3 []]]] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec
-                                                                                                                       [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec
-                                                                                                                       [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec
-                                                                                                                       [23 [[2 []] [3 []]]] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec
-                                                                                                                         [23 [[2 []] [3 []]]] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec
-                                                                                                                   [23 [[2 []] [3 []]]] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec
-                                                                                                                                           [23 [[2 []] [3 []]]] 0 . TS0 [uncons [] dip i] [map sum +] genrec
-                                                                                                                                           [23 [[2 []] [3 []]]] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                                     [23 [[2 []] [3 []]]] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                                     [23 [[2 []] [3 []]]] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                                     [23 [[2 []] [3 []]]] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                                  [23 [[2 []] [3 []]]] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                                   [23 [[2 []] [3 []]]] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                             [23 [[2 []] [3 []]]] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec
-                                                                                                                             [23 [[2 []] [3 []]]] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec
-                                                                                                                             [23 [[2 []] [3 []]]] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec
-                                                                                                                               [23 [[2 []] [3 []]]] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec
-                                                                                                             [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec
-                                                                                                 [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec
-                                              [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte
-                       [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 [[2 []] [3 []]]]] [not] . infra first choice i
-                                                                                                                                             [23 [[2 []] [3 []]]] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i
-                                                                                                                                                            False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i
-                                            False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] . swaack first choice i
-                                            [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i
-                                              [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i
-                                                            [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i
-                                                                                                                                             [23 [[2 []] [3 []]]] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                                                             23 [[[2 []] [3 []]]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                                                          23 [[[2 []] [3 []]]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                                                                               23 . [[[2 []] [3 []]]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                                                             23 [[[2 []] [3 []]]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                                                                               23 . [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                                                                               23 [[2 []] [3 []]] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +
-                                                                                          23 [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum +
-23 [] [[[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first] . infra sum +
-                                                                                                                                                                  . [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                      [[3 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                 [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 [3 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                  23 [3 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                          23 [3 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                        23 [3 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                            23 [3 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                         23 [3 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                             23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[3 []] 23] [not] . infra first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 [3 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                         23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                    23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] . swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                    23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                         23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                       23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 [3 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 3 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                     23 3 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                             23 3 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 3 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                             23 3 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                          23 3 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                     23 3 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                          23 3 [] . sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                          23 3 [] . 0 [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 3 [] 0 . [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                    23 3 [] 0 [+] . catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                    23 3 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                             23 3 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                             23 3 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                               23 3 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                               23 3 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                               23 3 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                          23 3 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                 23 3 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                 23 3 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                              23 3 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                               23 3 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                         23 3 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                         23 3 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                         23 3 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                           23 3 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                             23 3 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                         23 3 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                   23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                   23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                   23 3 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                     23 3 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                         23 3 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                               23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 3 23] [[] =] . infra first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                          23 3 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                       23 3 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                        23 3 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                    23 3 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] . swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                    23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 3 23] . first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                           23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                  23 3 [] [pop 0] . i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                          23 3 [] . pop 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                             23 3 . 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                           23 3 0 . + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                             23 3 . [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                          23 3 [] . swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                           [3 23] . first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                                3 . [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                                                                                    3 [[2 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +
-                                                                                               3 [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [23] swaack sum +
-                                                                                                                                                        23 [2 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum +
-                                                                                                                                                  23 [2 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum +
-                                                                                                                                          23 [2 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum +
-                                                                                                                        23 [2 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [3] swaack first [23] swaack sum +
-                                                                                                            23 [2 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [3] swaack first [23] swaack sum +
-                                                         23 [2 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [3] swaack first [23] swaack sum +
-                                             23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[2 []] 23] [not] . infra first choice i [3] swaack first [23] swaack sum +
-                                                                                                                                                        23 [2 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum +
-                                                                                                                                                         23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum +
-                                                    23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] . swaack first choice i [3] swaack first [23] swaack sum +
-                                                    23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [3] swaack first [23] swaack sum +
-                                                         23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [3] swaack first [23] swaack sum +
-                                                                       23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [3] swaack first [23] swaack sum +
-                                                                                                                                                        23 [2 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                        23 2 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                     23 2 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                             23 2 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                        23 2 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                             23 2 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                          23 2 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +
-                                                                                                     23 2 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                          23 2 [] . sum + [3] swaack first [23] swaack sum +
-                                                                                                                                                          23 2 [] . 0 [+] catamorphism + [3] swaack first [23] swaack sum +
-                                                                                                                                                        23 2 [] 0 . [+] catamorphism + [3] swaack first [23] swaack sum +
-                                                                                                                                                    23 2 [] 0 [+] . catamorphism + [3] swaack first [23] swaack sum +
-                                                                                                                                                    23 2 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum +
-                                                                                                                                             23 2 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum +
-                                                                                                                                             23 2 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum +
-                                                                                                                               23 2 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [3] swaack first [23] swaack sum +
-                                                                                                                               23 2 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [3] swaack first [23] swaack sum +
-                                                                                                                               23 2 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                          23 2 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                                 23 2 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                                 23 2 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                              23 2 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                               23 2 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                         23 2 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                         23 2 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                         23 2 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                                           23 2 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                             23 2 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                         23 2 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                   23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                   23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                   23 2 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [3] swaack first [23] swaack sum +
-                                                                                                                     23 2 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [3] swaack first [23] swaack sum +
-                                                                         23 2 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [3] swaack first [23] swaack sum +
-                                                               23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 2 23] [[] =] . infra first choice i + [3] swaack first [23] swaack sum +
-                                                                                                                                                          23 2 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum +
-                                                                                                                                                       23 2 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum +
-                                                                                                                                                        23 2 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum +
-                                                                    23 2 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] . swaack first choice i + [3] swaack first [23] swaack sum +
-                                                                    23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 2 23] . first choice i + [3] swaack first [23] swaack sum +
-                                                                           23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [3] swaack first [23] swaack sum +
-                                                                                                                                                  23 2 [] [pop 0] . i + [3] swaack first [23] swaack sum +
-                                                                                                                                                          23 2 [] . pop 0 + [3] swaack first [23] swaack sum +
-                                                                                                                                                             23 2 . 0 + [3] swaack first [23] swaack sum +
-                                                                                                                                                           23 2 0 . + [3] swaack first [23] swaack sum +
-                                                                                                                                                             23 2 . [3] swaack first [23] swaack sum +
-                                                                                                                                                         23 2 [3] . swaack first [23] swaack sum +
-                                                                                                                                                         3 [2 23] . first [23] swaack sum +
-                                                                                                                                                              3 2 . [23] swaack sum +
-                                                                                                                                                         3 2 [23] . swaack sum +
-                                                                                                                                                         23 [2 3] . sum +
-                                                                                                                                                         23 [2 3] . 0 [+] catamorphism +
-                                                                                                                                                       23 [2 3] 0 . [+] catamorphism +
-                                                                                                                                                   23 [2 3] 0 [+] . catamorphism +
-                                                                                                                                                   23 [2 3] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism +
-                                                                                                                                            23 [2 3] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism +
-                                                                                                                                            23 [2 3] [[] =] 0 [+] . [uncons swap] swap hylomorphism +
-                                                                                                                              23 [2 3] [[] =] 0 [+] [uncons swap] . swap hylomorphism +
-                                                                                                                              23 [2 3] [[] =] 0 [uncons swap] [+] . hylomorphism +
-                                                                                                                              23 [2 3] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec +
-                                                                                                         23 [2 3] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec +
-                                                                                                                                                23 [2 3] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                                23 [2 3] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                             23 [2 3] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                              23 [2 3] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                        23 [2 3] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                        23 [2 3] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                        23 [2 3] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                                          23 [2 3] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec +
-                                                                                                                            23 [2 3] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec +
-                                                                                                                        23 [2 3] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec +
-                                                                                                                  23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec +
-                                                                                                                  23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec +
-                                                                                                                  23 [2 3] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec +
-                                                                                                                    23 [2 3] [[] =] [pop 0] [uncons swap] [dip +] . genrec +
-                                                                        23 [2 3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte +
-                                                             23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 3] 23] [[] =] . infra first choice i +
-                                                                                                                                                         23 [2 3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i +
-                                                                                                                                                      23 [2 3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i +
-                                                                                                                                                         23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i +
-                                                                    23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] . swaack first choice i +
-                                                                    23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i +
-                                                                         23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i +
-                                                                                       23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i +
-                                                                                                                                                         23 [2 3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + +
-                                                                                                                                                         23 2 [3] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + +
-                                                                                                                                                         23 [3] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + +
-                                                                                                           23 [3] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + +
-                                                                                                                                                           23 [3] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + +
-                                                                                                                                                    23 [3] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + +
-                                                                                                                                            23 [3] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + +
-                                                                                                                              23 [3] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + +
-                                                                                                                      23 [3] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + +
-                                                                          23 [3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + +
-                                                                 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3] 23] [[] =] . infra first choice i 2 + +
-                                                                                                                                                           23 [3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + +
-                                                                                                                                                        23 [3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + +
-                                                                                                                                                         23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + +
-                                                                      23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] . swaack first choice i 2 + +
-                                                                      23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i 2 + +
-                                                                           23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + +
-                                                                                         23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + +
-                                                                                                                                                           23 [3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + +
-                                                                                                                                                          23 3 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + +
-                                                                                                                                                          23 [] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + +
-                                                                                                            23 [] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + +
-                                                                                                                                                            23 [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 2 + +
-                                                                                                                                                     23 [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 2 + +
-                                                                                                                                             23 [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 2 + +
-                                                                                                                               23 [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 2 + +
-                                                                                                                       23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 2 + +
-                                                                           23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 2 + +
-                                                                   23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i 3 + 2 + +
-                                                                                                                                                            23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + +
-                                                                                                                                                         23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + +
-                                                                                                                                                          23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + +
-                                                                        23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i 3 + 2 + +
-                                                                        23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i 3 + 2 + +
-                                                                             23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 3 + 2 + +
-                                                                                                                                                    23 [] [pop 0] . i 3 + 2 + +
-                                                                                                                                                            23 [] . pop 0 3 + 2 + +
-                                                                                                                                                               23 . 0 3 + 2 + +
-                                                                                                                                                             23 0 . 3 + 2 + +
-                                                                                                                                                           23 0 3 . + 2 + +
-                                                                                                                                                             23 3 . 2 + +
-                                                                                                                                                           23 3 2 . + +
-                                                                                                                                                             23 5 . +
-                                                                                                                                                               28 . 
-
-
-
- -
-
- -
-
-
-
In [34]:
-
-
-
J('[23 [[2 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]] [3 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]]]] 0 [sum +] [] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
140
-
-
-
- -
-
- -
-
-
-
In [35]:
-
-
-
J('[] [] [unit cons] [23 +] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[]
-
-
-
- -
-
- -
-
-
-
In [36]:
-
-
-
J('[23 []] [] [unit cons] [23 +] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[46 []]
-
-
-
- -
-
- -
-
-
-
In [37]:
-
-
-
J('[23 [[2 []] [3 []]]] [] [unit cons] [23 +] treestep')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[46 [[25 []] [26 []]]]
-
-
-
- -
-
- -
-
-
-
In [38]:
-
-
-
define('treemap == [] [unit cons] roll< treestep')
-
- -
-
-
- -
-
-
-
In [39]:
-
-
-
J('[23 [[2 []] [3 []]]] [23 +] treemap')
-
- -
-
-
- -
-
- - -
- -
- - -
-
[46 [[25 []] [26 []]]]
-
-
-
- -
-
- -
-
-
- - - - - - diff --git a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.ipynb b/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.ipynb deleted file mode 100644 index fde17ad..0000000 --- a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.ipynb +++ /dev/null @@ -1,2987 +0,0 @@ -{ - "cells": [ - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Cf. [\"Bananas, Lenses, & Barbed Wire\"](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# [Hylomorphism](https://en.wikipedia.org/wiki/Hylomorphism_%28computer_science%29)\n", - "A [hylomorphism](https://en.wikipedia.org/wiki/Hylomorphism_%28computer_science%29) `H :: A -> B` converts a value of type A into a value of type B by means of:\n", - "\n", - "- A generator `G :: A -> (A, B)`\n", - "- A combiner `F :: (B, B) -> B`\n", - "- A predicate `P :: A -> Bool` to detect the base case\n", - "- A base case value `c :: B`\n", - "- Recursive calls (zero or more); it has a \"call stack in the form of a cons list\".\n", - "\n", - "It may be helpful to see this function implemented in imperative Python code." - ] - }, - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "def hylomorphism(c, F, P, G):\n", - " '''Return a hylomorphism function H.'''\n", - "\n", - " def H(a):\n", - " if P(a):\n", - " result = c\n", - " else:\n", - " b, aa = G(a)\n", - " result = F(b, H(aa))\n", - " return result\n", - "\n", - " return H" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Finding [Triangular Numbers](https://en.wikipedia.org/wiki/Triangular_number)\n", - "As a concrete example let's use a function that, given a positive integer, returns the sum of all positive integers less than that one. (In this case the types A and B are both `int`.)\n", - "### With `range()` and `sum()`" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]" - ] - }, - "execution_count": 2, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "r = range(10)\n", - "r" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "45" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "sum(r)" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "45" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "range_sum = lambda n: sum(range(n))\n", - "range_sum(10)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### As a hylomorphism" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [], - "source": [ - "G = lambda n: (n - 1, n - 1)\n", - "F = lambda a, b: a + b\n", - "P = lambda n: n <= 1\n", - "\n", - "H = hylomorphism(0, F, P, G)" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "45" - ] - }, - "execution_count": 6, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "H(10)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "If you were to run the above code in a debugger and check out the call stack you would find that the variable `b` in each call to `H()` is storing the intermediate values as `H()` recurses. This is what was meant by \"call stack in the form of a cons list\"." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Joy Preamble" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [], - "source": [ - "from notebook_preamble import D, DefinitionWrapper, J, V, define" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Hylomorphism in Joy\n", - "We can define a combinator `hylomorphism` that will make a hylomorphism combinator `H` from constituent parts.\n", - "\n", - " H == c [F] [P] [G] hylomorphism\n", - "\n", - "The function `H` is recursive, so we start with `ifte` and set the else-part to\n", - "some function `J` that will contain a quoted copy of `H`. (The then-part just\n", - "discards the leftover `a` and replaces it with the base case value `c`.)\n", - "\n", - " H == [P] [pop c] [J] ifte\n", - "\n", - "The else-part `J` gets just the argument `a` on the stack.\n", - "\n", - " a J\n", - " a G The first thing to do is use the generator G\n", - " aa b which produces b and a new aa\n", - " aa b [H] dip we recur with H on the new aa\n", - " aa H b F and run F on the result.\n", - "\n", - "This gives us a definition for `J`.\n", - "\n", - " J == G [H] dip F\n", - "\n", - "Plug it in and convert to genrec.\n", - "\n", - " H == [P] [pop c] [G [H] dip F] ifte\n", - " H == [P] [pop c] [G] [dip F] genrec\n", - "\n", - "This is the form of a hylomorphism in Joy, which nicely illustrates that\n", - "it is a simple specialization of the general recursion combinator.\n", - "\n", - " H == [P] [pop c] [G] [dip F] genrec" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Derivation of `hylomorphism`\n", - "\n", - "Now we just need to derive a definition that builds the `genrec` arguments\n", - "out of the pieces given to the `hylomorphism` combinator.\n", - "\n", - " H == [P] [pop c] [G] [dip F] genrec\n", - " [P] [c] [pop] swoncat [G] [F] [dip] swoncat genrec\n", - " [P] c unit [pop] swoncat [G] [F] [dip] swoncat genrec\n", - " [P] c [G] [F] [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - "\n", - "Working in reverse:\n", - "- Use `swoncat` twice to decouple `[c]` and `[F]`.\n", - "- Use `unit` to dequote `c`.\n", - "- Use `dipd` to untangle `[unit [pop] swoncat]` from the givens.\n", - "\n", - "At this point all of the arguments (givens) to the hylomorphism are to the left so we have\n", - "a definition for `hylomorphism`:\n", - "\n", - " hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - "\n", - "The order of parameters is different than the one we started with but\n", - "that hardly matters, you can rearrange them or just supply them in the\n", - "expected order.\n", - "\n", - " [P] c [G] [F] hylomorphism == H\n", - "\n" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [], - "source": [ - "define('hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Demonstrate summing a range of integers from 0 to n-1.\n", - "\n", - "- `[P]` is `[0 <=]`\n", - "- `c` is `0`\n", - "- `[G]` is `[1 - dup]`\n", - "- `[F]` is `[+]`\n", - "\n", - "So to sum the positive integers less than five we can do this." - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 5 [0 <=] 0 [1 - dup] [+] hylomorphism\n", - " 5 . [0 <=] 0 [1 - dup] [+] hylomorphism\n", - " 5 [0 <=] . 0 [1 - dup] [+] hylomorphism\n", - " 5 [0 <=] 0 . [1 - dup] [+] hylomorphism\n", - " 5 [0 <=] 0 [1 - dup] . [+] hylomorphism\n", - " 5 [0 <=] 0 [1 - dup] [+] . hylomorphism\n", - " 5 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - " 5 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec\n", - " 5 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec\n", - " 5 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec\n", - " 5 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec\n", - " 5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec\n", - " 5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec\n", - " 5 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec\n", - " 5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec\n", - " 5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte\n", - "5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i\n", - " 5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i\n", - " 5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i\n", - " 5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip +\n", - " 4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 +\n", - " 4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 +\n", - " 4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 +\n", - " 4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 +\n", - " 4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 +\n", - " 4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 +\n", - "4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 +\n", - " 4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 +\n", - " 4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 +\n", - " 4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +\n", - " 4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +\n", - " 3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +\n", - " 3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 +\n", - " 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 +\n", - " 3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 +\n", - " 3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 +\n", - " 3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 +\n", - " 3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 +\n", - " 3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 +\n", - " 3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 +\n", - "3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 +\n", - " 3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 +\n", - " 3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 +\n", - " 3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +\n", - " 3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +\n", - " 2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +\n", - " 2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 +\n", - " 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 +\n", - " 2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 +\n", - " 2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 +\n", - " 2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 +\n", - " 2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 +\n", - " 2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 +\n", - " 2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 +\n", - "2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 +\n", - " 2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 +\n", - " 2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 +\n", - " 2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +\n", - " 2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +\n", - " 1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +\n", - " 1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 +\n", - " 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 +\n", - " 1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 +\n", - " 1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 +\n", - " 1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 +\n", - " 1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 +\n", - " 1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 +\n", - " 1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 +\n", - "1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 +\n", - " 1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 +\n", - " 1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 +\n", - " 1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +\n", - " 1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +\n", - " 0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +\n", - " 0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 +\n", - " 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 +\n", - " 0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 +\n", - " 0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 +\n", - " 0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 +\n", - " 0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 +\n", - " 0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 +\n", - " 0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 +\n", - "0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 +\n", - " 0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 +\n", - " 0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 +\n", - " True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 +\n", - " True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 +\n", - " 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 +\n", - " 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 +\n", - " 0 [pop 0] . i 0 + 1 + 2 + 3 + 4 +\n", - " 0 . pop 0 0 + 1 + 2 + 3 + 4 +\n", - " . 0 0 + 1 + 2 + 3 + 4 +\n", - " 0 . 0 + 1 + 2 + 3 + 4 +\n", - " 0 0 . + 1 + 2 + 3 + 4 +\n", - " 0 . 1 + 2 + 3 + 4 +\n", - " 0 1 . + 2 + 3 + 4 +\n", - " 1 . 2 + 3 + 4 +\n", - " 1 2 . + 3 + 4 +\n", - " 3 . 3 + 4 +\n", - " 3 3 . + 4 +\n", - " 6 . 4 +\n", - " 6 4 . +\n", - " 10 . \n" - ] - } - ], - "source": [ - "V('5 [0 <=] 0 [1 - dup] [+] hylomorphism')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Anamorphism\n", - "An anamorphism can be defined as a hylomorphism that uses `[]` for `c` and\n", - "`swons` for `F`.\n", - "\n", - " [P] [G] anamorphism == [P] [] [G] [swons] hylomorphism == A\n", - "\n", - "This allows us to define an anamorphism combinator in terms of\n", - "the hylomorphism combinator.\n", - "\n", - " [] swap [swons] hylomorphism == anamorphism\n", - "\n", - "Partial evaluation gives us a \"pre-cooked\" form.\n", - "\n", - " [P] [G] . anamorphism\n", - " [P] [G] . [] swap [swons] hylomorphism\n", - " [P] [G] [] . swap [swons] hylomorphism\n", - " [P] [] [G] . [swons] hylomorphism\n", - " [P] [] [G] [swons] . hylomorphism\n", - " [P] [] [G] [swons] . [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - " [P] [] [G] [swons] [unit [pop] swoncat] . dipd [dip] swoncat genrec\n", - " [P] [] . unit [pop] swoncat [G] [swons] [dip] swoncat genrec\n", - " [P] [[]] [pop] . swoncat [G] [swons] [dip] swoncat genrec\n", - " [P] [pop []] [G] [swons] [dip] . swoncat genrec\n", - "\n", - " [P] [pop []] [G] [dip swons] genrec\n", - "\n", - "(We could also have just substituted for `c` and `F` in the definition of `H`.)\n", - "\n", - " H == [P] [pop c ] [G] [dip F ] genrec\n", - " A == [P] [pop []] [G] [dip swons] genrec\n", - "\n", - "The partial evaluation is overkill in this case but it serves as a\n", - "reminder that this sort of program specialization can, in many cases, be\n", - "carried out automatically.)\n", - "\n", - "Untangle `[G]` from `[pop []]` using `swap`.\n", - "\n", - " [P] [G] [pop []] swap [dip swons] genrec\n", - "\n", - "All of the arguments to `anamorphism` are to the left, so we have a definition for it.\n", - "\n", - " anamorphism == [pop []] swap [dip swons] genrec\n", - "\n", - "An example of an anamorphism is the range function.\n", - "\n", - " range == [0 <=] [1 - dup] anamorphism\n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Catamorphism\n", - "A catamorphism can be defined as a hylomorphism that uses `[uncons swap]` for `[G]`\n", - "and `[[] =]` for the predicate `[P]`.\n", - "\n", - " c [F] catamorphism == [[] =] c [uncons swap] [F] hylomorphism == C\n", - "\n", - "This allows us to define a `catamorphism` combinator in terms of\n", - "the `hylomorphism` combinator.\n", - "\n", - " [[] =] roll> [uncons swap] swap hylomorphism == catamorphism\n", - " \n", - "Partial evaluation doesn't help much.\n", - "\n", - " c [F] . catamorphism\n", - " c [F] . [[] =] roll> [uncons swap] swap hylomorphism\n", - " c [F] [[] =] . roll> [uncons swap] swap hylomorphism\n", - " [[] =] c [F] [uncons swap] . swap hylomorphism\n", - " [[] =] c [uncons swap] [F] . hylomorphism\n", - " [[] =] c [uncons swap] [F] [unit [pop] swoncat] . dipd [dip] swoncat genrec\n", - " [[] =] c . unit [pop] swoncat [uncons swap] [F] [dip] swoncat genrec\n", - " [[] =] [c] [pop] . swoncat [uncons swap] [F] [dip] swoncat genrec\n", - " [[] =] [pop c] [uncons swap] [F] [dip] . swoncat genrec\n", - " [[] =] [pop c] [uncons swap] [dip F] genrec\n", - "\n", - "Because the arguments to catamorphism have to be prepared (unlike the arguments\n", - "to anamorphism, which only need to be rearranged slightly) there isn't much point\n", - "to \"pre-cooking\" the definition.\n", - "\n", - " catamorphism == [[] =] roll> [uncons swap] swap hylomorphism\n", - "\n", - "An example of a catamorphism is the sum function.\n", - "\n", - " sum == 0 [+] catamorphism" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### \"Fusion Law\" for catas (UNFINISHED!!!)\n", - "\n", - "I'm not sure exactly how to translate the \"Fusion Law\" for catamorphisms into Joy.\n", - "\n", - "I know that a `map` composed with a cata can be expressed as a new cata:\n", - "\n", - " [F] map b [B] cata == b [F B] cata\n", - "\n", - "But this isn't the one described in \"Bananas...\". That's more like:\n", - "\n", - "A cata composed with some function can be expressed as some other cata:\n", - "\n", - " b [B] catamorphism F == c [C] catamorphism\n", - "\n", - "Given:\n", - "\n", - " b F == c\n", - "\n", - " ...\n", - "\n", - " B F == [F] dip C\n", - "\n", - " ...\n", - "\n", - " b[B]cata F == c[C]cata\n", - "\n", - " F(B(head, tail)) == C(head, F(tail))\n", - "\n", - " 1 [2 3] B F 1 [2 3] F C\n", - "\n", - "\n", - " b F == c\n", - " B F == F C\n", - "\n", - " b [B] catamorphism F == c [C] catamorphism\n", - " b [B] catamorphism F == b F [C] catamorphism\n", - "\n", - " ...\n", - "\n", - "Or maybe,\n", - "\n", - " [F] map b [B] cata == c [C] cata ???\n", - "\n", - " [F] map b [B] cata == b [F B] cata I think this is generally true, unless F consumes stack items\n", - " instead of just transforming TOS. Of course, there's always [F] unary.\n", - " b [F] unary [[F] unary B] cata\n", - "\n", - " [10 *] map 0 swap [+] step == 0 swap [10 * +] step\n", - "\n", - "\n", - "For example:\n", - "\n", - " F == 10 *\n", - " b == 0\n", - " B == +\n", - " c == 0\n", - " C == F +\n", - " \n", - " b F == c\n", - " 0 10 * == 0\n", - "\n", - " B F == [F] dip C\n", - " + 10 * == [10 *] dip F +\n", - " + 10 * == [10 *] dip 10 * +\n", - "\n", - " n m + 10 * == 10(n+m)\n", - "\n", - " n m [10 *] dip 10 * +\n", - " n 10 * m 10 * +\n", - " 10n m 10 * +\n", - " 10n 10m +\n", - " 10n+10m\n", - "\n", - " 10n+10m = 10(n+m)\n", - "\n", - "Ergo:\n", - "\n", - " 0 [+] catamorphism 10 * == 0 [10 * +] catamorphism" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## The `step` combinator will usually be better to use than `catamorphism`.\n", - "\n", - " sum == 0 swap [+] step\n", - " sum == 0 [+] catamorphism" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# anamorphism catamorphism == hylomorphism\n", - "Here is (part of) the payoff.\n", - "\n", - "An anamorphism followed by (composed with) a\n", - "catamorphism is a hylomorphism, with the advantage that the hylomorphism \n", - "does not create the intermediate list structure. The values are stored in\n", - "either the call stack, for those implementations that use one, or in the pending\n", - "expression (\"continuation\") for the Joypy interpreter. They still have to \n", - "be somewhere, converting from an anamorphism and catamorphism to a hylomorphism\n", - "just prevents using additional storage and doing additional processing.\n", - "\n", - " range == [0 <=] [1 - dup] anamorphism\n", - " sum == 0 [+] catamorphism\n", - "\n", - " range sum == [0 <=] [1 - dup] anamorphism 0 [+] catamorphism\n", - " == [0 <=] 0 [1 - dup] [+] hylomorphism\n", - "\n", - "We can let the `hylomorphism` combinator build `range_sum` for us or just\n", - "substitute ourselves.\n", - "\n", - " H == [P] [pop c] [G] [dip F] genrec\n", - " range_sum == [0 <=] [pop 0] [1 - dup] [dip +] genrec\n" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [], - "source": [ - "defs = '''\n", - "anamorphism == [pop []] swap [dip swons] genrec\n", - "hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - "catamorphism == [[] =] roll> [uncons swap] swap hylomorphism\n", - "range == [0 <=] [1 - dup] anamorphism\n", - "sum == 0 [+] catamorphism\n", - "range_sum == [0 <=] 0 [1 - dup] [+] hylomorphism\n", - "'''\n", - "\n", - "DefinitionWrapper.add_definitions(defs, D)" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[9 8 7 6 5 4 3 2 1 0]\n" - ] - } - ], - "source": [ - "J('10 range')" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "45\n" - ] - } - ], - "source": [ - "J('[9 8 7 6 5 4 3 2 1 0] sum')" - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 10 range sum\n", - " 10 . range sum\n", - " 10 . [0 <=] [1 - dup] anamorphism sum\n", - " 10 [0 <=] . [1 - dup] anamorphism sum\n", - " 10 [0 <=] [1 - dup] . anamorphism sum\n", - " 10 [0 <=] [1 - dup] . [pop []] swap [dip swons] genrec sum\n", - " 10 [0 <=] [1 - dup] [pop []] . swap [dip swons] genrec sum\n", - " 10 [0 <=] [pop []] [1 - dup] . [dip swons] genrec sum\n", - " 10 [0 <=] [pop []] [1 - dup] [dip swons] . genrec sum\n", - " 10 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte sum\n", - " 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [10] [0 <=] . infra first choice i sum\n", - " 10 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum\n", - " 10 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] . swaack first choice i sum\n", - " 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i sum\n", - " 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i sum\n", - " 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i sum\n", - " 10 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum\n", - " 10 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum\n", - " 9 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum\n", - " 9 9 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum\n", - " 9 9 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons sum\n", - " 9 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 9 swons sum\n", - " 9 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 9 swons sum\n", - " 9 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 9 swons sum\n", - " 9 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 9 swons sum\n", - " 9 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 9 swons sum\n", - " 9 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 9 swons sum\n", - " 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [9] [0 <=] . infra first choice i 9 swons sum\n", - " 9 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum\n", - " 9 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] . swaack first choice i 9 swons sum\n", - " 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 9 swons sum\n", - " 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 9 swons sum\n", - " 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 9 swons sum\n", - " 9 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum\n", - " 9 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum\n", - " 8 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum\n", - " 8 8 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum\n", - " 8 8 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 9 swons sum\n", - " 8 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum\n", - " 8 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum\n", - " 8 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 8 swons 9 swons sum\n", - " 8 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 8 swons 9 swons sum\n", - " 8 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 8 swons 9 swons sum\n", - " 8 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 8 swons 9 swons sum\n", - " 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [8] [0 <=] . infra first choice i 8 swons 9 swons sum\n", - " 8 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum\n", - " 8 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] . swaack first choice i 8 swons 9 swons sum\n", - " 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 8 swons 9 swons sum\n", - " 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 8 swons 9 swons sum\n", - " 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 8 swons 9 swons sum\n", - " 8 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum\n", - " 8 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum\n", - " 7 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum\n", - " 7 7 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum\n", - " 7 7 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 8 swons 9 swons sum\n", - " 7 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum\n", - " 7 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum\n", - " 7 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum\n", - " 7 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 7 swons 8 swons 9 swons sum\n", - " 7 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 7 swons 8 swons 9 swons sum\n", - " 7 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 7 swons 8 swons 9 swons sum\n", - " 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [7] [0 <=] . infra first choice i 7 swons 8 swons 9 swons sum\n", - " 7 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum\n", - " 7 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] . swaack first choice i 7 swons 8 swons 9 swons sum\n", - " 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 7 swons 8 swons 9 swons sum\n", - " 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 7 swons 8 swons 9 swons sum\n", - " 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 7 swons 8 swons 9 swons sum\n", - " 7 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum\n", - " 7 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum\n", - " 6 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum\n", - " 6 6 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum\n", - " 6 6 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 7 swons 8 swons 9 swons sum\n", - " 6 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [6] [0 <=] . infra first choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] . swaack first choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 6 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 5 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 5 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [5] [0 <=] . infra first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] . swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 4 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 4 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [4] [0 <=] . infra first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] . swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 3 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 3 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [3] [0 <=] . infra first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] . swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 2 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 2 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [2] [0 <=] . infra first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 1 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 1 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [1] [0 <=] . infra first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 0 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 0 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [0] [0 <=] . infra first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " True . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " True [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] . swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] True . choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [pop []] . i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 . pop [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " . [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [] . 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [] 0 . swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [] 0 . swap cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 0 [] . cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [0] . 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [0] 1 . swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [0] 1 . swap cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 1 [0] . cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [1 0] . 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [1 0] 2 . swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [1 0] 2 . swap cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 2 [1 0] . cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [2 1 0] . 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [2 1 0] 3 . swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [2 1 0] 3 . swap cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 3 [2 1 0] . cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [3 2 1 0] . 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [3 2 1 0] 4 . swons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [3 2 1 0] 4 . swap cons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " 4 [3 2 1 0] . cons 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [4 3 2 1 0] . 5 swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [4 3 2 1 0] 5 . swons 6 swons 7 swons 8 swons 9 swons sum\n", - " [4 3 2 1 0] 5 . swap cons 6 swons 7 swons 8 swons 9 swons sum\n", - " 5 [4 3 2 1 0] . cons 6 swons 7 swons 8 swons 9 swons sum\n", - " [5 4 3 2 1 0] . 6 swons 7 swons 8 swons 9 swons sum\n", - " [5 4 3 2 1 0] 6 . swons 7 swons 8 swons 9 swons sum\n", - " [5 4 3 2 1 0] 6 . swap cons 7 swons 8 swons 9 swons sum\n", - " 6 [5 4 3 2 1 0] . cons 7 swons 8 swons 9 swons sum\n", - " [6 5 4 3 2 1 0] . 7 swons 8 swons 9 swons sum\n", - " [6 5 4 3 2 1 0] 7 . swons 8 swons 9 swons sum\n", - " [6 5 4 3 2 1 0] 7 . swap cons 8 swons 9 swons sum\n", - " 7 [6 5 4 3 2 1 0] . cons 8 swons 9 swons sum\n", - " [7 6 5 4 3 2 1 0] . 8 swons 9 swons sum\n", - " [7 6 5 4 3 2 1 0] 8 . swons 9 swons sum\n", - " [7 6 5 4 3 2 1 0] 8 . swap cons 9 swons sum\n", - " 8 [7 6 5 4 3 2 1 0] . cons 9 swons sum\n", - " [8 7 6 5 4 3 2 1 0] . 9 swons sum\n", - " [8 7 6 5 4 3 2 1 0] 9 . swons sum\n", - " [8 7 6 5 4 3 2 1 0] 9 . swap cons sum\n", - " 9 [8 7 6 5 4 3 2 1 0] . cons sum\n", - " [9 8 7 6 5 4 3 2 1 0] . sum\n", - " [9 8 7 6 5 4 3 2 1 0] . 0 [+] catamorphism\n", - " [9 8 7 6 5 4 3 2 1 0] 0 . [+] catamorphism\n", - " [9 8 7 6 5 4 3 2 1 0] 0 [+] . catamorphism\n", - " [9 8 7 6 5 4 3 2 1 0] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism\n", - " [9 8 7 6 5 4 3 2 1 0] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] . [uncons swap] swap hylomorphism\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] [uncons swap] . swap hylomorphism\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . hylomorphism\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec\n", - " [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte\n", - "[9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[9 8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i\n", - " [9 8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i\n", - " [9 8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] . swaack first choice i\n", - " [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i\n", - " [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i\n", - " [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i\n", - " [9 8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +\n", - " 9 [8 7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +\n", - " [8 7 6 5 4 3 2 1 0] 9 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +\n", - " [8 7 6 5 4 3 2 1 0] 9 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip +\n", - " [8 7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 9 +\n", - " [8 7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 9 +\n", - " [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 9 +\n", - " [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 9 +\n", - " [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 9 +\n", - " [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 9 +\n", - " [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 9 +\n", - " [8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 +\n", - " [8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] . swaack first choice i 9 +\n", - " [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 +\n", - " [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 9 +\n", - " [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 9 +\n", - " [8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 +\n", - " 8 [7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 +\n", - " [7 6 5 4 3 2 1 0] 8 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 +\n", - " [7 6 5 4 3 2 1 0] 8 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 9 +\n", - " [7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] . swaack first choice i 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 8 + 9 +\n", - " [7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 +\n", - " 7 [6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 +\n", - " [6 5 4 3 2 1 0] 7 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 +\n", - " [6 5 4 3 2 1 0] 7 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 8 + 9 +\n", - " [6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[6 5 4 3 2 1 0]] [[] =] . infra first choice i 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] . swaack first choice i 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 7 + 8 + 9 +\n", - " [6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " 6 [5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] 6 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] 6 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[5 4 3 2 1 0]] [[] =] . infra first choice i 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] . swaack first choice i 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 +\n", - " [5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " 5 [4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] 5 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] 5 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[4 3 2 1 0]] [[] =] . infra first choice i 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] . swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 +\n", - " [4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] 4 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] 4 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3 2 1 0]] [[] =] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 1 0]] [[] =] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[1 0]] [[] =] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] 1 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] 1 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[0]] [[] =] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] 0 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] 0 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[]] [[] =] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " [] . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 3 . + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 6 . 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 6 4 . + 5 + 6 + 7 + 8 + 9 +\n", - " 10 . 5 + 6 + 7 + 8 + 9 +\n", - " 10 5 . + 6 + 7 + 8 + 9 +\n", - " 15 . 6 + 7 + 8 + 9 +\n", - " 15 6 . + 7 + 8 + 9 +\n", - " 21 . 7 + 8 + 9 +\n", - " 21 7 . + 8 + 9 +\n", - " 28 . 8 + 9 +\n", - " 28 8 . + 9 +\n", - " 36 . 9 +\n", - " 36 9 . +\n", - " 45 . \n" - ] - } - ], - "source": [ - "V('10 range sum')" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 10 range_sum\n", - " 10 . range_sum\n", - " 10 . [0 <=] 0 [1 - dup] [+] hylomorphism\n", - " 10 [0 <=] . 0 [1 - dup] [+] hylomorphism\n", - " 10 [0 <=] 0 . [1 - dup] [+] hylomorphism\n", - " 10 [0 <=] 0 [1 - dup] . [+] hylomorphism\n", - " 10 [0 <=] 0 [1 - dup] [+] . hylomorphism\n", - " 10 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec\n", - " 10 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec\n", - " 10 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec\n", - " 10 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec\n", - " 10 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec\n", - " 10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec\n", - " 10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec\n", - " 10 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec\n", - " 10 [0 <=] [pop 0] [1 - dup] [dip +] . genrec\n", - " 10 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte\n", - "10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [10] [0 <=] . infra first choice i\n", - " 10 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i\n", - " 10 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] . swaack first choice i\n", - " 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i\n", - " 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i\n", - " 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i\n", - " 10 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 10 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 9 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 9 9 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +\n", - " 9 9 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip +\n", - " 9 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 9 +\n", - " 9 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 9 +\n", - " 9 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 9 +\n", - " 9 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 9 +\n", - " 9 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 9 +\n", - " 9 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 9 +\n", - " 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [9] [0 <=] . infra first choice i 9 +\n", - " 9 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 +\n", - " 9 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] . swaack first choice i 9 +\n", - " 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 +\n", - " 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 9 +\n", - " 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 9 +\n", - " 9 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +\n", - " 9 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +\n", - " 8 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +\n", - " 8 8 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 +\n", - " 8 8 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 9 +\n", - " 8 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 8 + 9 +\n", - " 8 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 8 + 9 +\n", - " 8 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 8 + 9 +\n", - " 8 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 8 + 9 +\n", - " 8 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 8 + 9 +\n", - " 8 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 8 + 9 +\n", - " 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [8] [0 <=] . infra first choice i 8 + 9 +\n", - " 8 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 +\n", - " 8 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] . swaack first choice i 8 + 9 +\n", - " 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 +\n", - " 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 +\n", - " 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 8 + 9 +\n", - " 8 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +\n", - " 8 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +\n", - " 7 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +\n", - " 7 7 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 +\n", - " 7 7 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 8 + 9 +\n", - " 7 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 +\n", - " 7 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 +\n", - " 7 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 7 + 8 + 9 +\n", - " 7 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 7 + 8 + 9 +\n", - " 7 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 7 + 8 + 9 +\n", - " 7 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 7 + 8 + 9 +\n", - " 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [7] [0 <=] . infra first choice i 7 + 8 + 9 +\n", - " 7 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 +\n", - " 7 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] . swaack first choice i 7 + 8 + 9 +\n", - " 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 +\n", - " 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 +\n", - " 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 7 + 8 + 9 +\n", - " 7 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " 7 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " 6 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " 6 6 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 +\n", - " 6 6 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 7 + 8 + 9 +\n", - " 6 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 +\n", - " 6 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 +\n", - " 6 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 +\n", - " 6 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 6 + 7 + 8 + 9 +\n", - " 6 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 6 + 7 + 8 + 9 +\n", - " 6 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 +\n", - " 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [6] [0 <=] . infra first choice i 6 + 7 + 8 + 9 +\n", - " 6 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 +\n", - " 6 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] . swaack first choice i 6 + 7 + 8 + 9 +\n", - " 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 +\n", - " 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 +\n", - " 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 +\n", - " 6 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " 6 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " 5 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " 5 5 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 +\n", - " 5 5 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 6 + 7 + 8 + 9 +\n", - " 5 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " 5 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " 5 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " 5 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 5 + 6 + 7 + 8 + 9 +\n", - " 5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 5 + 6 + 7 + 8 + 9 +\n", - " 5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 +\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i 5 + 6 + 7 + 8 + 9 +\n", - " 5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " 5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i 5 + 6 + 7 + 8 + 9 +\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 +\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 +\n", - " 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 +\n", - " 5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " 5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " 4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " 4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 +\n", - " 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 +\n", - " 4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 3 3 . + 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 6 . 4 + 5 + 6 + 7 + 8 + 9 +\n", - " 6 4 . + 5 + 6 + 7 + 8 + 9 +\n", - " 10 . 5 + 6 + 7 + 8 + 9 +\n", - " 10 5 . + 6 + 7 + 8 + 9 +\n", - " 15 . 6 + 7 + 8 + 9 +\n", - " 15 6 . + 7 + 8 + 9 +\n", - " 21 . 7 + 8 + 9 +\n", - " 21 7 . + 8 + 9 +\n", - " 28 . 8 + 9 +\n", - " 28 8 . + 9 +\n", - " 36 . 9 +\n", - " 36 9 . +\n", - " 45 . \n" - ] - } - ], - "source": [ - "V('10 range_sum')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Factorial Function and Paramorphisms\n", - "A paramorphism `P :: B -> A` is a recursion combinator that uses `dup` on intermediate values.\n", - "\n", - " n swap [P] [pop] [[F] dupdip G] primrec\n", - "\n", - "With\n", - "- `n :: A` is the \"identity\" for `F` (like 1 for multiplication, 0 for addition)\n", - "- `F :: (A, B) -> A`\n", - "- `G :: B -> B` generates the next `B` value.\n", - "- and lastly `P :: B -> Bool` detects the end of the series." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "For Factorial function (types `A` and `B` are both integer):\n", - "\n", - " n == 1\n", - " F == *\n", - " G == --\n", - " P == 1 <=" - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [], - "source": [ - "define('factorial == 1 swap [1 <=] [pop] [[*] dupdip --] primrec')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Try it with input 3 (omitting evaluation of predicate):\n", - "\n", - " 3 1 swap [1 <=] [pop] [[*] dupdip --] primrec\n", - " 1 3 [1 <=] [pop] [[*] dupdip --] primrec\n", - "\n", - " 1 3 [*] dupdip --\n", - " 1 3 * 3 --\n", - " 3 3 --\n", - " 3 2\n", - "\n", - " 3 2 [*] dupdip --\n", - " 3 2 * 2 --\n", - " 6 2 --\n", - " 6 1\n", - "\n", - " 6 1 [1 <=] [pop] [[*] dupdip --] primrec\n", - "\n", - " 6 1 pop\n", - " 6" - ] - }, - { - "cell_type": "code", - "execution_count": 16, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6\n" - ] - } - ], - "source": [ - "J('3 factorial')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Derive `paramorphism` from the form above.\n", - "\n", - " n swap [P] [pop] [[F] dupdip G] primrec\n", - "\n", - " n swap [P] [pop] [[F] dupdip G] primrec\n", - " n [P] [swap] dip [pop] [[F] dupdip G] primrec\n", - " n [P] [[F] dupdip G] [[swap] dip [pop]] dip primrec\n", - " n [P] [F] [dupdip G] cons [[swap] dip [pop]] dip primrec\n", - " n [P] [F] [G] [dupdip] swoncat cons [[swap] dip [pop]] dip primrec\n", - "\n", - " paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec" - ] - }, - { - "cell_type": "code", - "execution_count": 17, - "metadata": {}, - "outputs": [], - "source": [ - "define('paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec')\n", - "define('factorial == 1 [1 <=] [*] [--] paramorphism')" - ] - }, - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "6\n" - ] - } - ], - "source": [ - "J('3 factorial')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# `tails`\n", - "An example of a paramorphism for lists given in the [\"Bananas...\" paper](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125) is `tails` which returns the list of \"tails\" of a list.\n", - "\n", - " [1 2 3] tails == [[] [3] [2 3]]\n", - " \n", - "Using `paramorphism` we would write:\n", - "\n", - " n == []\n", - " F == rest swons\n", - " G == rest\n", - " P == not\n", - "\n", - " tails == [] [not] [rest swons] [rest] paramorphism" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": {}, - "outputs": [], - "source": [ - "define('tails == [] [not] [rest swons] [rest] paramorphism')" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[[] [3] [2 3]]\n" - ] - } - ], - "source": [ - "J('[1 2 3] tails')" - ] - }, - { - "cell_type": "code", - "execution_count": 21, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276]\n" - ] - } - ], - "source": [ - "J('25 range tails [popop] infra [sum] map')" - ] - }, - { - "cell_type": "code", - "execution_count": 22, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[276 253 231 210 190 171 153 136 120 105 91 78 66 55 45 36 28 21 15 10 6 3 1 0 0]\n" - ] - } - ], - "source": [ - "J('25 range [range_sum] map')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Factoring `rest`\n", - "Right before the recursion begins we have:\n", - " \n", - " [] [1 2 3] [not] [pop] [[rest swons] dupdip rest] primrec\n", - " \n", - "But we might prefer to factor `rest` in the quote:\n", - "\n", - " [] [1 2 3] [not] [pop] [rest [swons] dupdip] primrec\n", - "\n", - "There's no way to do that with the `paramorphism` combinator as defined. We would have to write and use a slightly different recursion combinator that accepted an additional \"preprocessor\" function `[H]` and built:\n", - "\n", - " n swap [P] [pop] [H [F] dupdip G] primrec\n", - "\n", - "Or just write it out manually. This is yet another place where the *sufficiently smart compiler* will one day automatically refactor the code. We could write a `paramorphism` combinator that checked `[F]` and `[G]` for common prefix and extracted it." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Patterns of Recursion\n", - "Our story so far...\n", - "\n", - "- A combiner `F :: (B, B) -> B`\n", - "- A predicate `P :: A -> Bool` to detect the base case\n", - "- A base case value `c :: B`\n", - "\n", - "\n", - "### Hylo-, Ana-, Cata-\n", - "\n", - " w/ G :: A -> (A, B)\n", - "\n", - " H == [P ] [pop c ] [G ] [dip F ] genrec\n", - " A == [P ] [pop []] [G ] [dip swons] genrec\n", - " C == [[] =] [pop c ] [uncons swap] [dip F ] genrec\n", - "\n", - "### Para-, ?-, ?-\n", - "\n", - " w/ G :: B -> B\n", - "\n", - " P == c swap [P ] [pop] [[F ] dupdip G ] primrec\n", - " ? == [] swap [P ] [pop] [[swons] dupdip G ] primrec\n", - " ? == c swap [[] =] [pop] [[F ] dupdip uncons swap] primrec\n" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Four Generalizations\n", - "There are at least four kinds of recursive combinator, depending on two choices. The first choice is whether the combiner function should be evaluated during the recursion or pushed into the pending expression to be \"collapsed\" at the end. The second choice is whether the combiner needs to operate on the current value of the datastructure or the generator's output.\n", - "\n", - " H == [P] [pop c] [G ] [dip F] genrec\n", - " H == c swap [P] [pop] [G [F] dip ] [i] genrec\n", - " H == [P] [pop c] [ [G] dupdip ] [dip F] genrec\n", - " H == c swap [P] [pop] [ [F] dupdip G] [i] genrec\n", - "\n", - "Consider:\n", - "\n", - " ... a G [H] dip F w/ a G == a' b\n", - " ... c a G [F] dip H a G == b a'\n", - " ... a [G] dupdip [H] dip F a G == a'\n", - " ... c a [F] dupdip G H a G == a'" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### 1\n", - "\n", - " H == [P] [pop c] [G] [dip F] genrec\n", - "\n", - "Iterate n times.\n", - "\n", - " ... a [P] [pop c] [G] [dip F] genrec\n", - " ... a G [H] dip F\n", - " ... a' b [H] dip F\n", - " ... a' H b F\n", - " ... a' G [H] dip F b F\n", - " ... a'' b [H] dip F b F\n", - " ... a'' H b F b F\n", - " ... a'' G [H] dip F b F b F\n", - " ... a''' b [H] dip F b F b F\n", - " ... a''' H b F b F b F\n", - " ... a''' pop c b F b F b F\n", - " ... c b F b F b F\n", - "\n", - "This form builds up a continuation that contains the intermediate results along with the pending combiner functions. When the base case is reached the last term is replaced by the identity value c and the continuation \"collapses\" into the final result." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### 2\n", - "When you can start with the identity value c on the stack and the combiner can operate as you go, using the intermediate results immediately rather than queuing them up, use this form. An important difference is that the generator function must return its results in the reverse order.\n", - "\n", - " H == c swap [P] [pop] [G [F] dip] primrec\n", - "\n", - " ... c a G [F] dip H\n", - " ... c b a' [F] dip H\n", - " ... c b F a' H\n", - " ... c b F a' G [F] dip H\n", - " ... c b F b a'' [F] dip H\n", - " ... c b F b F a'' H\n", - " ... c b F b F a'' G [F] dip H\n", - " ... c b F b F b a''' [F] dip H\n", - " ... c b F b F b F a''' H\n", - " ... c b F b F b F a''' pop\n", - " ... c b F b F b F\n", - "\n", - "The end line here is the same as for above, but only because we didn't evaluate `F` when it normally would have been." - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### 3\n", - "If the combiner and the generator both need to work on the current value then `dup` must be used at some point, and the generator must produce one item instead of two (the b is instead the duplicate of a.)\n", - "\n", - "\n", - " H == [P] [pop c] [[G] dupdip] [dip F] genrec\n", - "\n", - " ... a [G] dupdip [H] dip F\n", - " ... a G a [H] dip F\n", - " ... a' a [H] dip F\n", - " ... a' H a F\n", - " ... a' [G] dupdip [H] dip F a F\n", - " ... a' G a' [H] dip F a F\n", - " ... a'' a' [H] dip F a F\n", - " ... a'' H a' F a F\n", - " ... a'' [G] dupdip [H] dip F a' F a F\n", - " ... a'' G a'' [H] dip F a' F a F\n", - " ... a''' a'' [H] dip F a' F a F\n", - " ... a''' H a'' F a' F a F\n", - " ... a''' pop c a'' F a' F a F\n", - " ... c a'' F a' F a F" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### 4\n", - "And, last but not least, if you can combine as you go, starting with c, and the combiner needs to work on the current item, this is the form:\n", - "\n", - " W == c swap [P] [pop] [[F] dupdip G] primrec\n", - "\n", - " ... a c swap [P] [pop] [[F] dupdip G] primrec\n", - " ... c a [P] [pop] [[F] dupdip G] primrec\n", - " ... c a [F] dupdip G W\n", - " ... c a F a G W\n", - " ... c a F a' W\n", - " ... c a F a' [F] dupdip G W\n", - " ... c a F a' F a' G W\n", - " ... c a F a' F a'' W\n", - " ... c a F a' F a'' [F] dupdip G W\n", - " ... c a F a' F a'' F a'' G W\n", - " ... c a F a' F a'' F a''' W\n", - " ... c a F a' F a'' F a''' pop\n", - " ... c a F a' F a'' F" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Each of the four variations above can be specialized to ana- and catamorphic forms." - ] - }, - { - "cell_type": "code", - "execution_count": 23, - "metadata": {}, - "outputs": [], - "source": [ - "def WTFmorphism(c, F, P, G):\n", - " '''Return a hylomorphism function H.'''\n", - "\n", - " def H(a, d=c):\n", - " if P(a):\n", - " result = d\n", - " else:\n", - " a, b = G(a)\n", - " result = H(a, F(d, b))\n", - " return result\n", - "\n", - " return H" - ] - }, - { - "cell_type": "code", - "execution_count": 24, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "10\n" - ] - } - ], - "source": [ - "F = lambda a, b: a + b\n", - "P = lambda n: n <= 1\n", - "G = lambda n: (n - 1, n - 1)\n", - "\n", - "wtf = WTFmorphism(0, F, P, G)\n", - "\n", - "print wtf(5)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " H == [P ] [pop c ] [G ] [dip F ] genrec" - ] - }, - { - "cell_type": "code", - "execution_count": 25, - "metadata": {}, - "outputs": [], - "source": [ - "DefinitionWrapper.add_definitions('''\n", - "P == 1 <=\n", - "Ga == -- dup\n", - "Gb == --\n", - "c == 0\n", - "F == +\n", - "''', D)" - ] - }, - { - "cell_type": "code", - "execution_count": 26, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec\n", - " [1 2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec\n", - " [1 2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec\n", - " [1 2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec\n", - " [1 2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec\n", - " [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec\n", - " [1 2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte\n", - "[1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[1 2 3]] [[] =] . infra first choice i\n", - " [1 2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i\n", - " [1 2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i\n", - " False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i\n", - " False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] . swaack first choice i\n", - " [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i\n", - " [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i\n", - " [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i\n", - " [1 2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons\n", - " 1 [2 3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons\n", - " [2 3] 1 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons\n", - " [2 3] 1 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons\n", - " [2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 1 swons\n", - " [2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 1 swons\n", - " [2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 1 swons\n", - " [2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 1 swons\n", - " [2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 1 swons\n", - " [2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 1 swons\n", - " [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[2 3]] [[] =] . infra first choice i 1 swons\n", - " [2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons\n", - " [2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons\n", - " False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons\n", - " False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] . swaack first choice i 1 swons\n", - " [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons\n", - " [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons\n", - " [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 1 swons\n", - " [2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons\n", - " 2 [3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons\n", - " [3] 2 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons\n", - " [3] 2 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 1 swons\n", - " [3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons\n", - " [3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons\n", - " [3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 2 swons 1 swons\n", - " [3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 2 swons 1 swons\n", - " [3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 2 swons 1 swons\n", - " [3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 2 swons 1 swons\n", - " [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[3]] [[] =] . infra first choice i 2 swons 1 swons\n", - " [3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons\n", - " [3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons\n", - " False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons\n", - " False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] . swaack first choice i 2 swons 1 swons\n", - " [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 1 swons\n", - " [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 1 swons\n", - " [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 2 swons 1 swons\n", - " [3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons\n", - " 3 [] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons\n", - " [] 3 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons\n", - " [] 3 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 2 swons 1 swons\n", - " [] . [[] =] [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons\n", - " [] [[] =] . [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons\n", - " [] [[] =] [pop []] . [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons\n", - " [] [[] =] [pop []] [uncons swap] . [dip swons] genrec 3 swons 2 swons 1 swons\n", - " [] [[] =] [pop []] [uncons swap] [dip swons] . genrec 3 swons 2 swons 1 swons\n", - " [] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 3 swons 2 swons 1 swons\n", - " [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[]] [[] =] . infra first choice i 3 swons 2 swons 1 swons\n", - " [] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons\n", - " [] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons\n", - " True . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons\n", - " True [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] . swaack first choice i 3 swons 2 swons 1 swons\n", - " [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 3 swons 2 swons 1 swons\n", - " [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] True . choice i 3 swons 2 swons 1 swons\n", - " [] [pop []] . i 3 swons 2 swons 1 swons\n", - " [] . pop [] 3 swons 2 swons 1 swons\n", - " . [] 3 swons 2 swons 1 swons\n", - " [] . 3 swons 2 swons 1 swons\n", - " [] 3 . swons 2 swons 1 swons\n", - " [] 3 . swap cons 2 swons 1 swons\n", - " 3 [] . cons 2 swons 1 swons\n", - " [3] . 2 swons 1 swons\n", - " [3] 2 . swons 1 swons\n", - " [3] 2 . swap cons 1 swons\n", - " 2 [3] . cons 1 swons\n", - " [2 3] . 1 swons\n", - " [2 3] 1 . swons\n", - " [2 3] 1 . swap cons\n", - " 1 [2 3] . cons\n", - " [1 2 3] . \n" - ] - } - ], - "source": [ - "V('[1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 27, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 3 [P] [pop c] [Ga] [dip F] genrec\n", - " 3 . [P] [pop c] [Ga] [dip F] genrec\n", - " 3 [P] . [pop c] [Ga] [dip F] genrec\n", - " 3 [P] [pop c] . [Ga] [dip F] genrec\n", - " 3 [P] [pop c] [Ga] . [dip F] genrec\n", - " 3 [P] [pop c] [Ga] [dip F] . genrec\n", - " 3 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte\n", - "3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [3] [P] . infra first choice i\n", - " 3 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i\n", - " 3 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i\n", - " 3 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i\n", - " False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i\n", - "False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] . swaack first choice i\n", - "3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i\n", - " 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i\n", - " 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i\n", - " 3 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F\n", - " 3 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F\n", - " 2 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F\n", - " 2 2 . [[P] [pop c] [Ga] [dip F] genrec] dip F\n", - " 2 2 [[P] [pop c] [Ga] [dip F] genrec] . dip F\n", - " 2 . [P] [pop c] [Ga] [dip F] genrec 2 F\n", - " 2 [P] . [pop c] [Ga] [dip F] genrec 2 F\n", - " 2 [P] [pop c] . [Ga] [dip F] genrec 2 F\n", - " 2 [P] [pop c] [Ga] . [dip F] genrec 2 F\n", - " 2 [P] [pop c] [Ga] [dip F] . genrec 2 F\n", - " 2 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 2 F\n", - "2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [2] [P] . infra first choice i 2 F\n", - " 2 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F\n", - " 2 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F\n", - " 2 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F\n", - " False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F\n", - "False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] . swaack first choice i 2 F\n", - "2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F\n", - " 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i 2 F\n", - " 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i 2 F\n", - " 2 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F\n", - " 2 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F\n", - " 1 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F\n", - " 1 1 . [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F\n", - " 1 1 [[P] [pop c] [Ga] [dip F] genrec] . dip F 2 F\n", - " 1 . [P] [pop c] [Ga] [dip F] genrec 1 F 2 F\n", - " 1 [P] . [pop c] [Ga] [dip F] genrec 1 F 2 F\n", - " 1 [P] [pop c] . [Ga] [dip F] genrec 1 F 2 F\n", - " 1 [P] [pop c] [Ga] . [dip F] genrec 1 F 2 F\n", - " 1 [P] [pop c] [Ga] [dip F] . genrec 1 F 2 F\n", - " 1 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 1 F 2 F\n", - "1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [1] [P] . infra first choice i 1 F 2 F\n", - " 1 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F\n", - " 1 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F\n", - " 1 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F\n", - " True . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F\n", - " True [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] . swaack first choice i 1 F 2 F\n", - " 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F\n", - " 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F\n", - " 1 [pop c] . i 1 F 2 F\n", - " 1 . pop c 1 F 2 F\n", - " . c 1 F 2 F\n", - " . 0 1 F 2 F\n", - " 0 . 1 F 2 F\n", - " 0 1 . F 2 F\n", - " 0 1 . + 2 F\n", - " 1 . 2 F\n", - " 1 2 . F\n", - " 1 2 . +\n", - " 3 . \n" - ] - } - ], - "source": [ - "V('3 [P] [pop c] [Ga] [dip F] genrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 28, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . 3 [P] [pop []] [Ga] [dip swons] genrec\n", - " 3 . [P] [pop []] [Ga] [dip swons] genrec\n", - " 3 [P] . [pop []] [Ga] [dip swons] genrec\n", - " 3 [P] [pop []] . [Ga] [dip swons] genrec\n", - " 3 [P] [pop []] [Ga] . [dip swons] genrec\n", - " 3 [P] [pop []] [Ga] [dip swons] . genrec\n", - " 3 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte\n", - "3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [3] [P] . infra first choice i\n", - " 3 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i\n", - " 3 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i\n", - " 3 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i\n", - " False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i\n", - "False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] . swaack first choice i\n", - "3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i\n", - " 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i\n", - " 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i\n", - " 3 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons\n", - " 3 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons\n", - " 2 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons\n", - " 2 2 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons\n", - " 2 2 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons\n", - " 2 . [P] [pop []] [Ga] [dip swons] genrec 2 swons\n", - " 2 [P] . [pop []] [Ga] [dip swons] genrec 2 swons\n", - " 2 [P] [pop []] . [Ga] [dip swons] genrec 2 swons\n", - " 2 [P] [pop []] [Ga] . [dip swons] genrec 2 swons\n", - " 2 [P] [pop []] [Ga] [dip swons] . genrec 2 swons\n", - " 2 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 2 swons\n", - "2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [2] [P] . infra first choice i 2 swons\n", - " 2 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons\n", - " 2 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons\n", - " 2 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons\n", - " False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons\n", - "False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons\n", - "2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons\n", - " 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons\n", - " 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i 2 swons\n", - " 2 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons\n", - " 2 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons\n", - " 1 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons\n", - " 1 1 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons\n", - " 1 1 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons 2 swons\n", - " 1 . [P] [pop []] [Ga] [dip swons] genrec 1 swons 2 swons\n", - " 1 [P] . [pop []] [Ga] [dip swons] genrec 1 swons 2 swons\n", - " 1 [P] [pop []] . [Ga] [dip swons] genrec 1 swons 2 swons\n", - " 1 [P] [pop []] [Ga] . [dip swons] genrec 1 swons 2 swons\n", - " 1 [P] [pop []] [Ga] [dip swons] . genrec 1 swons 2 swons\n", - " 1 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons\n", - "1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [1] [P] . infra first choice i 1 swons 2 swons\n", - " 1 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons\n", - " 1 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons\n", - " 1 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons\n", - " True . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons\n", - " True [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons\n", - " 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 1 swons 2 swons\n", - " 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] True . choice i 1 swons 2 swons\n", - " 1 [pop []] . i 1 swons 2 swons\n", - " 1 . pop [] 1 swons 2 swons\n", - " . [] 1 swons 2 swons\n", - " [] . 1 swons 2 swons\n", - " [] 1 . swons 2 swons\n", - " [] 1 . swap cons 2 swons\n", - " 1 [] . cons 2 swons\n", - " [1] . 2 swons\n", - " [1] 2 . swons\n", - " [1] 2 . swap cons\n", - " 2 [1] . cons\n", - " [2 1] . \n" - ] - } - ], - "source": [ - "V('3 [P] [pop []] [Ga] [dip swons] genrec')" - ] - }, - { - "cell_type": "code", - "execution_count": 29, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [2 1] [[] =] [pop c] [uncons swap] [dip F] genrec\n", - " [2 1] . [[] =] [pop c] [uncons swap] [dip F] genrec\n", - " [2 1] [[] =] . [pop c] [uncons swap] [dip F] genrec\n", - " [2 1] [[] =] [pop c] . [uncons swap] [dip F] genrec\n", - " [2 1] [[] =] [pop c] [uncons swap] . [dip F] genrec\n", - " [2 1] [[] =] [pop c] [uncons swap] [dip F] . genrec\n", - " [2 1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte\n", - "[2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[2 1]] [[] =] . infra first choice i\n", - " [2 1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i\n", - " [2 1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i\n", - " False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i\n", - " False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] . swaack first choice i\n", - " [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i\n", - " [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i\n", - " [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i\n", - " [2 1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F\n", - " 2 [1] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F\n", - " [1] 2 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F\n", - " [1] 2 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F\n", - " [1] . [[] =] [pop c] [uncons swap] [dip F] genrec 2 F\n", - " [1] [[] =] . [pop c] [uncons swap] [dip F] genrec 2 F\n", - " [1] [[] =] [pop c] . [uncons swap] [dip F] genrec 2 F\n", - " [1] [[] =] [pop c] [uncons swap] . [dip F] genrec 2 F\n", - " [1] [[] =] [pop c] [uncons swap] [dip F] . genrec 2 F\n", - " [1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 2 F\n", - " [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[1]] [[] =] . infra first choice i 2 F\n", - " [1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F\n", - " [1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F\n", - " False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F\n", - " False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] . swaack first choice i 2 F\n", - " [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F\n", - " [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i 2 F\n", - " [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i 2 F\n", - " [1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F\n", - " 1 [] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F\n", - " [] 1 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F\n", - " [] 1 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F 2 F\n", - " [] . [[] =] [pop c] [uncons swap] [dip F] genrec 1 F 2 F\n", - " [] [[] =] . [pop c] [uncons swap] [dip F] genrec 1 F 2 F\n", - " [] [[] =] [pop c] . [uncons swap] [dip F] genrec 1 F 2 F\n", - " [] [[] =] [pop c] [uncons swap] . [dip F] genrec 1 F 2 F\n", - " [] [[] =] [pop c] [uncons swap] [dip F] . genrec 1 F 2 F\n", - " [] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 1 F 2 F\n", - " [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[]] [[] =] . infra first choice i 1 F 2 F\n", - " [] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F\n", - " [] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F\n", - " True . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F\n", - " True [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] . swaack first choice i 1 F 2 F\n", - " [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F\n", - " [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F\n", - " [] [pop c] . i 1 F 2 F\n", - " [] . pop c 1 F 2 F\n", - " . c 1 F 2 F\n", - " . 0 1 F 2 F\n", - " 0 . 1 F 2 F\n", - " 0 1 . F 2 F\n", - " 0 1 . + 2 F\n", - " 1 . 2 F\n", - " 1 2 . F\n", - " 1 2 . +\n", - " 3 . \n" - ] - } - ], - "source": [ - "V('[2 1] [[] =] [pop c ] [uncons swap] [dip F] genrec')" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Appendix - Fun with Symbols\n", - "\n", - " |[ (c, F), (G, P) ]| == (|c, F|) • [(G, P)]\n", - "\n", - "[\"Bananas, Lenses, & Barbed Wire\"](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125)\n", - "\n", - " (|...|) [(...)] [<...>]\n", - "\n", - "I think they are having slightly too much fun with the symbols.\n", - "\n", - "\"Too much is always better than not enough.\"" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "# Tree with node and list of trees.\n", - "\n", - " tree = [] | [node [tree*]]" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### `treestep`\n", - "\n", - " tree z [C] [N] treestep\n", - "\n", - "\n", - " [] z [C] [N] treestep\n", - " ---------------------------\n", - " z\n", - "\n", - "\n", - " [node [tree*]] z [C] [N] treestep\n", - " --------------------------------------- w/ K == z [C] [N] treestep\n", - " node N [tree*] [K] map C" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Derive the recursive form.\n", - " K == [not] [pop z] [J] ifte\n", - "\n", - "\n", - " [node [tree*]] J\n", - " ------------------------------\n", - " node N [tree*] [K] map C\n", - "\n", - "\n", - " J == .. [N] .. [K] .. [C] ..\n", - "\n", - " [node [tree*]] uncons [N] dip\n", - " node [[tree*]] [N] dip\n", - " node N [[tree*]]\n", - "\n", - " node N [[tree*]] i [K] map\n", - " node N [tree*] [K] map\n", - " node N [K.tree*]\n", - "\n", - " J == uncons [N] dip i [K] map [C] i\n", - "\n", - " K == [not] [pop z] [uncons [N] dip i [K] map [C] i] ifte\n", - " K == [not] [pop z] [uncons [N] dip i] [map [C] i] genrec" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Extract the givens to parameterize the program.\n", - " [not] [pop z] [uncons [N] dip unquote] [map [C] i] genrec\n", - " [not] [z] [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec\n", - " [not] z unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec\n", - " z [not] swap unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec\n", - " \\............TS0............/\n", - " z TS0 [uncons [N] dip unquote] [map [C] i] genrec\n", - " z [uncons [N] dip unquote] [TS0] dip [map [C] i] genrec\n", - " z [[N] dip unquote] [uncons] swoncat [TS0] dip [map [C] i] genrec\n", - " z [N] [dip unquote] cons [uncons] swoncat [TS0] dip [map [C] i] genrec\n", - " \\...........TS1.................../\n", - " z [N] TS1 [TS0] dip [map [C] i] genrec\n", - " z [N] [map [C] i] [TS1 [TS0] dip] dip genrec\n", - " z [N] [map C ] [TS1 [TS0] dip] dip genrec\n", - " z [N] [C] [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " z [C] [N] swap [map] swoncat [TS1 [TS0] dip] dip genrec" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " TS0 == [not] swap unit [pop] swoncat\n", - " TS1 == [dip i] cons [uncons] swoncat\n", - " treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - " [] 0 [C] [N] treestep\n", - " ---------------------------\n", - " 0\n", - "\n", - "\n", - " [n [tree*]] 0 [sum +] [] treestep\n", - " --------------------------------------------------\n", - " n [tree*] [0 [sum +] [] treestep] map sum +" - ] - }, - { - "cell_type": "code", - "execution_count": 40, - "metadata": {}, - "outputs": [], - "source": [ - "DefinitionWrapper.add_definitions('''\n", - "\n", - " TS0 == [not] swap unit [pop] swoncat\n", - " TS1 == [dip i] cons [uncons] swoncat\n", - "treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec\n", - "\n", - "''', D)" - ] - }, - { - "cell_type": "code", - "execution_count": 31, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [] 0 [sum +] [] treestep\n", - " [] . 0 [sum +] [] treestep\n", - " [] 0 . [sum +] [] treestep\n", - " [] 0 [sum +] . [] treestep\n", - " [] 0 [sum +] [] . treestep\n", - " [] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " [] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " [] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec\n", - " [] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec\n", - " [] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec\n", - " [] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec\n", - " [] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec\n", - " [] 0 [] . TS1 [TS0] dip [map sum +] genrec\n", - " [] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec\n", - " [] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec\n", - " [] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec\n", - " [] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec\n", - " [] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec\n", - " [] 0 . TS0 [uncons [] dip i] [map sum +] genrec\n", - " [] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec\n", - " [] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec\n", - " [] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec\n", - " [] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec\n", - " [] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte\n", - "[] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[]] [not] . infra first choice i\n", - " [] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i\n", - " True . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i\n", - " True [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] . swaack first choice i\n", - " [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [True] . first choice i\n", - " [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] True . choice i\n", - " [] [pop 0] . i\n", - " [] . pop 0\n", - " . 0\n", - " 0 . \n" - ] - } - ], - "source": [ - "V('[] 0 [sum +] [] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 32, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [23 []] 0 [sum +] [] treestep\n", - " [23 []] . 0 [sum +] [] treestep\n", - " [23 []] 0 . [sum +] [] treestep\n", - " [23 []] 0 [sum +] . [] treestep\n", - " [23 []] 0 [sum +] [] . treestep\n", - " [23 []] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " [23 []] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " [23 []] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec\n", - " [23 []] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec\n", - " [23 []] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec\n", - " [23 []] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec\n", - " [23 []] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec\n", - " [23 []] 0 [] . TS1 [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec\n", - " [23 []] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec\n", - " [23 []] 0 . TS0 [uncons [] dip i] [map sum +] genrec\n", - " [23 []] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec\n", - " [23 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec\n", - " [23 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec\n", - " [23 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte\n", - "[23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 []]] [not] . infra first choice i\n", - " [23 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i\n", - " False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i\n", - " False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] . swaack first choice i\n", - " [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i\n", - " [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i\n", - " [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i\n", - " [23 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum +\n", - " 23 [] . sum +\n", - " 23 [] . 0 [+] catamorphism +\n", - " 23 [] 0 . [+] catamorphism +\n", - " 23 [] 0 [+] . catamorphism +\n", - " 23 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism +\n", - " 23 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism +\n", - " 23 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism +\n", - " 23 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism +\n", - " 23 [] [[] =] 0 [uncons swap] [+] . hylomorphism +\n", - " 23 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec +\n", - " 23 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec +\n", - " 23 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec +\n", - " 23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte +\n", - " 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i +\n", - " 23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i +\n", - " 23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i +\n", - " 23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i +\n", - " 23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i +\n", - " 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i +\n", - " 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i +\n", - " 23 [] [pop 0] . i +\n", - " 23 [] . pop 0 +\n", - " 23 . 0 +\n", - " 23 0 . +\n", - " 23 . \n" - ] - } - ], - "source": [ - "V('[23 []] 0 [sum +] [] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 33, - "metadata": { - "collapsed": true - }, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - " . [23 [[2 []] [3 []]]] 0 [sum +] [] treestep\n", - " [23 [[2 []] [3 []]]] . 0 [sum +] [] treestep\n", - " [23 [[2 []] [3 []]]] 0 . [sum +] [] treestep\n", - " [23 [[2 []] [3 []]]] 0 [sum +] . [] treestep\n", - " [23 [[2 []] [3 []]]] 0 [sum +] [] . treestep\n", - " [23 [[2 []] [3 []]]] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec\n", - " [23 [[2 []] [3 []]]] 0 [] . TS1 [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 . TS0 [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec\n", - " [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec\n", - " [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte\n", - " [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 [[2 []] [3 []]]]] [not] . infra first choice i\n", - " [23 [[2 []] [3 []]]] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i\n", - " False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i\n", - " False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] . swaack first choice i\n", - " [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i\n", - " [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i\n", - " [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i\n", - " [23 [[2 []] [3 []]]] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[[2 []] [3 []]]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[[2 []] [3 []]]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 . [[[2 []] [3 []]]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[[2 []] [3 []]]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 . [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[2 []] [3 []]] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +\n", - " 23 [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum +\n", - "23 [] [[[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first] . infra sum +\n", - " . [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " [[3 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[3 []] 23] [not] . infra first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] . swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 [3 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] . sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] . 0 [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] 0 . [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] 0 [+] . catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 3 23] [[] =] . infra first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] . swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 3 23] . first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] [pop 0] . i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] . pop 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 . 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 0 . + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 . [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 23 3 [] . swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " [3 23] . first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 3 . [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 3 [[2 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum +\n", - " 3 [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [23] swaack sum +\n", - " 23 [2 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[2 []] 23] [not] . infra first choice i [3] swaack first [23] swaack sum +\n", - " 23 [2 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum +\n", - " 23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum +\n", - " 23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] . swaack first choice i [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [3] swaack first [23] swaack sum +\n", - " 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [3] swaack first [23] swaack sum +\n", - " 23 [2 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [] . sum + [3] swaack first [23] swaack sum +\n", - " 23 2 [] . 0 [+] catamorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] 0 . [+] catamorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] 0 [+] . catamorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 2 23] [[] =] . infra first choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] . swaack first choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 2 23] . first choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [3] swaack first [23] swaack sum +\n", - " 23 2 [] [pop 0] . i + [3] swaack first [23] swaack sum +\n", - " 23 2 [] . pop 0 + [3] swaack first [23] swaack sum +\n", - " 23 2 . 0 + [3] swaack first [23] swaack sum +\n", - " 23 2 0 . + [3] swaack first [23] swaack sum +\n", - " 23 2 . [3] swaack first [23] swaack sum +\n", - " 23 2 [3] . swaack first [23] swaack sum +\n", - " 3 [2 23] . first [23] swaack sum +\n", - " 3 2 . [23] swaack sum +\n", - " 3 2 [23] . swaack sum +\n", - " 23 [2 3] . sum +\n", - " 23 [2 3] . 0 [+] catamorphism +\n", - " 23 [2 3] 0 . [+] catamorphism +\n", - " 23 [2 3] 0 [+] . catamorphism +\n", - " 23 [2 3] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism +\n", - " 23 [2 3] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism +\n", - " 23 [2 3] [[] =] 0 [+] . [uncons swap] swap hylomorphism +\n", - " 23 [2 3] [[] =] 0 [+] [uncons swap] . swap hylomorphism +\n", - " 23 [2 3] [[] =] 0 [uncons swap] [+] . hylomorphism +\n", - " 23 [2 3] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap] [dip +] . genrec +\n", - " 23 [2 3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte +\n", - " 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 3] 23] [[] =] . infra first choice i +\n", - " 23 [2 3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i +\n", - " 23 [2 3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i +\n", - " 23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i +\n", - " 23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] . swaack first choice i +\n", - " 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i +\n", - " 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i +\n", - " 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i +\n", - " 23 [2 3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + +\n", - " 23 2 [3] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + +\n", - " 23 [3] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + +\n", - " 23 [3] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + +\n", - " 23 [3] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + +\n", - " 23 [3] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + +\n", - " 23 [3] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + +\n", - " 23 [3] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + +\n", - " 23 [3] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + +\n", - " 23 [3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + +\n", - " 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3] 23] [[] =] . infra first choice i 2 + +\n", - " 23 [3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + +\n", - " 23 [3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + +\n", - " 23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + +\n", - " 23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] . swaack first choice i 2 + +\n", - " 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i 2 + +\n", - " 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + +\n", - " 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + +\n", - " 23 [3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + +\n", - " 23 3 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + +\n", - " 23 [] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + +\n", - " 23 [] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + +\n", - " 23 [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 2 + +\n", - " 23 [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 2 + +\n", - " 23 [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 2 + +\n", - " 23 [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 2 + +\n", - " 23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 2 + +\n", - " 23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 2 + +\n", - " 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i 3 + 2 + +\n", - " 23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + +\n", - " 23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + +\n", - " 23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + +\n", - " 23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i 3 + 2 + +\n", - " 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i 3 + 2 + +\n", - " 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 3 + 2 + +\n", - " 23 [] [pop 0] . i 3 + 2 + +\n", - " 23 [] . pop 0 3 + 2 + +\n", - " 23 . 0 3 + 2 + +\n", - " 23 0 . 3 + 2 + +\n", - " 23 0 3 . + 2 + +\n", - " 23 3 . 2 + +\n", - " 23 3 2 . + +\n", - " 23 5 . +\n", - " 28 . \n" - ] - } - ], - "source": [ - "V('[23 [[2 []] [3 []]]] 0 [sum +] [] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 34, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "140\n" - ] - } - ], - "source": [ - "J('[23 [[2 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]] [3 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]]]] 0 [sum +] [] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - }, - { - "cell_type": "code", - "execution_count": 35, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[]\n" - ] - } - ], - "source": [ - "J('[] [] [unit cons] [23 +] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 36, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[46 []]\n" - ] - } - ], - "source": [ - "J('[23 []] [] [unit cons] [23 +] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 37, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[46 [[25 []] [26 []]]]\n" - ] - } - ], - "source": [ - "J('[23 [[2 []] [3 []]]] [] [unit cons] [23 +] treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 38, - "metadata": {}, - "outputs": [], - "source": [ - "define('treemap == [] [unit cons] roll< treestep')" - ] - }, - { - "cell_type": "code", - "execution_count": 39, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[46 [[25 []] [26 []]]]\n" - ] - } - ], - "source": [ - "J('[23 [[2 []] [3 []]]] [23 +] treemap')" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - } - ], - "metadata": { - "kernelspec": { - "display_name": "Python 2", - "language": "python", - "name": "python2" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 2 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.12" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.md b/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.md deleted file mode 100644 index dfb43dc..0000000 --- a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.md +++ /dev/null @@ -1,2449 +0,0 @@ - -Cf. ["Bananas, Lenses, & Barbed Wire"](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125) - -# [Hylomorphism](https://en.wikipedia.org/wiki/Hylomorphism_%28computer_science%29) -A [hylomorphism](https://en.wikipedia.org/wiki/Hylomorphism_%28computer_science%29) `H :: A -> B` converts a value of type A into a value of type B by means of: - -- A generator `G :: A -> (A, B)` -- A combiner `F :: (B, B) -> B` -- A predicate `P :: A -> Bool` to detect the base case -- A base case value `c :: B` -- Recursive calls (zero or more); it has a "call stack in the form of a cons list". - -It may be helpful to see this function implemented in imperative Python code. - - -```python -def hylomorphism(c, F, P, G): - '''Return a hylomorphism function H.''' - - def H(a): - if P(a): - result = c - else: - b, aa = G(a) - result = F(b, H(aa)) - return result - - return H -``` - -### Finding [Triangular Numbers](https://en.wikipedia.org/wiki/Triangular_number) -As a concrete example let's use a function that, given a positive integer, returns the sum of all positive integers less than that one. (In this case the types A and B are both `int`.) -### With `range()` and `sum()` - - -```python -r = range(10) -r -``` - - - - - [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] - - - - -```python -sum(r) -``` - - - - - 45 - - - - -```python -range_sum = lambda n: sum(range(n)) -range_sum(10) -``` - - - - - 45 - - - -### As a hylomorphism - - -```python -G = lambda n: (n - 1, n - 1) -F = lambda a, b: a + b -P = lambda n: n <= 1 - -H = hylomorphism(0, F, P, G) -``` - - -```python -H(10) -``` - - - - - 45 - - - -If you were to run the above code in a debugger and check out the call stack you would find that the variable `b` in each call to `H()` is storing the intermediate values as `H()` recurses. This is what was meant by "call stack in the form of a cons list". - -### Joy Preamble - - -```python -from notebook_preamble import D, DefinitionWrapper, J, V, define -``` - -## Hylomorphism in Joy -We can define a combinator `hylomorphism` that will make a hylomorphism combinator `H` from constituent parts. - - H == c [F] [P] [G] hylomorphism - -The function `H` is recursive, so we start with `ifte` and set the else-part to -some function `J` that will contain a quoted copy of `H`. (The then-part just -discards the leftover `a` and replaces it with the base case value `c`.) - - H == [P] [pop c] [J] ifte - -The else-part `J` gets just the argument `a` on the stack. - - a J - a G The first thing to do is use the generator G - aa b which produces b and a new aa - aa b [H] dip we recur with H on the new aa - aa H b F and run F on the result. - -This gives us a definition for `J`. - - J == G [H] dip F - -Plug it in and convert to genrec. - - H == [P] [pop c] [G [H] dip F] ifte - H == [P] [pop c] [G] [dip F] genrec - -This is the form of a hylomorphism in Joy, which nicely illustrates that -it is a simple specialization of the general recursion combinator. - - H == [P] [pop c] [G] [dip F] genrec - -## Derivation of `hylomorphism` - -Now we just need to derive a definition that builds the `genrec` arguments -out of the pieces given to the `hylomorphism` combinator. - - H == [P] [pop c] [G] [dip F] genrec - [P] [c] [pop] swoncat [G] [F] [dip] swoncat genrec - [P] c unit [pop] swoncat [G] [F] [dip] swoncat genrec - [P] c [G] [F] [unit [pop] swoncat] dipd [dip] swoncat genrec - -Working in reverse: -- Use `swoncat` twice to decouple `[c]` and `[F]`. -- Use `unit` to dequote `c`. -- Use `dipd` to untangle `[unit [pop] swoncat]` from the givens. - -At this point all of the arguments (givens) to the hylomorphism are to the left so we have -a definition for `hylomorphism`: - - hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec - -The order of parameters is different than the one we started with but -that hardly matters, you can rearrange them or just supply them in the -expected order. - - [P] c [G] [F] hylomorphism == H - - - - -```python -define('hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec') -``` - -Demonstrate summing a range of integers from 0 to n-1. - -- `[P]` is `[0 <=]` -- `c` is `0` -- `[G]` is `[1 - dup]` -- `[F]` is `[+]` - -So to sum the positive integers less than five we can do this. - - -```python -V('5 [0 <=] 0 [1 - dup] [+] hylomorphism') -``` - - . 5 [0 <=] 0 [1 - dup] [+] hylomorphism - 5 . [0 <=] 0 [1 - dup] [+] hylomorphism - 5 [0 <=] . 0 [1 - dup] [+] hylomorphism - 5 [0 <=] 0 . [1 - dup] [+] hylomorphism - 5 [0 <=] 0 [1 - dup] . [+] hylomorphism - 5 [0 <=] 0 [1 - dup] [+] . hylomorphism - 5 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec - 5 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec - 5 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec - 5 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec - 5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec - 5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i - 5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i - 5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i - 5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + - 4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 + - 4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 + - 4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 + - 4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 + - 4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 + - 4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 + - 4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + - 4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 + - 4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 + - 3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 + - 3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 + - 3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 + - 3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 + - 3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 + - 3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 + - 3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + - 3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 + - 3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 + - 2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 + - 2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + - 2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 + - 2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 + - 1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 + - 1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + - 1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + - 1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + - 0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 + - 0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + - 0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + - True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + - True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + - 0 [pop 0] . i 0 + 1 + 2 + 3 + 4 + - 0 . pop 0 0 + 1 + 2 + 3 + 4 + - . 0 0 + 1 + 2 + 3 + 4 + - 0 . 0 + 1 + 2 + 3 + 4 + - 0 0 . + 1 + 2 + 3 + 4 + - 0 . 1 + 2 + 3 + 4 + - 0 1 . + 2 + 3 + 4 + - 1 . 2 + 3 + 4 + - 1 2 . + 3 + 4 + - 3 . 3 + 4 + - 3 3 . + 4 + - 6 . 4 + - 6 4 . + - 10 . - - -# Anamorphism -An anamorphism can be defined as a hylomorphism that uses `[]` for `c` and -`swons` for `F`. - - [P] [G] anamorphism == [P] [] [G] [swons] hylomorphism == A - -This allows us to define an anamorphism combinator in terms of -the hylomorphism combinator. - - [] swap [swons] hylomorphism == anamorphism - -Partial evaluation gives us a "pre-cooked" form. - - [P] [G] . anamorphism - [P] [G] . [] swap [swons] hylomorphism - [P] [G] [] . swap [swons] hylomorphism - [P] [] [G] . [swons] hylomorphism - [P] [] [G] [swons] . hylomorphism - [P] [] [G] [swons] . [unit [pop] swoncat] dipd [dip] swoncat genrec - [P] [] [G] [swons] [unit [pop] swoncat] . dipd [dip] swoncat genrec - [P] [] . unit [pop] swoncat [G] [swons] [dip] swoncat genrec - [P] [[]] [pop] . swoncat [G] [swons] [dip] swoncat genrec - [P] [pop []] [G] [swons] [dip] . swoncat genrec - - [P] [pop []] [G] [dip swons] genrec - -(We could also have just substituted for `c` and `F` in the definition of `H`.) - - H == [P] [pop c ] [G] [dip F ] genrec - A == [P] [pop []] [G] [dip swons] genrec - -The partial evaluation is overkill in this case but it serves as a -reminder that this sort of program specialization can, in many cases, be -carried out automatically.) - -Untangle `[G]` from `[pop []]` using `swap`. - - [P] [G] [pop []] swap [dip swons] genrec - -All of the arguments to `anamorphism` are to the left, so we have a definition for it. - - anamorphism == [pop []] swap [dip swons] genrec - -An example of an anamorphism is the range function. - - range == [0 <=] [1 - dup] anamorphism - - -# Catamorphism -A catamorphism can be defined as a hylomorphism that uses `[uncons swap]` for `[G]` -and `[[] =]` for the predicate `[P]`. - - c [F] catamorphism == [[] =] c [uncons swap] [F] hylomorphism == C - -This allows us to define a `catamorphism` combinator in terms of -the `hylomorphism` combinator. - - [[] =] roll> [uncons swap] swap hylomorphism == catamorphism - -Partial evaluation doesn't help much. - - c [F] . catamorphism - c [F] . [[] =] roll> [uncons swap] swap hylomorphism - c [F] [[] =] . roll> [uncons swap] swap hylomorphism - [[] =] c [F] [uncons swap] . swap hylomorphism - [[] =] c [uncons swap] [F] . hylomorphism - [[] =] c [uncons swap] [F] [unit [pop] swoncat] . dipd [dip] swoncat genrec - [[] =] c . unit [pop] swoncat [uncons swap] [F] [dip] swoncat genrec - [[] =] [c] [pop] . swoncat [uncons swap] [F] [dip] swoncat genrec - [[] =] [pop c] [uncons swap] [F] [dip] . swoncat genrec - [[] =] [pop c] [uncons swap] [dip F] genrec - -Because the arguments to catamorphism have to be prepared (unlike the arguments -to anamorphism, which only need to be rearranged slightly) there isn't much point -to "pre-cooking" the definition. - - catamorphism == [[] =] roll> [uncons swap] swap hylomorphism - -An example of a catamorphism is the sum function. - - sum == 0 [+] catamorphism - -### "Fusion Law" for catas (UNFINISHED!!!) - -I'm not sure exactly how to translate the "Fusion Law" for catamorphisms into Joy. - -I know that a `map` composed with a cata can be expressed as a new cata: - - [F] map b [B] cata == b [F B] cata - -But this isn't the one described in "Bananas...". That's more like: - -A cata composed with some function can be expressed as some other cata: - - b [B] catamorphism F == c [C] catamorphism - -Given: - - b F == c - - ... - - B F == [F] dip C - - ... - - b[B]cata F == c[C]cata - - F(B(head, tail)) == C(head, F(tail)) - - 1 [2 3] B F 1 [2 3] F C - - - b F == c - B F == F C - - b [B] catamorphism F == c [C] catamorphism - b [B] catamorphism F == b F [C] catamorphism - - ... - -Or maybe, - - [F] map b [B] cata == c [C] cata ??? - - [F] map b [B] cata == b [F B] cata I think this is generally true, unless F consumes stack items - instead of just transforming TOS. Of course, there's always [F] unary. - b [F] unary [[F] unary B] cata - - [10 *] map 0 swap [+] step == 0 swap [10 * +] step - - -For example: - - F == 10 * - b == 0 - B == + - c == 0 - C == F + - - b F == c - 0 10 * == 0 - - B F == [F] dip C - + 10 * == [10 *] dip F + - + 10 * == [10 *] dip 10 * + - - n m + 10 * == 10(n+m) - - n m [10 *] dip 10 * + - n 10 * m 10 * + - 10n m 10 * + - 10n 10m + - 10n+10m - - 10n+10m = 10(n+m) - -Ergo: - - 0 [+] catamorphism 10 * == 0 [10 * +] catamorphism - -## The `step` combinator will usually be better to use than `catamorphism`. - - sum == 0 swap [+] step - sum == 0 [+] catamorphism - -# anamorphism catamorphism == hylomorphism -Here is (part of) the payoff. - -An anamorphism followed by (composed with) a -catamorphism is a hylomorphism, with the advantage that the hylomorphism -does not create the intermediate list structure. The values are stored in -either the call stack, for those implementations that use one, or in the pending -expression ("continuation") for the Joypy interpreter. They still have to -be somewhere, converting from an anamorphism and catamorphism to a hylomorphism -just prevents using additional storage and doing additional processing. - - range == [0 <=] [1 - dup] anamorphism - sum == 0 [+] catamorphism - - range sum == [0 <=] [1 - dup] anamorphism 0 [+] catamorphism - == [0 <=] 0 [1 - dup] [+] hylomorphism - -We can let the `hylomorphism` combinator build `range_sum` for us or just -substitute ourselves. - - H == [P] [pop c] [G] [dip F] genrec - range_sum == [0 <=] [pop 0] [1 - dup] [dip +] genrec - - - -```python -defs = ''' -anamorphism == [pop []] swap [dip swons] genrec -hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec -catamorphism == [[] =] roll> [uncons swap] swap hylomorphism -range == [0 <=] [1 - dup] anamorphism -sum == 0 [+] catamorphism -range_sum == [0 <=] 0 [1 - dup] [+] hylomorphism -''' - -DefinitionWrapper.add_definitions(defs, D) -``` - - -```python -J('10 range') -``` - - [9 8 7 6 5 4 3 2 1 0] - - - -```python -J('[9 8 7 6 5 4 3 2 1 0] sum') -``` - - 45 - - - -```python -V('10 range sum') -``` - - . 10 range sum - 10 . range sum - 10 . [0 <=] [1 - dup] anamorphism sum - 10 [0 <=] . [1 - dup] anamorphism sum - 10 [0 <=] [1 - dup] . anamorphism sum - 10 [0 <=] [1 - dup] . [pop []] swap [dip swons] genrec sum - 10 [0 <=] [1 - dup] [pop []] . swap [dip swons] genrec sum - 10 [0 <=] [pop []] [1 - dup] . [dip swons] genrec sum - 10 [0 <=] [pop []] [1 - dup] [dip swons] . genrec sum - 10 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [10] [0 <=] . infra first choice i sum - 10 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum - 10 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] . swaack first choice i sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i sum - 10 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 10 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 9 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 9 9 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 9 9 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons sum - 9 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 9 swons sum - 9 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 9 swons sum - 9 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 9 swons sum - 9 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 9 swons sum - 9 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 9 swons sum - 9 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [9] [0 <=] . infra first choice i 9 swons sum - 9 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum - 9 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] . swaack first choice i 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 9 swons sum - 9 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 9 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 8 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 8 8 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 8 8 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 9 swons sum - 8 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [8] [0 <=] . infra first choice i 8 swons 9 swons sum - 8 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum - 8 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] . swaack first choice i 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 8 swons 9 swons sum - 8 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 8 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 7 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 7 7 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 7 7 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 8 swons 9 swons sum - 7 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [7] [0 <=] . infra first choice i 7 swons 8 swons 9 swons sum - 7 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum - 7 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] . swaack first choice i 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 7 swons 8 swons 9 swons sum - 7 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 7 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 6 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 6 6 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 6 6 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 7 swons 8 swons 9 swons sum - 6 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [6] [0 <=] . infra first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] . swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 6 swons 7 swons 8 swons 9 swons sum - 6 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 6 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 5 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 5 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [5] [0 <=] . infra first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] . swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 4 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 4 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [4] [0 <=] . infra first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] . swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 3 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 3 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [3] [0 <=] . infra first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] . swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 2 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 2 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [2] [0 <=] . infra first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 1 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 1 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [1] [0 <=] . infra first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 0 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 0 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [0] [0 <=] . infra first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - True . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - True [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] . swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] True . choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [pop []] . i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . pop [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - . [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [] . 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [] 0 . swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [] 0 . swap cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [] . cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [0] . 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [0] 1 . swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [0] 1 . swap cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0] . cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [1 0] . 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [1 0] 2 . swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [1 0] 2 . swap cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 0] . cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [2 1 0] . 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [2 1 0] 3 . swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [2 1 0] 3 . swap cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [2 1 0] . cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [3 2 1 0] . 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [3 2 1 0] 4 . swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [3 2 1 0] 4 . swap cons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [3 2 1 0] . cons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [4 3 2 1 0] . 5 swons 6 swons 7 swons 8 swons 9 swons sum - [4 3 2 1 0] 5 . swons 6 swons 7 swons 8 swons 9 swons sum - [4 3 2 1 0] 5 . swap cons 6 swons 7 swons 8 swons 9 swons sum - 5 [4 3 2 1 0] . cons 6 swons 7 swons 8 swons 9 swons sum - [5 4 3 2 1 0] . 6 swons 7 swons 8 swons 9 swons sum - [5 4 3 2 1 0] 6 . swons 7 swons 8 swons 9 swons sum - [5 4 3 2 1 0] 6 . swap cons 7 swons 8 swons 9 swons sum - 6 [5 4 3 2 1 0] . cons 7 swons 8 swons 9 swons sum - [6 5 4 3 2 1 0] . 7 swons 8 swons 9 swons sum - [6 5 4 3 2 1 0] 7 . swons 8 swons 9 swons sum - [6 5 4 3 2 1 0] 7 . swap cons 8 swons 9 swons sum - 7 [6 5 4 3 2 1 0] . cons 8 swons 9 swons sum - [7 6 5 4 3 2 1 0] . 8 swons 9 swons sum - [7 6 5 4 3 2 1 0] 8 . swons 9 swons sum - [7 6 5 4 3 2 1 0] 8 . swap cons 9 swons sum - 8 [7 6 5 4 3 2 1 0] . cons 9 swons sum - [8 7 6 5 4 3 2 1 0] . 9 swons sum - [8 7 6 5 4 3 2 1 0] 9 . swons sum - [8 7 6 5 4 3 2 1 0] 9 . swap cons sum - 9 [8 7 6 5 4 3 2 1 0] . cons sum - [9 8 7 6 5 4 3 2 1 0] . sum - [9 8 7 6 5 4 3 2 1 0] . 0 [+] catamorphism - [9 8 7 6 5 4 3 2 1 0] 0 . [+] catamorphism - [9 8 7 6 5 4 3 2 1 0] 0 [+] . catamorphism - [9 8 7 6 5 4 3 2 1 0] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] . [uncons swap] swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] [uncons swap] . swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[9 8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i - [9 8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i - [9 8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] . swaack first choice i - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i - [9 8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + - 9 [8 7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + - [8 7 6 5 4 3 2 1 0] 9 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + - [8 7 6 5 4 3 2 1 0] 9 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + - [8 7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 9 + - [8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 + - [8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] . swaack first choice i 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 9 + - [8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 + - 8 [7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 + - [7 6 5 4 3 2 1 0] 8 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 + - [7 6 5 4 3 2 1 0] 8 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 9 + - [7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] . swaack first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 8 + 9 + - [7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 + - 7 [6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 + - [6 5 4 3 2 1 0] 7 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 + - [6 5 4 3 2 1 0] 7 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 8 + 9 + - [6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[6 5 4 3 2 1 0]] [[] =] . infra first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] . swaack first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 7 + 8 + 9 + - [6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 + - 6 [5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 + - [5 4 3 2 1 0] 6 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 + - [5 4 3 2 1 0] 6 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 7 + 8 + 9 + - [5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[5 4 3 2 1 0]] [[] =] . infra first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] . swaack first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 [4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - [4 3 2 1 0] 5 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - [4 3 2 1 0] 5 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 6 + 7 + 8 + 9 + - [4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[4 3 2 1 0]] [[] =] . infra first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] . swaack first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 [3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] 4 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] 4 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3 2 1 0]] [[] =] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 1 0]] [[] =] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[1 0]] [[] =] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] 1 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] 1 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[0]] [[] =] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] 0 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] 0 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[]] [[] =] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 . + 4 + 5 + 6 + 7 + 8 + 9 + - 6 . 4 + 5 + 6 + 7 + 8 + 9 + - 6 4 . + 5 + 6 + 7 + 8 + 9 + - 10 . 5 + 6 + 7 + 8 + 9 + - 10 5 . + 6 + 7 + 8 + 9 + - 15 . 6 + 7 + 8 + 9 + - 15 6 . + 7 + 8 + 9 + - 21 . 7 + 8 + 9 + - 21 7 . + 8 + 9 + - 28 . 8 + 9 + - 28 8 . + 9 + - 36 . 9 + - 36 9 . + - 45 . - - - -```python -V('10 range_sum') -``` - - . 10 range_sum - 10 . range_sum - 10 . [0 <=] 0 [1 - dup] [+] hylomorphism - 10 [0 <=] . 0 [1 - dup] [+] hylomorphism - 10 [0 <=] 0 . [1 - dup] [+] hylomorphism - 10 [0 <=] 0 [1 - dup] . [+] hylomorphism - 10 [0 <=] 0 [1 - dup] [+] . hylomorphism - 10 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec - 10 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec - 10 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec - 10 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec - 10 [0 <=] [pop 0] [1 - dup] [dip +] . genrec - 10 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [10] [0 <=] . infra first choice i - 10 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i - 10 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] . swaack first choice i - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i - 10 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 10 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 9 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 9 9 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 9 9 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + - 9 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 9 + - 9 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 9 + - 9 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 9 + - 9 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 9 + - 9 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 9 + - 9 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [9] [0 <=] . infra first choice i 9 + - 9 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 + - 9 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] . swaack first choice i 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 9 + - 9 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 9 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 8 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 8 8 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 8 8 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 9 + - 8 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 8 + 9 + - 8 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 8 + 9 + - 8 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 8 + 9 + - 8 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 8 + 9 + - 8 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 8 + 9 + - 8 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [8] [0 <=] . infra first choice i 8 + 9 + - 8 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 + - 8 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] . swaack first choice i 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 8 + 9 + - 8 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 8 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 7 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 7 7 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 7 7 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 8 + 9 + - 7 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [7] [0 <=] . infra first choice i 7 + 8 + 9 + - 7 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 + - 7 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] . swaack first choice i 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 7 + 8 + 9 + - 7 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 7 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 6 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 6 6 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 6 6 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 7 + 8 + 9 + - 6 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [6] [0 <=] . infra first choice i 6 + 7 + 8 + 9 + - 6 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 + - 6 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] . swaack first choice i 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 + - 6 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 6 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 5 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 5 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 6 + 7 + 8 + 9 + - 5 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i 5 + 6 + 7 + 8 + 9 + - 5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 + - 5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 + - 5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 + - 4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 + - 4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 . + 4 + 5 + 6 + 7 + 8 + 9 + - 6 . 4 + 5 + 6 + 7 + 8 + 9 + - 6 4 . + 5 + 6 + 7 + 8 + 9 + - 10 . 5 + 6 + 7 + 8 + 9 + - 10 5 . + 6 + 7 + 8 + 9 + - 15 . 6 + 7 + 8 + 9 + - 15 6 . + 7 + 8 + 9 + - 21 . 7 + 8 + 9 + - 21 7 . + 8 + 9 + - 28 . 8 + 9 + - 28 8 . + 9 + - 36 . 9 + - 36 9 . + - 45 . - - -# Factorial Function and Paramorphisms -A paramorphism `P :: B -> A` is a recursion combinator that uses `dup` on intermediate values. - - n swap [P] [pop] [[F] dupdip G] primrec - -With -- `n :: A` is the "identity" for `F` (like 1 for multiplication, 0 for addition) -- `F :: (A, B) -> A` -- `G :: B -> B` generates the next `B` value. -- and lastly `P :: B -> Bool` detects the end of the series. - -For Factorial function (types `A` and `B` are both integer): - - n == 1 - F == * - G == -- - P == 1 <= - - -```python -define('factorial == 1 swap [1 <=] [pop] [[*] dupdip --] primrec') -``` - -Try it with input 3 (omitting evaluation of predicate): - - 3 1 swap [1 <=] [pop] [[*] dupdip --] primrec - 1 3 [1 <=] [pop] [[*] dupdip --] primrec - - 1 3 [*] dupdip -- - 1 3 * 3 -- - 3 3 -- - 3 2 - - 3 2 [*] dupdip -- - 3 2 * 2 -- - 6 2 -- - 6 1 - - 6 1 [1 <=] [pop] [[*] dupdip --] primrec - - 6 1 pop - 6 - - -```python -J('3 factorial') -``` - - 6 - - -### Derive `paramorphism` from the form above. - - n swap [P] [pop] [[F] dupdip G] primrec - - n swap [P] [pop] [[F] dupdip G] primrec - n [P] [swap] dip [pop] [[F] dupdip G] primrec - n [P] [[F] dupdip G] [[swap] dip [pop]] dip primrec - n [P] [F] [dupdip G] cons [[swap] dip [pop]] dip primrec - n [P] [F] [G] [dupdip] swoncat cons [[swap] dip [pop]] dip primrec - - paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec - - -```python -define('paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec') -define('factorial == 1 [1 <=] [*] [--] paramorphism') -``` - - -```python -J('3 factorial') -``` - - 6 - - -# `tails` -An example of a paramorphism for lists given in the ["Bananas..." paper](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125) is `tails` which returns the list of "tails" of a list. - - [1 2 3] tails == [[] [3] [2 3]] - -Using `paramorphism` we would write: - - n == [] - F == rest swons - G == rest - P == not - - tails == [] [not] [rest swons] [rest] paramorphism - - -```python -define('tails == [] [not] [rest swons] [rest] paramorphism') -``` - - -```python -J('[1 2 3] tails') -``` - - [[] [3] [2 3]] - - - -```python -J('25 range tails [popop] infra [sum] map') -``` - - [1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276] - - - -```python -J('25 range [range_sum] map') -``` - - [276 253 231 210 190 171 153 136 120 105 91 78 66 55 45 36 28 21 15 10 6 3 1 0 0] - - -### Factoring `rest` -Right before the recursion begins we have: - - [] [1 2 3] [not] [pop] [[rest swons] dupdip rest] primrec - -But we might prefer to factor `rest` in the quote: - - [] [1 2 3] [not] [pop] [rest [swons] dupdip] primrec - -There's no way to do that with the `paramorphism` combinator as defined. We would have to write and use a slightly different recursion combinator that accepted an additional "preprocessor" function `[H]` and built: - - n swap [P] [pop] [H [F] dupdip G] primrec - -Or just write it out manually. This is yet another place where the *sufficiently smart compiler* will one day automatically refactor the code. We could write a `paramorphism` combinator that checked `[F]` and `[G]` for common prefix and extracted it. - -# Patterns of Recursion -Our story so far... - -- A combiner `F :: (B, B) -> B` -- A predicate `P :: A -> Bool` to detect the base case -- A base case value `c :: B` - - -### Hylo-, Ana-, Cata- - - w/ G :: A -> (A, B) - - H == [P ] [pop c ] [G ] [dip F ] genrec - A == [P ] [pop []] [G ] [dip swons] genrec - C == [[] =] [pop c ] [uncons swap] [dip F ] genrec - -### Para-, ?-, ?- - - w/ G :: B -> B - - P == c swap [P ] [pop] [[F ] dupdip G ] primrec - ? == [] swap [P ] [pop] [[swons] dupdip G ] primrec - ? == c swap [[] =] [pop] [[F ] dupdip uncons swap] primrec - - -# Four Generalizations -There are at least four kinds of recursive combinator, depending on two choices. The first choice is whether the combiner function should be evaluated during the recursion or pushed into the pending expression to be "collapsed" at the end. The second choice is whether the combiner needs to operate on the current value of the datastructure or the generator's output. - - H == [P] [pop c] [G ] [dip F] genrec - H == c swap [P] [pop] [G [F] dip ] [i] genrec - H == [P] [pop c] [ [G] dupdip ] [dip F] genrec - H == c swap [P] [pop] [ [F] dupdip G] [i] genrec - -Consider: - - ... a G [H] dip F w/ a G == a' b - ... c a G [F] dip H a G == b a' - ... a [G] dupdip [H] dip F a G == a' - ... c a [F] dupdip G H a G == a' - -### 1 - - H == [P] [pop c] [G] [dip F] genrec - -Iterate n times. - - ... a [P] [pop c] [G] [dip F] genrec - ... a G [H] dip F - ... a' b [H] dip F - ... a' H b F - ... a' G [H] dip F b F - ... a'' b [H] dip F b F - ... a'' H b F b F - ... a'' G [H] dip F b F b F - ... a''' b [H] dip F b F b F - ... a''' H b F b F b F - ... a''' pop c b F b F b F - ... c b F b F b F - -This form builds up a continuation that contains the intermediate results along with the pending combiner functions. When the base case is reached the last term is replaced by the identity value c and the continuation "collapses" into the final result. - -### 2 -When you can start with the identity value c on the stack and the combiner can operate as you go, using the intermediate results immediately rather than queuing them up, use this form. An important difference is that the generator function must return its results in the reverse order. - - H == c swap [P] [pop] [G [F] dip] primrec - - ... c a G [F] dip H - ... c b a' [F] dip H - ... c b F a' H - ... c b F a' G [F] dip H - ... c b F b a'' [F] dip H - ... c b F b F a'' H - ... c b F b F a'' G [F] dip H - ... c b F b F b a''' [F] dip H - ... c b F b F b F a''' H - ... c b F b F b F a''' pop - ... c b F b F b F - -The end line here is the same as for above, but only because we didn't evaluate `F` when it normally would have been. - -### 3 -If the combiner and the generator both need to work on the current value then `dup` must be used at some point, and the generator must produce one item instead of two (the b is instead the duplicate of a.) - - - H == [P] [pop c] [[G] dupdip] [dip F] genrec - - ... a [G] dupdip [H] dip F - ... a G a [H] dip F - ... a' a [H] dip F - ... a' H a F - ... a' [G] dupdip [H] dip F a F - ... a' G a' [H] dip F a F - ... a'' a' [H] dip F a F - ... a'' H a' F a F - ... a'' [G] dupdip [H] dip F a' F a F - ... a'' G a'' [H] dip F a' F a F - ... a''' a'' [H] dip F a' F a F - ... a''' H a'' F a' F a F - ... a''' pop c a'' F a' F a F - ... c a'' F a' F a F - -### 4 -And, last but not least, if you can combine as you go, starting with c, and the combiner needs to work on the current item, this is the form: - - W == c swap [P] [pop] [[F] dupdip G] primrec - - ... a c swap [P] [pop] [[F] dupdip G] primrec - ... c a [P] [pop] [[F] dupdip G] primrec - ... c a [F] dupdip G W - ... c a F a G W - ... c a F a' W - ... c a F a' [F] dupdip G W - ... c a F a' F a' G W - ... c a F a' F a'' W - ... c a F a' F a'' [F] dupdip G W - ... c a F a' F a'' F a'' G W - ... c a F a' F a'' F a''' W - ... c a F a' F a'' F a''' pop - ... c a F a' F a'' F - -Each of the four variations above can be specialized to ana- and catamorphic forms. - - -```python -def WTFmorphism(c, F, P, G): - '''Return a hylomorphism function H.''' - - def H(a, d=c): - if P(a): - result = d - else: - a, b = G(a) - result = H(a, F(d, b)) - return result - - return H -``` - - -```python -F = lambda a, b: a + b -P = lambda n: n <= 1 -G = lambda n: (n - 1, n - 1) - -wtf = WTFmorphism(0, F, P, G) - -print wtf(5) -``` - - 10 - - - H == [P ] [pop c ] [G ] [dip F ] genrec - - -```python -DefinitionWrapper.add_definitions(''' -P == 1 <= -Ga == -- dup -Gb == -- -c == 0 -F == + -''', D) -``` - - -```python -V('[1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec') -``` - - . [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec - [1 2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec - [1 2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec - [1 2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec - [1 2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec - [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec - [1 2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[1 2 3]] [[] =] . infra first choice i - [1 2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i - [1 2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i - False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i - False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] . swaack first choice i - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i - [1 2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons - 1 [2 3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons - [2 3] 1 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons - [2 3] 1 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons - [2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 1 swons - [2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 1 swons - [2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 1 swons - [2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 1 swons - [2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 1 swons - [2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[2 3]] [[] =] . infra first choice i 1 swons - [2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons - [2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons - False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons - False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] . swaack first choice i 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 1 swons - [2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons - 2 [3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons - [3] 2 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons - [3] 2 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 1 swons - [3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons - [3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons - [3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 2 swons 1 swons - [3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 2 swons 1 swons - [3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 2 swons 1 swons - [3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[3]] [[] =] . infra first choice i 2 swons 1 swons - [3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons - [3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons - False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons - False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] . swaack first choice i 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 2 swons 1 swons - [3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons - 3 [] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons - [] 3 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons - [] 3 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 2 swons 1 swons - [] . [[] =] [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] . [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] . [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] [uncons swap] . [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] [uncons swap] [dip swons] . genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 3 swons 2 swons 1 swons - [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[]] [[] =] . infra first choice i 3 swons 2 swons 1 swons - [] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons - [] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons - True . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons - True [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] . swaack first choice i 3 swons 2 swons 1 swons - [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 3 swons 2 swons 1 swons - [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] True . choice i 3 swons 2 swons 1 swons - [] [pop []] . i 3 swons 2 swons 1 swons - [] . pop [] 3 swons 2 swons 1 swons - . [] 3 swons 2 swons 1 swons - [] . 3 swons 2 swons 1 swons - [] 3 . swons 2 swons 1 swons - [] 3 . swap cons 2 swons 1 swons - 3 [] . cons 2 swons 1 swons - [3] . 2 swons 1 swons - [3] 2 . swons 1 swons - [3] 2 . swap cons 1 swons - 2 [3] . cons 1 swons - [2 3] . 1 swons - [2 3] 1 . swons - [2 3] 1 . swap cons - 1 [2 3] . cons - [1 2 3] . - - - -```python -V('3 [P] [pop c] [Ga] [dip F] genrec') -``` - - . 3 [P] [pop c] [Ga] [dip F] genrec - 3 . [P] [pop c] [Ga] [dip F] genrec - 3 [P] . [pop c] [Ga] [dip F] genrec - 3 [P] [pop c] . [Ga] [dip F] genrec - 3 [P] [pop c] [Ga] . [dip F] genrec - 3 [P] [pop c] [Ga] [dip F] . genrec - 3 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [3] [P] . infra first choice i - 3 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - 3 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - 3 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] . swaack first choice i - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i - 3 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F - 3 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F - 2 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F - 2 2 . [[P] [pop c] [Ga] [dip F] genrec] dip F - 2 2 [[P] [pop c] [Ga] [dip F] genrec] . dip F - 2 . [P] [pop c] [Ga] [dip F] genrec 2 F - 2 [P] . [pop c] [Ga] [dip F] genrec 2 F - 2 [P] [pop c] . [Ga] [dip F] genrec 2 F - 2 [P] [pop c] [Ga] . [dip F] genrec 2 F - 2 [P] [pop c] [Ga] [dip F] . genrec 2 F - 2 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [2] [P] . infra first choice i 2 F - 2 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - 2 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - 2 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] . swaack first choice i 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i 2 F - 2 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 2 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 1 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 1 1 . [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 1 1 [[P] [pop c] [Ga] [dip F] genrec] . dip F 2 F - 1 . [P] [pop c] [Ga] [dip F] genrec 1 F 2 F - 1 [P] . [pop c] [Ga] [dip F] genrec 1 F 2 F - 1 [P] [pop c] . [Ga] [dip F] genrec 1 F 2 F - 1 [P] [pop c] [Ga] . [dip F] genrec 1 F 2 F - 1 [P] [pop c] [Ga] [dip F] . genrec 1 F 2 F - 1 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 1 F 2 F - 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [1] [P] . infra first choice i 1 F 2 F - 1 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - 1 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - 1 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - True . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - True [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] . swaack first choice i 1 F 2 F - 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F - 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F - 1 [pop c] . i 1 F 2 F - 1 . pop c 1 F 2 F - . c 1 F 2 F - . 0 1 F 2 F - 0 . 1 F 2 F - 0 1 . F 2 F - 0 1 . + 2 F - 1 . 2 F - 1 2 . F - 1 2 . + - 3 . - - - -```python -V('3 [P] [pop []] [Ga] [dip swons] genrec') -``` - - . 3 [P] [pop []] [Ga] [dip swons] genrec - 3 . [P] [pop []] [Ga] [dip swons] genrec - 3 [P] . [pop []] [Ga] [dip swons] genrec - 3 [P] [pop []] . [Ga] [dip swons] genrec - 3 [P] [pop []] [Ga] . [dip swons] genrec - 3 [P] [pop []] [Ga] [dip swons] . genrec - 3 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [3] [P] . infra first choice i - 3 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - 3 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - 3 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] . swaack first choice i - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i - 3 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 3 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 2 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 2 2 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 2 2 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons - 2 . [P] [pop []] [Ga] [dip swons] genrec 2 swons - 2 [P] . [pop []] [Ga] [dip swons] genrec 2 swons - 2 [P] [pop []] . [Ga] [dip swons] genrec 2 swons - 2 [P] [pop []] [Ga] . [dip swons] genrec 2 swons - 2 [P] [pop []] [Ga] [dip swons] . genrec 2 swons - 2 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [2] [P] . infra first choice i 2 swons - 2 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - 2 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - 2 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i 2 swons - 2 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 2 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 1 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 1 1 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 1 1 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons 2 swons - 1 . [P] [pop []] [Ga] [dip swons] genrec 1 swons 2 swons - 1 [P] . [pop []] [Ga] [dip swons] genrec 1 swons 2 swons - 1 [P] [pop []] . [Ga] [dip swons] genrec 1 swons 2 swons - 1 [P] [pop []] [Ga] . [dip swons] genrec 1 swons 2 swons - 1 [P] [pop []] [Ga] [dip swons] . genrec 1 swons 2 swons - 1 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons - 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [1] [P] . infra first choice i 1 swons 2 swons - 1 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - 1 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - 1 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - True . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - True [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons - 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 1 swons 2 swons - 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] True . choice i 1 swons 2 swons - 1 [pop []] . i 1 swons 2 swons - 1 . pop [] 1 swons 2 swons - . [] 1 swons 2 swons - [] . 1 swons 2 swons - [] 1 . swons 2 swons - [] 1 . swap cons 2 swons - 1 [] . cons 2 swons - [1] . 2 swons - [1] 2 . swons - [1] 2 . swap cons - 2 [1] . cons - [2 1] . - - - -```python -V('[2 1] [[] =] [pop c ] [uncons swap] [dip F] genrec') -``` - - . [2 1] [[] =] [pop c] [uncons swap] [dip F] genrec - [2 1] . [[] =] [pop c] [uncons swap] [dip F] genrec - [2 1] [[] =] . [pop c] [uncons swap] [dip F] genrec - [2 1] [[] =] [pop c] . [uncons swap] [dip F] genrec - [2 1] [[] =] [pop c] [uncons swap] . [dip F] genrec - [2 1] [[] =] [pop c] [uncons swap] [dip F] . genrec - [2 1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[2 1]] [[] =] . infra first choice i - [2 1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i - [2 1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i - False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i - False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] . swaack first choice i - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i - [2 1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F - 2 [1] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F - [1] 2 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F - [1] 2 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F - [1] . [[] =] [pop c] [uncons swap] [dip F] genrec 2 F - [1] [[] =] . [pop c] [uncons swap] [dip F] genrec 2 F - [1] [[] =] [pop c] . [uncons swap] [dip F] genrec 2 F - [1] [[] =] [pop c] [uncons swap] . [dip F] genrec 2 F - [1] [[] =] [pop c] [uncons swap] [dip F] . genrec 2 F - [1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[1]] [[] =] . infra first choice i 2 F - [1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F - [1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F - False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F - False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] . swaack first choice i 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i 2 F - [1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F - 1 [] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F - [] 1 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F - [] 1 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F 2 F - [] . [[] =] [pop c] [uncons swap] [dip F] genrec 1 F 2 F - [] [[] =] . [pop c] [uncons swap] [dip F] genrec 1 F 2 F - [] [[] =] [pop c] . [uncons swap] [dip F] genrec 1 F 2 F - [] [[] =] [pop c] [uncons swap] . [dip F] genrec 1 F 2 F - [] [[] =] [pop c] [uncons swap] [dip F] . genrec 1 F 2 F - [] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 1 F 2 F - [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[]] [[] =] . infra first choice i 1 F 2 F - [] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F - [] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F - True . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F - True [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] . swaack first choice i 1 F 2 F - [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F - [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F - [] [pop c] . i 1 F 2 F - [] . pop c 1 F 2 F - . c 1 F 2 F - . 0 1 F 2 F - 0 . 1 F 2 F - 0 1 . F 2 F - 0 1 . + 2 F - 1 . 2 F - 1 2 . F - 1 2 . + - 3 . - - -## Appendix - Fun with Symbols - - |[ (c, F), (G, P) ]| == (|c, F|) • [(G, P)] - -["Bananas, Lenses, & Barbed Wire"](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125) - - (|...|) [(...)] [<...>] - -I think they are having slightly too much fun with the symbols. - -"Too much is always better than not enough." - -# Tree with node and list of trees. - - tree = [] | [node [tree*]] - -### `treestep` - - tree z [C] [N] treestep - - - [] z [C] [N] treestep - --------------------------- - z - - - [node [tree*]] z [C] [N] treestep - --------------------------------------- w/ K == z [C] [N] treestep - node N [tree*] [K] map C - -### Derive the recursive form. - K == [not] [pop z] [J] ifte - - - [node [tree*]] J - ------------------------------ - node N [tree*] [K] map C - - - J == .. [N] .. [K] .. [C] .. - - [node [tree*]] uncons [N] dip - node [[tree*]] [N] dip - node N [[tree*]] - - node N [[tree*]] i [K] map - node N [tree*] [K] map - node N [K.tree*] - - J == uncons [N] dip i [K] map [C] i - - K == [not] [pop z] [uncons [N] dip i [K] map [C] i] ifte - K == [not] [pop z] [uncons [N] dip i] [map [C] i] genrec - -### Extract the givens to parameterize the program. - [not] [pop z] [uncons [N] dip unquote] [map [C] i] genrec - [not] [z] [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec - [not] z unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec - z [not] swap unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec - \............TS0............/ - z TS0 [uncons [N] dip unquote] [map [C] i] genrec - z [uncons [N] dip unquote] [TS0] dip [map [C] i] genrec - z [[N] dip unquote] [uncons] swoncat [TS0] dip [map [C] i] genrec - z [N] [dip unquote] cons [uncons] swoncat [TS0] dip [map [C] i] genrec - \...........TS1.................../ - z [N] TS1 [TS0] dip [map [C] i] genrec - z [N] [map [C] i] [TS1 [TS0] dip] dip genrec - z [N] [map C ] [TS1 [TS0] dip] dip genrec - z [N] [C] [map] swoncat [TS1 [TS0] dip] dip genrec - z [C] [N] swap [map] swoncat [TS1 [TS0] dip] dip genrec - - TS0 == [not] swap unit [pop] swoncat - TS1 == [dip i] cons [uncons] swoncat - treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec - - [] 0 [C] [N] treestep - --------------------------- - 0 - - - [n [tree*]] 0 [sum +] [] treestep - -------------------------------------------------- - n [tree*] [0 [sum +] [] treestep] map sum + - - -```python -DefinitionWrapper.add_definitions(''' - - TS0 == [not] swap unit [pop] swoncat - TS1 == [dip i] cons [uncons] swoncat -treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec - -''', D) -``` - - -```python -V('[] 0 [sum +] [] treestep') -``` - - . [] 0 [sum +] [] treestep - [] . 0 [sum +] [] treestep - [] 0 . [sum +] [] treestep - [] 0 [sum +] . [] treestep - [] 0 [sum +] [] . treestep - [] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec - [] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec - [] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec - [] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec - [] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec - [] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec - [] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec - [] 0 [] . TS1 [TS0] dip [map sum +] genrec - [] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec - [] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec - [] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec - [] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec - [] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec - [] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec - [] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec - [] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec - [] 0 . TS0 [uncons [] dip i] [map sum +] genrec - [] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec - [] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec - [] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec - [] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec - [] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec - [] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec - [] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte - [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[]] [not] . infra first choice i - [] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i - True . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i - True [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] . swaack first choice i - [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [True] . first choice i - [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] True . choice i - [] [pop 0] . i - [] . pop 0 - . 0 - 0 . - - - -```python -V('[23 []] 0 [sum +] [] treestep') -``` - - . [23 []] 0 [sum +] [] treestep - [23 []] . 0 [sum +] [] treestep - [23 []] 0 . [sum +] [] treestep - [23 []] 0 [sum +] . [] treestep - [23 []] 0 [sum +] [] . treestep - [23 []] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec - [23 []] 0 [] . TS1 [TS0] dip [map sum +] genrec - [23 []] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec - [23 []] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec - [23 []] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec - [23 []] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec - [23 []] 0 . TS0 [uncons [] dip i] [map sum +] genrec - [23 []] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec - [23 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec - [23 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec - [23 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 []]] [not] . infra first choice i - [23 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i - False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i - False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] . swaack first choice i - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i - [23 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + - 23 [] . sum + - 23 [] . 0 [+] catamorphism + - 23 [] 0 . [+] catamorphism + - 23 [] 0 [+] . catamorphism + - 23 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + - 23 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + - 23 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + - 23 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + - 23 [] [[] =] 0 [uncons swap] [+] . hylomorphism + - 23 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + - 23 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + - 23 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + - 23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i + - 23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i + - 23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i + - 23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i + - 23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + - 23 [] [pop 0] . i + - 23 [] . pop 0 + - 23 . 0 + - 23 0 . + - 23 . - - - -```python -V('[23 [[2 []] [3 []]]] 0 [sum +] [] treestep') -``` - - . [23 [[2 []] [3 []]]] 0 [sum +] [] treestep - [23 [[2 []] [3 []]]] . 0 [sum +] [] treestep - [23 [[2 []] [3 []]]] 0 . [sum +] [] treestep - [23 [[2 []] [3 []]]] 0 [sum +] . [] treestep - [23 [[2 []] [3 []]]] 0 [sum +] [] . treestep - [23 [[2 []] [3 []]]] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec - [23 [[2 []] [3 []]]] 0 [] . TS1 [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 . TS0 [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec - [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 [[2 []] [3 []]]]] [not] . infra first choice i - [23 [[2 []] [3 []]]] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i - False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i - False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] . swaack first choice i - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i - [23 [[2 []] [3 []]]] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[[2 []] [3 []]]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[[2 []] [3 []]]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [[[2 []] [3 []]]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[[2 []] [3 []]]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[2 []] [3 []]] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + - 23 [] [[[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first] . infra sum + - . [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - [[3 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[3 []] 23] [not] . infra first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] . swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . 0 [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 . [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 [+] . catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 3 23] [[] =] . infra first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] . swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 3 23] . first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [pop 0] . i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . pop 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 0 . + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - [3 23] . first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 3 . [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 3 [[2 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 3 [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [23] swaack sum + - 23 [2 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[2 []] 23] [not] . infra first choice i [3] swaack first [23] swaack sum + - 23 [2 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum + - 23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum + - 23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] . swaack first choice i [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [3] swaack first [23] swaack sum + - 23 [2 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [3] swaack first [23] swaack sum + - 23 2 [] . sum + [3] swaack first [23] swaack sum + - 23 2 [] . 0 [+] catamorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 . [+] catamorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 [+] . catamorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [3] swaack first [23] swaack sum + - 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 2 23] [[] =] . infra first choice i + [3] swaack first [23] swaack sum + - 23 2 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] . swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 2 23] . first choice i + [3] swaack first [23] swaack sum + - 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [3] swaack first [23] swaack sum + - 23 2 [] [pop 0] . i + [3] swaack first [23] swaack sum + - 23 2 [] . pop 0 + [3] swaack first [23] swaack sum + - 23 2 . 0 + [3] swaack first [23] swaack sum + - 23 2 0 . + [3] swaack first [23] swaack sum + - 23 2 . [3] swaack first [23] swaack sum + - 23 2 [3] . swaack first [23] swaack sum + - 3 [2 23] . first [23] swaack sum + - 3 2 . [23] swaack sum + - 3 2 [23] . swaack sum + - 23 [2 3] . sum + - 23 [2 3] . 0 [+] catamorphism + - 23 [2 3] 0 . [+] catamorphism + - 23 [2 3] 0 [+] . catamorphism + - 23 [2 3] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + - 23 [2 3] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + - 23 [2 3] [[] =] 0 [+] . [uncons swap] swap hylomorphism + - 23 [2 3] [[] =] 0 [+] [uncons swap] . swap hylomorphism + - 23 [2 3] [[] =] 0 [uncons swap] [+] . hylomorphism + - 23 [2 3] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + - 23 [2 3] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + - 23 [2 3] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [dip +] . genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 3] 23] [[] =] . infra first choice i + - 23 [2 3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i + - 23 [2 3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i + - 23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i + - 23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] . swaack first choice i + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i + - 23 [2 3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + + - 23 2 [3] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + + - 23 [3] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + + - 23 [3] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + + - 23 [3] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + + - 23 [3] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + + - 23 [3] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + + - 23 [3] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + + - 23 [3] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + + - 23 [3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3] 23] [[] =] . infra first choice i 2 + + - 23 [3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + + - 23 [3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + + - 23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + + - 23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] . swaack first choice i 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + + - 23 [3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + + - 23 3 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + + - 23 [] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + + - 23 [] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + + - 23 [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 2 + + - 23 [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 2 + + - 23 [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 2 + + - 23 [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 2 + + - 23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 2 + + - 23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 2 + + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i 3 + 2 + + - 23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + + - 23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + + - 23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + + - 23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i 3 + 2 + + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i 3 + 2 + + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 3 + 2 + + - 23 [] [pop 0] . i 3 + 2 + + - 23 [] . pop 0 3 + 2 + + - 23 . 0 3 + 2 + + - 23 0 . 3 + 2 + + - 23 0 3 . + 2 + + - 23 3 . 2 + + - 23 3 2 . + + - 23 5 . + - 28 . - - - -```python -J('[23 [[2 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]] [3 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]]]] 0 [sum +] [] treestep') -``` - - 140 - - - -```python -J('[] [] [unit cons] [23 +] treestep') -``` - - [] - - - -```python -J('[23 []] [] [unit cons] [23 +] treestep') -``` - - [46 []] - - - -```python -J('[23 [[2 []] [3 []]]] [] [unit cons] [23 +] treestep') -``` - - [46 [[25 []] [26 []]]] - - - -```python -define('treemap == [] [unit cons] roll< treestep') -``` - - -```python -J('[23 [[2 []] [3 []]]] [23 +] treemap') -``` - - [46 [[25 []] [26 []]]] - diff --git a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.rst b/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.rst deleted file mode 100644 index 14cbbb7..0000000 --- a/docs/Hylo-, Ana-, Cata-, and Para-morphisms - Recursion Combinators.rst +++ /dev/null @@ -1,2680 +0,0 @@ - -Cf. `"Bananas, Lenses, & Barbed -Wire" `__ - -`Hylomorphism `__ -==================================================================================== - -A -`hylomorphism `__ -``H :: A -> B`` converts a value of type A into a value of type B by -means of: - -- A generator ``G :: A -> (A, B)`` -- A combiner ``F :: (B, B) -> B`` -- A predicate ``P :: A -> Bool`` to detect the base case -- A base case value ``c :: B`` -- Recursive calls (zero or more); it has a "call stack in the form of a - cons list". - -It may be helpful to see this function implemented in imperative Python -code. - -.. code:: ipython2 - - def hylomorphism(c, F, P, G): - '''Return a hylomorphism function H.''' - - def H(a): - if P(a): - result = c - else: - b, aa = G(a) - result = F(b, H(aa)) - return result - - return H - -Finding `Triangular Numbers `__ -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -As a concrete example let's use a function that, given a positive -integer, returns the sum of all positive integers less than that one. -(In this case the types A and B are both ``int``.) ### With ``range()`` -and ``sum()`` - -.. code:: ipython2 - - r = range(10) - r - - - - -.. parsed-literal:: - - [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] - - - -.. code:: ipython2 - - sum(r) - - - - -.. parsed-literal:: - - 45 - - - -.. code:: ipython2 - - range_sum = lambda n: sum(range(n)) - range_sum(10) - - - - -.. parsed-literal:: - - 45 - - - -As a hylomorphism -~~~~~~~~~~~~~~~~~ - -.. code:: ipython2 - - G = lambda n: (n - 1, n - 1) - F = lambda a, b: a + b - P = lambda n: n <= 1 - - H = hylomorphism(0, F, P, G) - -.. code:: ipython2 - - H(10) - - - - -.. parsed-literal:: - - 45 - - - -If you were to run the above code in a debugger and check out the call -stack you would find that the variable ``b`` in each call to ``H()`` is -storing the intermediate values as ``H()`` recurses. This is what was -meant by "call stack in the form of a cons list". - -Joy Preamble -~~~~~~~~~~~~ - -.. code:: ipython2 - - from notebook_preamble import D, DefinitionWrapper, J, V, define - -Hylomorphism in Joy -------------------- - -We can define a combinator ``hylomorphism`` that will make a -hylomorphism combinator ``H`` from constituent parts. - -:: - - H == c [F] [P] [G] hylomorphism - -The function ``H`` is recursive, so we start with ``ifte`` and set the -else-part to some function ``J`` that will contain a quoted copy of -``H``. (The then-part just discards the leftover ``a`` and replaces it -with the base case value ``c``.) - -:: - - H == [P] [pop c] [J] ifte - -The else-part ``J`` gets just the argument ``a`` on the stack. - -:: - - a J - a G The first thing to do is use the generator G - aa b which produces b and a new aa - aa b [H] dip we recur with H on the new aa - aa H b F and run F on the result. - -This gives us a definition for ``J``. - -:: - - J == G [H] dip F - -Plug it in and convert to genrec. - -:: - - H == [P] [pop c] [G [H] dip F] ifte - H == [P] [pop c] [G] [dip F] genrec - -This is the form of a hylomorphism in Joy, which nicely illustrates that -it is a simple specialization of the general recursion combinator. - -:: - - H == [P] [pop c] [G] [dip F] genrec - -Derivation of ``hylomorphism`` ------------------------------- - -Now we just need to derive a definition that builds the ``genrec`` -arguments out of the pieces given to the ``hylomorphism`` combinator. - -:: - - H == [P] [pop c] [G] [dip F] genrec - [P] [c] [pop] swoncat [G] [F] [dip] swoncat genrec - [P] c unit [pop] swoncat [G] [F] [dip] swoncat genrec - [P] c [G] [F] [unit [pop] swoncat] dipd [dip] swoncat genrec - -Working in reverse: - Use ``swoncat`` twice to decouple ``[c]`` and -``[F]``. - Use ``unit`` to dequote ``c``. - Use ``dipd`` to untangle -``[unit [pop] swoncat]`` from the givens. - -At this point all of the arguments (givens) to the hylomorphism are to -the left so we have a definition for ``hylomorphism``: - -:: - - hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec - -The order of parameters is different than the one we started with but -that hardly matters, you can rearrange them or just supply them in the -expected order. - -:: - - [P] c [G] [F] hylomorphism == H - -.. code:: ipython2 - - define('hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec') - -Demonstrate summing a range of integers from 0 to n-1. - -- ``[P]`` is ``[0 <=]`` -- ``c`` is ``0`` -- ``[G]`` is ``[1 - dup]`` -- ``[F]`` is ``[+]`` - -So to sum the positive integers less than five we can do this. - -.. code:: ipython2 - - V('5 [0 <=] 0 [1 - dup] [+] hylomorphism') - - -.. parsed-literal:: - - . 5 [0 <=] 0 [1 - dup] [+] hylomorphism - 5 . [0 <=] 0 [1 - dup] [+] hylomorphism - 5 [0 <=] . 0 [1 - dup] [+] hylomorphism - 5 [0 <=] 0 . [1 - dup] [+] hylomorphism - 5 [0 <=] 0 [1 - dup] . [+] hylomorphism - 5 [0 <=] 0 [1 - dup] [+] . hylomorphism - 5 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec - 5 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec - 5 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec - 5 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec - 5 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec - 5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec - 5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i - 5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i - 5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i - 5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + - 4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 + - 4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 + - 4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 + - 4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 + - 4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 + - 4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 + - 4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + - 4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 + - 4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + - 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 + - 3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 + - 3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 + - 3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 + - 3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 + - 3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 + - 3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 + - 3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + - 3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 + - 3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + - 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 + - 2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 + - 2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 + - 2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + - 2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 + - 2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + - 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 + - 1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 + - 1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 + - 1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + - 1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + - 1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + - 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + - 0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + - 0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 + - 0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + - 0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + - True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + - True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + - 0 [pop 0] . i 0 + 1 + 2 + 3 + 4 + - 0 . pop 0 0 + 1 + 2 + 3 + 4 + - . 0 0 + 1 + 2 + 3 + 4 + - 0 . 0 + 1 + 2 + 3 + 4 + - 0 0 . + 1 + 2 + 3 + 4 + - 0 . 1 + 2 + 3 + 4 + - 0 1 . + 2 + 3 + 4 + - 1 . 2 + 3 + 4 + - 1 2 . + 3 + 4 + - 3 . 3 + 4 + - 3 3 . + 4 + - 6 . 4 + - 6 4 . + - 10 . - - -Anamorphism -=========== - -An anamorphism can be defined as a hylomorphism that uses ``[]`` for -``c`` and ``swons`` for ``F``. - -:: - - [P] [G] anamorphism == [P] [] [G] [swons] hylomorphism == A - -This allows us to define an anamorphism combinator in terms of the -hylomorphism combinator. - -:: - - [] swap [swons] hylomorphism == anamorphism - -Partial evaluation gives us a "pre-cooked" form. - -:: - - [P] [G] . anamorphism - [P] [G] . [] swap [swons] hylomorphism - [P] [G] [] . swap [swons] hylomorphism - [P] [] [G] . [swons] hylomorphism - [P] [] [G] [swons] . hylomorphism - [P] [] [G] [swons] . [unit [pop] swoncat] dipd [dip] swoncat genrec - [P] [] [G] [swons] [unit [pop] swoncat] . dipd [dip] swoncat genrec - [P] [] . unit [pop] swoncat [G] [swons] [dip] swoncat genrec - [P] [[]] [pop] . swoncat [G] [swons] [dip] swoncat genrec - [P] [pop []] [G] [swons] [dip] . swoncat genrec - - [P] [pop []] [G] [dip swons] genrec - -(We could also have just substituted for ``c`` and ``F`` in the -definition of ``H``.) - -:: - - H == [P] [pop c ] [G] [dip F ] genrec - A == [P] [pop []] [G] [dip swons] genrec - -The partial evaluation is overkill in this case but it serves as a -reminder that this sort of program specialization can, in many cases, be -carried out automatically.) - -Untangle ``[G]`` from ``[pop []]`` using ``swap``. - -:: - - [P] [G] [pop []] swap [dip swons] genrec - -All of the arguments to ``anamorphism`` are to the left, so we have a -definition for it. - -:: - - anamorphism == [pop []] swap [dip swons] genrec - -An example of an anamorphism is the range function. - -:: - - range == [0 <=] [1 - dup] anamorphism - -Catamorphism -============ - -A catamorphism can be defined as a hylomorphism that uses -``[uncons swap]`` for ``[G]`` and ``[[] =]`` for the predicate ``[P]``. - -:: - - c [F] catamorphism == [[] =] c [uncons swap] [F] hylomorphism == C - -This allows us to define a ``catamorphism`` combinator in terms of the -``hylomorphism`` combinator. - -:: - - [[] =] roll> [uncons swap] swap hylomorphism == catamorphism - -Partial evaluation doesn't help much. - -:: - - c [F] . catamorphism - c [F] . [[] =] roll> [uncons swap] swap hylomorphism - c [F] [[] =] . roll> [uncons swap] swap hylomorphism - [[] =] c [F] [uncons swap] . swap hylomorphism - [[] =] c [uncons swap] [F] . hylomorphism - [[] =] c [uncons swap] [F] [unit [pop] swoncat] . dipd [dip] swoncat genrec - [[] =] c . unit [pop] swoncat [uncons swap] [F] [dip] swoncat genrec - [[] =] [c] [pop] . swoncat [uncons swap] [F] [dip] swoncat genrec - [[] =] [pop c] [uncons swap] [F] [dip] . swoncat genrec - [[] =] [pop c] [uncons swap] [dip F] genrec - -Because the arguments to catamorphism have to be prepared (unlike the -arguments to anamorphism, which only need to be rearranged slightly) -there isn't much point to "pre-cooking" the definition. - -:: - - catamorphism == [[] =] roll> [uncons swap] swap hylomorphism - -An example of a catamorphism is the sum function. - -:: - - sum == 0 [+] catamorphism - -"Fusion Law" for catas (UNFINISHED!!!) -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -I'm not sure exactly how to translate the "Fusion Law" for catamorphisms -into Joy. - -I know that a ``map`` composed with a cata can be expressed as a new -cata: - -:: - - [F] map b [B] cata == b [F B] cata - -But this isn't the one described in "Bananas...". That's more like: - -A cata composed with some function can be expressed as some other cata: - -:: - - b [B] catamorphism F == c [C] catamorphism - -Given: - -:: - - b F == c - - ... - - B F == [F] dip C - - ... - - b[B]cata F == c[C]cata - - F(B(head, tail)) == C(head, F(tail)) - - 1 [2 3] B F 1 [2 3] F C - - - b F == c - B F == F C - - b [B] catamorphism F == c [C] catamorphism - b [B] catamorphism F == b F [C] catamorphism - - ... - -Or maybe, - -:: - - [F] map b [B] cata == c [C] cata ??? - - [F] map b [B] cata == b [F B] cata I think this is generally true, unless F consumes stack items - instead of just transforming TOS. Of course, there's always [F] unary. - b [F] unary [[F] unary B] cata - - [10 *] map 0 swap [+] step == 0 swap [10 * +] step - -For example: - -:: - - F == 10 * - b == 0 - B == + - c == 0 - C == F + - - b F == c - 0 10 * == 0 - - B F == [F] dip C - + 10 * == [10 *] dip F + - + 10 * == [10 *] dip 10 * + - - n m + 10 * == 10(n+m) - - n m [10 *] dip 10 * + - n 10 * m 10 * + - 10n m 10 * + - 10n 10m + - 10n+10m - - 10n+10m = 10(n+m) - -Ergo: - -:: - - 0 [+] catamorphism 10 * == 0 [10 * +] catamorphism - -The ``step`` combinator will usually be better to use than ``catamorphism``. ----------------------------------------------------------------------------- - -:: - - sum == 0 swap [+] step - sum == 0 [+] catamorphism - -anamorphism catamorphism == hylomorphism -======================================== - -Here is (part of) the payoff. - -An anamorphism followed by (composed with) a catamorphism is a -hylomorphism, with the advantage that the hylomorphism does not create -the intermediate list structure. The values are stored in either the -call stack, for those implementations that use one, or in the pending -expression ("continuation") for the Joypy interpreter. They still have -to be somewhere, converting from an anamorphism and catamorphism to a -hylomorphism just prevents using additional storage and doing additional -processing. - -:: - - range == [0 <=] [1 - dup] anamorphism - sum == 0 [+] catamorphism - - range sum == [0 <=] [1 - dup] anamorphism 0 [+] catamorphism - == [0 <=] 0 [1 - dup] [+] hylomorphism - -We can let the ``hylomorphism`` combinator build ``range_sum`` for us or -just substitute ourselves. - -:: - - H == [P] [pop c] [G] [dip F] genrec - range_sum == [0 <=] [pop 0] [1 - dup] [dip +] genrec - -.. code:: ipython2 - - defs = ''' - anamorphism == [pop []] swap [dip swons] genrec - hylomorphism == [unit [pop] swoncat] dipd [dip] swoncat genrec - catamorphism == [[] =] roll> [uncons swap] swap hylomorphism - range == [0 <=] [1 - dup] anamorphism - sum == 0 [+] catamorphism - range_sum == [0 <=] 0 [1 - dup] [+] hylomorphism - ''' - - DefinitionWrapper.add_definitions(defs, D) - -.. code:: ipython2 - - J('10 range') - - -.. parsed-literal:: - - [9 8 7 6 5 4 3 2 1 0] - - -.. code:: ipython2 - - J('[9 8 7 6 5 4 3 2 1 0] sum') - - -.. parsed-literal:: - - 45 - - -.. code:: ipython2 - - V('10 range sum') - - -.. parsed-literal:: - - . 10 range sum - 10 . range sum - 10 . [0 <=] [1 - dup] anamorphism sum - 10 [0 <=] . [1 - dup] anamorphism sum - 10 [0 <=] [1 - dup] . anamorphism sum - 10 [0 <=] [1 - dup] . [pop []] swap [dip swons] genrec sum - 10 [0 <=] [1 - dup] [pop []] . swap [dip swons] genrec sum - 10 [0 <=] [pop []] [1 - dup] . [dip swons] genrec sum - 10 [0 <=] [pop []] [1 - dup] [dip swons] . genrec sum - 10 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [10] [0 <=] . infra first choice i sum - 10 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum - 10 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] swaack first choice i sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 10] . swaack first choice i sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i sum - 10 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i sum - 10 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 10 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 9 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 9 9 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons sum - 9 9 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons sum - 9 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 9 swons sum - 9 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 9 swons sum - 9 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 9 swons sum - 9 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 9 swons sum - 9 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 9 swons sum - 9 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [9] [0 <=] . infra first choice i 9 swons sum - 9 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum - 9 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] swaack first choice i 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 9] . swaack first choice i 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 9 swons sum - 9 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 9 swons sum - 9 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 9 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 8 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 8 8 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 9 swons sum - 8 8 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 9 swons sum - 8 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 8 swons 9 swons sum - 8 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [8] [0 <=] . infra first choice i 8 swons 9 swons sum - 8 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum - 8 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] swaack first choice i 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 8] . swaack first choice i 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 8 swons 9 swons sum - 8 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 8 swons 9 swons sum - 8 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 8 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 7 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 7 7 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 8 swons 9 swons sum - 7 7 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 8 swons 9 swons sum - 7 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 7 swons 8 swons 9 swons sum - 7 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [7] [0 <=] . infra first choice i 7 swons 8 swons 9 swons sum - 7 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum - 7 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] swaack first choice i 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 7] . swaack first choice i 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 7 swons 8 swons 9 swons sum - 7 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 7 swons 8 swons 9 swons sum - 7 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 7 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 6 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 6 6 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 7 swons 8 swons 9 swons sum - 6 6 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 7 swons 8 swons 9 swons sum - 6 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 6 swons 7 swons 8 swons 9 swons sum - 6 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [6] [0 <=] . infra first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 6] . swaack first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 6 swons 7 swons 8 swons 9 swons sum - 6 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 6 swons 7 swons 8 swons 9 swons sum - 6 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 6 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 5 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 5 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 6 swons 7 swons 8 swons 9 swons sum - 5 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [5] [0 <=] . infra first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 5] . swaack first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 5 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 4 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 4 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [4] [0 <=] . infra first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 4] . swaack first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 3 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 3 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [3] [0 <=] . infra first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 3] . swaack first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 2 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 2 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [2] [0 <=] . infra first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 1 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 1 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [1] [0 <=] . infra first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - False [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . i 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 . 1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 1 . - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 0 . [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 0 [[0 <=] [pop []] [1 - dup] [dip swons] genrec] . dip swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . [0 <=] [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] . [pop []] [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] . [1 - dup] [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] [1 - dup] . [dip swons] genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] [1 - dup] [dip swons] . genrec 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [0 <=] [pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] . ifte 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [0] [0 <=] . infra first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . 0 <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 0 . <= [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - True . [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - True [[pop []] [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] 0] . swaack first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [1 - dup [[0 <=] [pop []] [1 - dup] [dip swons] genrec] dip swons] [pop []] True . choice i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [pop []] . i 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 . pop [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - . [] 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [] . 0 swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [] 0 . swons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [] 0 . swap cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 0 [] . cons 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [0] . 1 swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [0] 1 . swons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [0] 1 . swap cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 1 [0] . cons 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [1 0] . 2 swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [1 0] 2 . swons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [1 0] 2 . swap cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 2 [1 0] . cons 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [2 1 0] . 3 swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [2 1 0] 3 . swons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [2 1 0] 3 . swap cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 3 [2 1 0] . cons 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [3 2 1 0] . 4 swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [3 2 1 0] 4 . swons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [3 2 1 0] 4 . swap cons 5 swons 6 swons 7 swons 8 swons 9 swons sum - 4 [3 2 1 0] . cons 5 swons 6 swons 7 swons 8 swons 9 swons sum - [4 3 2 1 0] . 5 swons 6 swons 7 swons 8 swons 9 swons sum - [4 3 2 1 0] 5 . swons 6 swons 7 swons 8 swons 9 swons sum - [4 3 2 1 0] 5 . swap cons 6 swons 7 swons 8 swons 9 swons sum - 5 [4 3 2 1 0] . cons 6 swons 7 swons 8 swons 9 swons sum - [5 4 3 2 1 0] . 6 swons 7 swons 8 swons 9 swons sum - [5 4 3 2 1 0] 6 . swons 7 swons 8 swons 9 swons sum - [5 4 3 2 1 0] 6 . swap cons 7 swons 8 swons 9 swons sum - 6 [5 4 3 2 1 0] . cons 7 swons 8 swons 9 swons sum - [6 5 4 3 2 1 0] . 7 swons 8 swons 9 swons sum - [6 5 4 3 2 1 0] 7 . swons 8 swons 9 swons sum - [6 5 4 3 2 1 0] 7 . swap cons 8 swons 9 swons sum - 7 [6 5 4 3 2 1 0] . cons 8 swons 9 swons sum - [7 6 5 4 3 2 1 0] . 8 swons 9 swons sum - [7 6 5 4 3 2 1 0] 8 . swons 9 swons sum - [7 6 5 4 3 2 1 0] 8 . swap cons 9 swons sum - 8 [7 6 5 4 3 2 1 0] . cons 9 swons sum - [8 7 6 5 4 3 2 1 0] . 9 swons sum - [8 7 6 5 4 3 2 1 0] 9 . swons sum - [8 7 6 5 4 3 2 1 0] 9 . swap cons sum - 9 [8 7 6 5 4 3 2 1 0] . cons sum - [9 8 7 6 5 4 3 2 1 0] . sum - [9 8 7 6 5 4 3 2 1 0] . 0 [+] catamorphism - [9 8 7 6 5 4 3 2 1 0] 0 . [+] catamorphism - [9 8 7 6 5 4 3 2 1 0] 0 [+] . catamorphism - [9 8 7 6 5 4 3 2 1 0] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] . [uncons swap] swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [+] [uncons swap] . swap hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . hylomorphism - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec - [9 8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[9 8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i - [9 8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i - [9 8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] swaack first choice i - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [9 8 7 6 5 4 3 2 1 0]] . swaack first choice i - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i - [9 8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i - [9 8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + - 9 [8 7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + - [8 7 6 5 4 3 2 1 0] 9 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + - [8 7 6 5 4 3 2 1 0] 9 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + - [8 7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 9 + - [8 7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[8 7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 9 + - [8 7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 + - [8 7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] swaack first choice i 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [8 7 6 5 4 3 2 1 0]] . swaack first choice i 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 9 + - [8 7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 9 + - [8 7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 + - 8 [7 6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 + - [7 6 5 4 3 2 1 0] 8 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 9 + - [7 6 5 4 3 2 1 0] 8 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 9 + - [7 6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 8 + 9 + - [7 6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[7 6 5 4 3 2 1 0]] [[] =] . infra first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] swaack first choice i 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [7 6 5 4 3 2 1 0]] . swaack first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 + - [7 6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 8 + 9 + - [7 6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 + - 7 [6 5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 + - [6 5 4 3 2 1 0] 7 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 8 + 9 + - [6 5 4 3 2 1 0] 7 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 8 + 9 + - [6 5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 7 + 8 + 9 + - [6 5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[6 5 4 3 2 1 0]] [[] =] . infra first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] swaack first choice i 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [6 5 4 3 2 1 0]] . swaack first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 + - [6 5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 7 + 8 + 9 + - [6 5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 + - 6 [5 4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 + - [5 4 3 2 1 0] 6 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 7 + 8 + 9 + - [5 4 3 2 1 0] 6 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 7 + 8 + 9 + - [5 4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[5 4 3 2 1 0]] [[] =] . infra first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] swaack first choice i 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [5 4 3 2 1 0]] . swaack first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 + - [5 4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 [4 3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - [4 3 2 1 0] 5 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - [4 3 2 1 0] 5 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 6 + 7 + 8 + 9 + - [4 3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[4 3 2 1 0]] [[] =] . infra first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [4 3 2 1 0]] . swaack first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 + - [4 3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 [3 2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] 4 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] 4 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3 2 1 0]] [[] =] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3 2 1 0]] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 + - [3 2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [2 1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 1 0]] [[] =] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 1 0]] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [2 1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[1 0]] [[] =] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [1 0]] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [1 0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] 1 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] 1 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] . [[] =] [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] . [pop 0] [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] . [uncons swap] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] [uncons swap] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] [uncons swap] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[0]] [[] =] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [0]] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [0] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] 0 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] 0 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[]] [[] =] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] []] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - [] . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 . + 4 + 5 + 6 + 7 + 8 + 9 + - 6 . 4 + 5 + 6 + 7 + 8 + 9 + - 6 4 . + 5 + 6 + 7 + 8 + 9 + - 10 . 5 + 6 + 7 + 8 + 9 + - 10 5 . + 6 + 7 + 8 + 9 + - 15 . 6 + 7 + 8 + 9 + - 15 6 . + 7 + 8 + 9 + - 21 . 7 + 8 + 9 + - 21 7 . + 8 + 9 + - 28 . 8 + 9 + - 28 8 . + 9 + - 36 . 9 + - 36 9 . + - 45 . - - -.. code:: ipython2 - - V('10 range_sum') - - -.. parsed-literal:: - - . 10 range_sum - 10 . range_sum - 10 . [0 <=] 0 [1 - dup] [+] hylomorphism - 10 [0 <=] . 0 [1 - dup] [+] hylomorphism - 10 [0 <=] 0 . [1 - dup] [+] hylomorphism - 10 [0 <=] 0 [1 - dup] . [+] hylomorphism - 10 [0 <=] 0 [1 - dup] [+] . hylomorphism - 10 [0 <=] 0 [1 - dup] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec - 10 [0 <=] 0 [1 - dup] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec - 10 [0 <=] 0 . unit [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] 0 . [] cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] 0 [] . cons [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [0] . [pop] swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [0] [pop] . swoncat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [0] [pop] . swap concat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [pop] [0] . concat [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [pop 0] . [1 - dup] [+] [dip] swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] . [+] [dip] swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] [+] . [dip] swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swoncat genrec - 10 [0 <=] [pop 0] [1 - dup] [+] [dip] . swap concat genrec - 10 [0 <=] [pop 0] [1 - dup] [dip] [+] . concat genrec - 10 [0 <=] [pop 0] [1 - dup] [dip +] . genrec - 10 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [10] [0 <=] . infra first choice i - 10 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i - 10 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] swaack first choice i - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 10] . swaack first choice i - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i - 10 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i - 10 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 10 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 9 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 9 9 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + - 9 9 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + - 9 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 9 + - 9 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 9 + - 9 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 9 + - 9 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 9 + - 9 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 9 + - 9 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [9] [0 <=] . infra first choice i 9 + - 9 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 + - 9 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] swaack first choice i 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 9] . swaack first choice i 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 9 + - 9 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 9 + - 9 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 9 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 8 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 8 8 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 9 + - 8 8 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 9 + - 8 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 8 + 9 + - 8 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 8 + 9 + - 8 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 8 + 9 + - 8 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 8 + 9 + - 8 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 8 + 9 + - 8 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [8] [0 <=] . infra first choice i 8 + 9 + - 8 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 + - 8 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] swaack first choice i 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 8] . swaack first choice i 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 8 + 9 + - 8 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 8 + 9 + - 8 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 8 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 7 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 7 7 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 8 + 9 + - 7 7 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 8 + 9 + - 7 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 7 + 8 + 9 + - 7 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [7] [0 <=] . infra first choice i 7 + 8 + 9 + - 7 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 + - 7 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] swaack first choice i 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 7] . swaack first choice i 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 7 + 8 + 9 + - 7 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 7 + 8 + 9 + - 7 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 7 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 6 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 6 6 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 7 + 8 + 9 + - 6 6 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 7 + 8 + 9 + - 6 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 6 + 7 + 8 + 9 + - 6 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [6] [0 <=] . infra first choice i 6 + 7 + 8 + 9 + - 6 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 + - 6 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] swaack first choice i 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 6] . swaack first choice i 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 6 + 7 + 8 + 9 + - 6 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 6 + 7 + 8 + 9 + - 6 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 6 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 5 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 6 + 7 + 8 + 9 + - 5 5 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 6 + 7 + 8 + 9 + - 5 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 5 + 6 + 7 + 8 + 9 + - 5 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [5] [0 <=] . infra first choice i 5 + 6 + 7 + 8 + 9 + - 5 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 + - 5 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] swaack first choice i 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 5] . swaack first choice i 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 5 + 6 + 7 + 8 + 9 + - 5 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 5 + 6 + 7 + 8 + 9 + - 5 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 5 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 4 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 5 + 6 + 7 + 8 + 9 + - 4 4 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 5 + 6 + 7 + 8 + 9 + - 4 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 4 + 5 + 6 + 7 + 8 + 9 + - 4 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [4] [0 <=] . infra first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 4] . swaack first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 4 + 5 + 6 + 7 + 8 + 9 + - 4 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 4 + 5 + 6 + 7 + 8 + 9 + - 4 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 4 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [3] [0 <=] . infra first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 3] . swaack first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 2 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 2 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [2] [0 <=] . infra first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 2] . swaack first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 2 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 1 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 1 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [1] [0 <=] . infra first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - False [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 1] . swaack first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [False] . first choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] False . choice i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . i 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 1 . - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 [[0 <=] [pop 0] [1 - dup] [dip +] genrec] . dip + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . [0 <=] [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] . [pop 0] [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] . [1 - dup] [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] [1 - dup] . [dip +] genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] [1 - dup] [dip +] . genrec 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [0 <=] [pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] . ifte 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [0] [0 <=] . infra first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 0 <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . <= [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True . [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - True [[pop 0] [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] 0] . swaack first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] [True] . first choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [1 - dup [[0 <=] [pop 0] [1 - dup] [dip +] genrec] dip +] [pop 0] True . choice i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 [pop 0] . i 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . pop 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - . 0 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 0 . + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 . 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 0 1 . + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 . 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 1 2 . + 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 . 3 + 4 + 5 + 6 + 7 + 8 + 9 + - 3 3 . + 4 + 5 + 6 + 7 + 8 + 9 + - 6 . 4 + 5 + 6 + 7 + 8 + 9 + - 6 4 . + 5 + 6 + 7 + 8 + 9 + - 10 . 5 + 6 + 7 + 8 + 9 + - 10 5 . + 6 + 7 + 8 + 9 + - 15 . 6 + 7 + 8 + 9 + - 15 6 . + 7 + 8 + 9 + - 21 . 7 + 8 + 9 + - 21 7 . + 8 + 9 + - 28 . 8 + 9 + - 28 8 . + 9 + - 36 . 9 + - 36 9 . + - 45 . - - -Factorial Function and Paramorphisms -==================================== - -A paramorphism ``P :: B -> A`` is a recursion combinator that uses -``dup`` on intermediate values. - -:: - - n swap [P] [pop] [[F] dupdip G] primrec - -With - ``n :: A`` is the "identity" for ``F`` (like 1 for -multiplication, 0 for addition) - ``F :: (A, B) -> A`` - ``G :: B -> B`` -generates the next ``B`` value. - and lastly ``P :: B -> Bool`` detects -the end of the series. - -For Factorial function (types ``A`` and ``B`` are both integer): - -:: - - n == 1 - F == * - G == -- - P == 1 <= - -.. code:: ipython2 - - define('factorial == 1 swap [1 <=] [pop] [[*] dupdip --] primrec') - -Try it with input 3 (omitting evaluation of predicate): - -:: - - 3 1 swap [1 <=] [pop] [[*] dupdip --] primrec - 1 3 [1 <=] [pop] [[*] dupdip --] primrec - - 1 3 [*] dupdip -- - 1 3 * 3 -- - 3 3 -- - 3 2 - - 3 2 [*] dupdip -- - 3 2 * 2 -- - 6 2 -- - 6 1 - - 6 1 [1 <=] [pop] [[*] dupdip --] primrec - - 6 1 pop - 6 - -.. code:: ipython2 - - J('3 factorial') - - -.. parsed-literal:: - - 6 - - -Derive ``paramorphism`` from the form above. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - n swap [P] [pop] [[F] dupdip G] primrec - - n swap [P] [pop] [[F] dupdip G] primrec - n [P] [swap] dip [pop] [[F] dupdip G] primrec - n [P] [[F] dupdip G] [[swap] dip [pop]] dip primrec - n [P] [F] [dupdip G] cons [[swap] dip [pop]] dip primrec - n [P] [F] [G] [dupdip] swoncat cons [[swap] dip [pop]] dip primrec - - paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec - -.. code:: ipython2 - - define('paramorphism == [dupdip] swoncat cons [[swap] dip [pop]] dip primrec') - define('factorial == 1 [1 <=] [*] [--] paramorphism') - -.. code:: ipython2 - - J('3 factorial') - - -.. parsed-literal:: - - 6 - - -``tails`` -========= - -An example of a paramorphism for lists given in the `"Bananas..." -paper `__ -is ``tails`` which returns the list of "tails" of a list. - -:: - - [1 2 3] tails == [[] [3] [2 3]] - -Using ``paramorphism`` we would write: - -:: - - n == [] - F == rest swons - G == rest - P == not - - tails == [] [not] [rest swons] [rest] paramorphism - -.. code:: ipython2 - - define('tails == [] [not] [rest swons] [rest] paramorphism') - -.. code:: ipython2 - - J('[1 2 3] tails') - - -.. parsed-literal:: - - [[] [3] [2 3]] - - -.. code:: ipython2 - - J('25 range tails [popop] infra [sum] map') - - -.. parsed-literal:: - - [1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276] - - -.. code:: ipython2 - - J('25 range [range_sum] map') - - -.. parsed-literal:: - - [276 253 231 210 190 171 153 136 120 105 91 78 66 55 45 36 28 21 15 10 6 3 1 0 0] - - -Factoring ``rest`` -~~~~~~~~~~~~~~~~~~ - -Right before the recursion begins we have: - -:: - - [] [1 2 3] [not] [pop] [[rest swons] dupdip rest] primrec - -But we might prefer to factor ``rest`` in the quote: - -:: - - [] [1 2 3] [not] [pop] [rest [swons] dupdip] primrec - -There's no way to do that with the ``paramorphism`` combinator as -defined. We would have to write and use a slightly different recursion -combinator that accepted an additional "preprocessor" function ``[H]`` -and built: - -:: - - n swap [P] [pop] [H [F] dupdip G] primrec - -Or just write it out manually. This is yet another place where the -*sufficiently smart compiler* will one day automatically refactor the -code. We could write a ``paramorphism`` combinator that checked ``[F]`` -and ``[G]`` for common prefix and extracted it. - -Patterns of Recursion -===================== - -Our story so far... - -- A combiner ``F :: (B, B) -> B`` -- A predicate ``P :: A -> Bool`` to detect the base case -- A base case value ``c :: B`` - -Hylo-, Ana-, Cata- -~~~~~~~~~~~~~~~~~~ - -:: - - w/ G :: A -> (A, B) - - H == [P ] [pop c ] [G ] [dip F ] genrec - A == [P ] [pop []] [G ] [dip swons] genrec - C == [[] =] [pop c ] [uncons swap] [dip F ] genrec - -Para-, ?-, ?- -~~~~~~~~~~~~~ - -:: - - w/ G :: B -> B - - P == c swap [P ] [pop] [[F ] dupdip G ] primrec - ? == [] swap [P ] [pop] [[swons] dupdip G ] primrec - ? == c swap [[] =] [pop] [[F ] dupdip uncons swap] primrec - -Four Generalizations -==================== - -There are at least four kinds of recursive combinator, depending on two -choices. The first choice is whether the combiner function should be -evaluated during the recursion or pushed into the pending expression to -be "collapsed" at the end. The second choice is whether the combiner -needs to operate on the current value of the datastructure or the -generator's output. - -:: - - H == [P] [pop c] [G ] [dip F] genrec - H == c swap [P] [pop] [G [F] dip ] [i] genrec - H == [P] [pop c] [ [G] dupdip ] [dip F] genrec - H == c swap [P] [pop] [ [F] dupdip G] [i] genrec - -Consider: - -:: - - ... a G [H] dip F w/ a G == a' b - ... c a G [F] dip H a G == b a' - ... a [G] dupdip [H] dip F a G == a' - ... c a [F] dupdip G H a G == a' - -1 -~ - -:: - - H == [P] [pop c] [G] [dip F] genrec - -Iterate n times. - -:: - - ... a [P] [pop c] [G] [dip F] genrec - ... a G [H] dip F - ... a' b [H] dip F - ... a' H b F - ... a' G [H] dip F b F - ... a'' b [H] dip F b F - ... a'' H b F b F - ... a'' G [H] dip F b F b F - ... a''' b [H] dip F b F b F - ... a''' H b F b F b F - ... a''' pop c b F b F b F - ... c b F b F b F - -This form builds up a continuation that contains the intermediate -results along with the pending combiner functions. When the base case is -reached the last term is replaced by the identity value c and the -continuation "collapses" into the final result. - -2 -~ - -When you can start with the identity value c on the stack and the -combiner can operate as you go, using the intermediate results -immediately rather than queuing them up, use this form. An important -difference is that the generator function must return its results in the -reverse order. - -:: - - H == c swap [P] [pop] [G [F] dip] primrec - - ... c a G [F] dip H - ... c b a' [F] dip H - ... c b F a' H - ... c b F a' G [F] dip H - ... c b F b a'' [F] dip H - ... c b F b F a'' H - ... c b F b F a'' G [F] dip H - ... c b F b F b a''' [F] dip H - ... c b F b F b F a''' H - ... c b F b F b F a''' pop - ... c b F b F b F - -The end line here is the same as for above, but only because we didn't -evaluate ``F`` when it normally would have been. - -3 -~ - -If the combiner and the generator both need to work on the current value -then ``dup`` must be used at some point, and the generator must produce -one item instead of two (the b is instead the duplicate of a.) - -:: - - H == [P] [pop c] [[G] dupdip] [dip F] genrec - - ... a [G] dupdip [H] dip F - ... a G a [H] dip F - ... a' a [H] dip F - ... a' H a F - ... a' [G] dupdip [H] dip F a F - ... a' G a' [H] dip F a F - ... a'' a' [H] dip F a F - ... a'' H a' F a F - ... a'' [G] dupdip [H] dip F a' F a F - ... a'' G a'' [H] dip F a' F a F - ... a''' a'' [H] dip F a' F a F - ... a''' H a'' F a' F a F - ... a''' pop c a'' F a' F a F - ... c a'' F a' F a F - -4 -~ - -And, last but not least, if you can combine as you go, starting with c, -and the combiner needs to work on the current item, this is the form: - -:: - - W == c swap [P] [pop] [[F] dupdip G] primrec - - ... a c swap [P] [pop] [[F] dupdip G] primrec - ... c a [P] [pop] [[F] dupdip G] primrec - ... c a [F] dupdip G W - ... c a F a G W - ... c a F a' W - ... c a F a' [F] dupdip G W - ... c a F a' F a' G W - ... c a F a' F a'' W - ... c a F a' F a'' [F] dupdip G W - ... c a F a' F a'' F a'' G W - ... c a F a' F a'' F a''' W - ... c a F a' F a'' F a''' pop - ... c a F a' F a'' F - -Each of the four variations above can be specialized to ana- and -catamorphic forms. - -.. code:: ipython2 - - def WTFmorphism(c, F, P, G): - '''Return a hylomorphism function H.''' - - def H(a, d=c): - if P(a): - result = d - else: - a, b = G(a) - result = H(a, F(d, b)) - return result - - return H - -.. code:: ipython2 - - F = lambda a, b: a + b - P = lambda n: n <= 1 - G = lambda n: (n - 1, n - 1) - - wtf = WTFmorphism(0, F, P, G) - - print wtf(5) - - -.. parsed-literal:: - - 10 - - -:: - - H == [P ] [pop c ] [G ] [dip F ] genrec - -.. code:: ipython2 - - DefinitionWrapper.add_definitions(''' - P == 1 <= - Ga == -- dup - Gb == -- - c == 0 - F == + - ''', D) - -.. code:: ipython2 - - V('[1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec') - - -.. parsed-literal:: - - . [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] genrec - [1 2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec - [1 2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec - [1 2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec - [1 2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec - [1 2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec - [1 2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[1 2 3]] [[] =] . infra first choice i - [1 2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i - [1 2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i - False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] swaack first choice i - False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [1 2 3]] . swaack first choice i - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i - [1 2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i - [1 2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons - 1 [2 3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons - [2 3] 1 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons - [2 3] 1 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons - [2 3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 1 swons - [2 3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 1 swons - [2 3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 1 swons - [2 3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 1 swons - [2 3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 1 swons - [2 3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[2 3]] [[] =] . infra first choice i 1 swons - [2 3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons - [2 3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons - False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] swaack first choice i 1 swons - False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [2 3]] . swaack first choice i 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 1 swons - [2 3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 1 swons - [2 3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons - 2 [3] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons - [3] 2 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 1 swons - [3] 2 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 1 swons - [3] . [[] =] [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons - [3] [[] =] . [pop []] [uncons swap] [dip swons] genrec 2 swons 1 swons - [3] [[] =] [pop []] . [uncons swap] [dip swons] genrec 2 swons 1 swons - [3] [[] =] [pop []] [uncons swap] . [dip swons] genrec 2 swons 1 swons - [3] [[] =] [pop []] [uncons swap] [dip swons] . genrec 2 swons 1 swons - [3] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[3]] [[] =] . infra first choice i 2 swons 1 swons - [3] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons - [3] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons - False . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] swaack first choice i 2 swons 1 swons - False [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [3]] . swaack first choice i 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons 1 swons - [3] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . i 2 swons 1 swons - [3] . uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons - 3 [] . swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons - [] 3 . [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons 2 swons 1 swons - [] 3 [[[] =] [pop []] [uncons swap] [dip swons] genrec] . dip swons 2 swons 1 swons - [] . [[] =] [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] . [pop []] [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] . [uncons swap] [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] [uncons swap] . [dip swons] genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] [uncons swap] [dip swons] . genrec 3 swons 2 swons 1 swons - [] [[] =] [pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] . ifte 3 swons 2 swons 1 swons - [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [[]] [[] =] . infra first choice i 3 swons 2 swons 1 swons - [] . [] = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons - [] [] . = [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons - True . [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] swaack first choice i 3 swons 2 swons 1 swons - True [[pop []] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] []] . swaack first choice i 3 swons 2 swons 1 swons - [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 3 swons 2 swons 1 swons - [] [uncons swap [[[] =] [pop []] [uncons swap] [dip swons] genrec] dip swons] [pop []] True . choice i 3 swons 2 swons 1 swons - [] [pop []] . i 3 swons 2 swons 1 swons - [] . pop [] 3 swons 2 swons 1 swons - . [] 3 swons 2 swons 1 swons - [] . 3 swons 2 swons 1 swons - [] 3 . swons 2 swons 1 swons - [] 3 . swap cons 2 swons 1 swons - 3 [] . cons 2 swons 1 swons - [3] . 2 swons 1 swons - [3] 2 . swons 1 swons - [3] 2 . swap cons 1 swons - 2 [3] . cons 1 swons - [2 3] . 1 swons - [2 3] 1 . swons - [2 3] 1 . swap cons - 1 [2 3] . cons - [1 2 3] . - - -.. code:: ipython2 - - V('3 [P] [pop c] [Ga] [dip F] genrec') - - -.. parsed-literal:: - - . 3 [P] [pop c] [Ga] [dip F] genrec - 3 . [P] [pop c] [Ga] [dip F] genrec - 3 [P] . [pop c] [Ga] [dip F] genrec - 3 [P] [pop c] . [Ga] [dip F] genrec - 3 [P] [pop c] [Ga] . [dip F] genrec - 3 [P] [pop c] [Ga] [dip F] . genrec - 3 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [3] [P] . infra first choice i - 3 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - 3 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - 3 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] swaack first choice i - False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 3] . swaack first choice i - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i - 3 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i - 3 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F - 3 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F - 2 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F - 2 2 . [[P] [pop c] [Ga] [dip F] genrec] dip F - 2 2 [[P] [pop c] [Ga] [dip F] genrec] . dip F - 2 . [P] [pop c] [Ga] [dip F] genrec 2 F - 2 [P] . [pop c] [Ga] [dip F] genrec 2 F - 2 [P] [pop c] . [Ga] [dip F] genrec 2 F - 2 [P] [pop c] [Ga] . [dip F] genrec 2 F - 2 [P] [pop c] [Ga] [dip F] . genrec 2 F - 2 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [2] [P] . infra first choice i 2 F - 2 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - 2 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - 2 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - False . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] swaack first choice i 2 F - False [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 2] . swaack first choice i 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] False . choice i 2 F - 2 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . i 2 F - 2 . Ga [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 2 . -- dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 1 . dup [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 1 1 . [[P] [pop c] [Ga] [dip F] genrec] dip F 2 F - 1 1 [[P] [pop c] [Ga] [dip F] genrec] . dip F 2 F - 1 . [P] [pop c] [Ga] [dip F] genrec 1 F 2 F - 1 [P] . [pop c] [Ga] [dip F] genrec 1 F 2 F - 1 [P] [pop c] . [Ga] [dip F] genrec 1 F 2 F - 1 [P] [pop c] [Ga] . [dip F] genrec 1 F 2 F - 1 [P] [pop c] [Ga] [dip F] . genrec 1 F 2 F - 1 [P] [pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] . ifte 1 F 2 F - 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [1] [P] . infra first choice i 1 F 2 F - 1 . P [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - 1 . 1 <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - 1 1 . <= [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - True . [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] swaack first choice i 1 F 2 F - True [[pop c] [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] 1] . swaack first choice i 1 F 2 F - 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F - 1 [Ga [[P] [pop c] [Ga] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F - 1 [pop c] . i 1 F 2 F - 1 . pop c 1 F 2 F - . c 1 F 2 F - . 0 1 F 2 F - 0 . 1 F 2 F - 0 1 . F 2 F - 0 1 . + 2 F - 1 . 2 F - 1 2 . F - 1 2 . + - 3 . - - -.. code:: ipython2 - - V('3 [P] [pop []] [Ga] [dip swons] genrec') - - -.. parsed-literal:: - - . 3 [P] [pop []] [Ga] [dip swons] genrec - 3 . [P] [pop []] [Ga] [dip swons] genrec - 3 [P] . [pop []] [Ga] [dip swons] genrec - 3 [P] [pop []] . [Ga] [dip swons] genrec - 3 [P] [pop []] [Ga] . [dip swons] genrec - 3 [P] [pop []] [Ga] [dip swons] . genrec - 3 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [3] [P] . infra first choice i - 3 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - 3 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - 3 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] swaack first choice i - False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 3] . swaack first choice i - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i - 3 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i - 3 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 3 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 2 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 2 2 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons - 2 2 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons - 2 . [P] [pop []] [Ga] [dip swons] genrec 2 swons - 2 [P] . [pop []] [Ga] [dip swons] genrec 2 swons - 2 [P] [pop []] . [Ga] [dip swons] genrec 2 swons - 2 [P] [pop []] [Ga] . [dip swons] genrec 2 swons - 2 [P] [pop []] [Ga] [dip swons] . genrec 2 swons - 2 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [2] [P] . infra first choice i 2 swons - 2 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - 2 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - 2 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - False . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] swaack first choice i 2 swons - False [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 2] . swaack first choice i 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [False] . first choice i 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] False . choice i 2 swons - 2 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . i 2 swons - 2 . Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 2 . -- dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 1 . dup [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 1 1 . [[P] [pop []] [Ga] [dip swons] genrec] dip swons 2 swons - 1 1 [[P] [pop []] [Ga] [dip swons] genrec] . dip swons 2 swons - 1 . [P] [pop []] [Ga] [dip swons] genrec 1 swons 2 swons - 1 [P] . [pop []] [Ga] [dip swons] genrec 1 swons 2 swons - 1 [P] [pop []] . [Ga] [dip swons] genrec 1 swons 2 swons - 1 [P] [pop []] [Ga] . [dip swons] genrec 1 swons 2 swons - 1 [P] [pop []] [Ga] [dip swons] . genrec 1 swons 2 swons - 1 [P] [pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] . ifte 1 swons 2 swons - 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [1] [P] . infra first choice i 1 swons 2 swons - 1 . P [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - 1 . 1 <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - 1 1 . <= [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - True . [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] swaack first choice i 1 swons 2 swons - True [[pop []] [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] 1] . swaack first choice i 1 swons 2 swons - 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] [True] . first choice i 1 swons 2 swons - 1 [Ga [[P] [pop []] [Ga] [dip swons] genrec] dip swons] [pop []] True . choice i 1 swons 2 swons - 1 [pop []] . i 1 swons 2 swons - 1 . pop [] 1 swons 2 swons - . [] 1 swons 2 swons - [] . 1 swons 2 swons - [] 1 . swons 2 swons - [] 1 . swap cons 2 swons - 1 [] . cons 2 swons - [1] . 2 swons - [1] 2 . swons - [1] 2 . swap cons - 2 [1] . cons - [2 1] . - - -.. code:: ipython2 - - V('[2 1] [[] =] [pop c ] [uncons swap] [dip F] genrec') - - -.. parsed-literal:: - - . [2 1] [[] =] [pop c] [uncons swap] [dip F] genrec - [2 1] . [[] =] [pop c] [uncons swap] [dip F] genrec - [2 1] [[] =] . [pop c] [uncons swap] [dip F] genrec - [2 1] [[] =] [pop c] . [uncons swap] [dip F] genrec - [2 1] [[] =] [pop c] [uncons swap] . [dip F] genrec - [2 1] [[] =] [pop c] [uncons swap] [dip F] . genrec - [2 1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[2 1]] [[] =] . infra first choice i - [2 1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i - [2 1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i - False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] swaack first choice i - False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [2 1]] . swaack first choice i - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i - [2 1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i - [2 1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F - 2 [1] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F - [1] 2 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F - [1] 2 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F - [1] . [[] =] [pop c] [uncons swap] [dip F] genrec 2 F - [1] [[] =] . [pop c] [uncons swap] [dip F] genrec 2 F - [1] [[] =] [pop c] . [uncons swap] [dip F] genrec 2 F - [1] [[] =] [pop c] [uncons swap] . [dip F] genrec 2 F - [1] [[] =] [pop c] [uncons swap] [dip F] . genrec 2 F - [1] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[1]] [[] =] . infra first choice i 2 F - [1] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F - [1] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F - False . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] swaack first choice i 2 F - False [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [1]] . swaack first choice i 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [False] . first choice i 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] False . choice i 2 F - [1] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . i 2 F - [1] . uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F - 1 [] . swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F - [] 1 . [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F 2 F - [] 1 [[[] =] [pop c] [uncons swap] [dip F] genrec] . dip F 2 F - [] . [[] =] [pop c] [uncons swap] [dip F] genrec 1 F 2 F - [] [[] =] . [pop c] [uncons swap] [dip F] genrec 1 F 2 F - [] [[] =] [pop c] . [uncons swap] [dip F] genrec 1 F 2 F - [] [[] =] [pop c] [uncons swap] . [dip F] genrec 1 F 2 F - [] [[] =] [pop c] [uncons swap] [dip F] . genrec 1 F 2 F - [] [[] =] [pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] . ifte 1 F 2 F - [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [[]] [[] =] . infra first choice i 1 F 2 F - [] . [] = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F - [] [] . = [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F - True . [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] swaack first choice i 1 F 2 F - True [[pop c] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] []] . swaack first choice i 1 F 2 F - [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] [True] . first choice i 1 F 2 F - [] [uncons swap [[[] =] [pop c] [uncons swap] [dip F] genrec] dip F] [pop c] True . choice i 1 F 2 F - [] [pop c] . i 1 F 2 F - [] . pop c 1 F 2 F - . c 1 F 2 F - . 0 1 F 2 F - 0 . 1 F 2 F - 0 1 . F 2 F - 0 1 . + 2 F - 1 . 2 F - 1 2 . F - 1 2 . + - 3 . - - -Appendix - Fun with Symbols ---------------------------- - -:: - - |[ (c, F), (G, P) ]| == (|c, F|) • [(G, P)] - -`"Bananas, Lenses, & Barbed -Wire" `__ - -:: - - (|...|) [(...)] [<...>] - -I think they are having slightly too much fun with the symbols. - -"Too much is always better than not enough." - -Tree with node and list of trees. -================================= - -:: - - tree = [] | [node [tree*]] - -``treestep`` -~~~~~~~~~~~~ - -:: - - tree z [C] [N] treestep - - - [] z [C] [N] treestep - --------------------------- - z - - - [node [tree*]] z [C] [N] treestep - --------------------------------------- w/ K == z [C] [N] treestep - node N [tree*] [K] map C - -Derive the recursive form. -~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - K == [not] [pop z] [J] ifte - - - [node [tree*]] J - ------------------------------ - node N [tree*] [K] map C - - - J == .. [N] .. [K] .. [C] .. - - [node [tree*]] uncons [N] dip - node [[tree*]] [N] dip - node N [[tree*]] - - node N [[tree*]] i [K] map - node N [tree*] [K] map - node N [K.tree*] - - J == uncons [N] dip i [K] map [C] i - - K == [not] [pop z] [uncons [N] dip i [K] map [C] i] ifte - K == [not] [pop z] [uncons [N] dip i] [map [C] i] genrec - -Extract the givens to parameterize the program. -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -:: - - [not] [pop z] [uncons [N] dip unquote] [map [C] i] genrec - [not] [z] [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec - [not] z unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec - z [not] swap unit [pop] swoncat [uncons [N] dip unquote] [map [C] i] genrec - \............TS0............/ - z TS0 [uncons [N] dip unquote] [map [C] i] genrec - z [uncons [N] dip unquote] [TS0] dip [map [C] i] genrec - z [[N] dip unquote] [uncons] swoncat [TS0] dip [map [C] i] genrec - z [N] [dip unquote] cons [uncons] swoncat [TS0] dip [map [C] i] genrec - \...........TS1.................../ - z [N] TS1 [TS0] dip [map [C] i] genrec - z [N] [map [C] i] [TS1 [TS0] dip] dip genrec - z [N] [map C ] [TS1 [TS0] dip] dip genrec - z [N] [C] [map] swoncat [TS1 [TS0] dip] dip genrec - z [C] [N] swap [map] swoncat [TS1 [TS0] dip] dip genrec - -:: - - TS0 == [not] swap unit [pop] swoncat - TS1 == [dip i] cons [uncons] swoncat - treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec - -:: - - [] 0 [C] [N] treestep - --------------------------- - 0 - - - [n [tree*]] 0 [sum +] [] treestep - -------------------------------------------------- - n [tree*] [0 [sum +] [] treestep] map sum + - -.. code:: ipython2 - - DefinitionWrapper.add_definitions(''' - - TS0 == [not] swap unit [pop] swoncat - TS1 == [dip i] cons [uncons] swoncat - treestep == swap [map] swoncat [TS1 [TS0] dip] dip genrec - - ''', D) - -.. code:: ipython2 - - V('[] 0 [sum +] [] treestep') - - -.. parsed-literal:: - - . [] 0 [sum +] [] treestep - [] . 0 [sum +] [] treestep - [] 0 . [sum +] [] treestep - [] 0 [sum +] . [] treestep - [] 0 [sum +] [] . treestep - [] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec - [] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec - [] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec - [] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec - [] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec - [] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec - [] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec - [] 0 [] . TS1 [TS0] dip [map sum +] genrec - [] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec - [] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec - [] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec - [] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec - [] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec - [] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec - [] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec - [] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec - [] 0 . TS0 [uncons [] dip i] [map sum +] genrec - [] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec - [] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec - [] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec - [] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec - [] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec - [] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec - [] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec - [] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte - [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[]] [not] . infra first choice i - [] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i - True . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] swaack first choice i - True [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] []] . swaack first choice i - [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [True] . first choice i - [] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] True . choice i - [] [pop 0] . i - [] . pop 0 - . 0 - 0 . - - -.. code:: ipython2 - - V('[23 []] 0 [sum +] [] treestep') - - -.. parsed-literal:: - - . [23 []] 0 [sum +] [] treestep - [23 []] . 0 [sum +] [] treestep - [23 []] 0 . [sum +] [] treestep - [23 []] 0 [sum +] . [] treestep - [23 []] 0 [sum +] [] . treestep - [23 []] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec - [23 []] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec - [23 []] 0 [] . TS1 [TS0] dip [map sum +] genrec - [23 []] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec - [23 []] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec - [23 []] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec - [23 []] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec - [23 []] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec - [23 []] 0 . TS0 [uncons [] dip i] [map sum +] genrec - [23 []] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec - [23 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec - [23 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec - [23 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec - [23 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 []]] [not] . infra first choice i - [23 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i - False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] swaack first choice i - False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 []]] . swaack first choice i - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i - [23 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i - [23 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + - 23 [] . sum + - 23 [] . 0 [+] catamorphism + - 23 [] 0 . [+] catamorphism + - 23 [] 0 [+] . catamorphism + - 23 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + - 23 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + - 23 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + - 23 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + - 23 [] [[] =] 0 [uncons swap] [+] . hylomorphism + - 23 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + - 23 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + - 23 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + - 23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + - 23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i + - 23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i + - 23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i + - 23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i + - 23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + - 23 [] [pop 0] . i + - 23 [] . pop 0 + - 23 . 0 + - 23 0 . + - 23 . - - -.. code:: ipython2 - - V('[23 [[2 []] [3 []]]] 0 [sum +] [] treestep') - - -.. parsed-literal:: - - . [23 [[2 []] [3 []]]] 0 [sum +] [] treestep - [23 [[2 []] [3 []]]] . 0 [sum +] [] treestep - [23 [[2 []] [3 []]]] 0 . [sum +] [] treestep - [23 [[2 []] [3 []]]] 0 [sum +] . [] treestep - [23 [[2 []] [3 []]]] 0 [sum +] [] . treestep - [23 [[2 []] [3 []]]] 0 [sum +] [] . swap [map] swoncat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [sum +] . [map] swoncat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swoncat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [sum +] [map] . swap concat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [map] [sum +] . concat [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [map sum +] . [TS1 [TS0] dip] dip genrec - [23 [[2 []] [3 []]]] 0 [] [map sum +] [TS1 [TS0] dip] . dip genrec - [23 [[2 []] [3 []]]] 0 [] . TS1 [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [] . [dip i] cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [] [dip i] . cons [uncons] swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [[] dip i] . [uncons] swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swoncat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [[] dip i] [uncons] . swap concat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [uncons] [[] dip i] . concat [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [uncons [] dip i] . [TS0] dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [uncons [] dip i] [TS0] . dip [map sum +] genrec - [23 [[2 []] [3 []]]] 0 . TS0 [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] 0 . [not] swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] 0 [not] . swap unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] 0 . unit [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] 0 . [] cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] 0 [] . cons [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [0] . [pop] swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [0] [pop] . swoncat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [0] [pop] . swap concat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop] [0] . concat [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec - [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec - [23 [[2 []] [3 []]]] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[23 [[2 []] [3 []]]]] [not] . infra first choice i - [23 [[2 []] [3 []]]] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i - False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] swaack first choice i - False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [23 [[2 []] [3 []]]]] . swaack first choice i - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False] . first choice i - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i - [23 [[2 []] [3 []]]] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i - [23 [[2 []] [3 []]]] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[[2 []] [3 []]]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[[2 []] [3 []]]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [[[2 []] [3 []]]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[[2 []] [3 []]]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 . [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[2 []] [3 []]] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + - 23 [[2 []] [3 []]] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + - 23 [] [[[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first] . infra sum + - . [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - [[3 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - [[3 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[3 []] 23] [not] . infra first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [3 []] 23] . swaack first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 [3 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . sum + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . 0 [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 . [+] catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 [+] . catamorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 3 23] [[] =] . infra first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 3 23] . swaack first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 3 23] . first choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] [pop 0] . i + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . pop 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . 0 + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 0 . + [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 . [] swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 23 3 [] . swaack first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - [3 23] . first [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 3 . [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 3 [[2 []] 23] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] infra first [23] swaack sum + - 3 [[2 []] 23] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . infra first [23] swaack sum + - 23 [2 []] . [not] [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] . [pop 0] [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] . [uncons [] dip i] [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] [uncons [] dip i] . [map sum +] genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] [uncons [] dip i] [map sum +] . genrec [3] swaack first [23] swaack sum + - 23 [2 []] [not] [pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . ifte [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [[2 []] 23] [not] . infra first choice i [3] swaack first [23] swaack sum + - 23 [2 []] . not [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum + - 23 False . [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] swaack first choice i [3] swaack first [23] swaack sum + - 23 False [[pop 0] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [2 []] 23] . swaack first choice i [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] [False 23] . first choice i [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] [pop 0] False . choice i [3] swaack first [23] swaack sum + - 23 [2 []] [uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum +] . i [3] swaack first [23] swaack sum + - 23 [2 []] . uncons [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [[]] . [] dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [[]] [] . dip i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 . [[]] i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [[]] . i [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 . [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [] . [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] map sum + [3] swaack first [23] swaack sum + - 23 2 [] [[not] [pop 0] [uncons [] dip i] [map sum +] genrec] . map sum + [3] swaack first [23] swaack sum + - 23 2 [] . sum + [3] swaack first [23] swaack sum + - 23 2 [] . 0 [+] catamorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 . [+] catamorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 [+] . catamorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [+] . [uncons swap] swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [+] [uncons swap] . swap hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [uncons swap] [+] . hylomorphism + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec + [3] swaack first [23] swaack sum + - 23 2 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + [3] swaack first [23] swaack sum + - 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 2 23] [[] =] . infra first choice i + [3] swaack first [23] swaack sum + - 23 2 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 2 23] . swaack first choice i + [3] swaack first [23] swaack sum + - 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 2 23] . first choice i + [3] swaack first [23] swaack sum + - 23 2 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i + [3] swaack first [23] swaack sum + - 23 2 [] [pop 0] . i + [3] swaack first [23] swaack sum + - 23 2 [] . pop 0 + [3] swaack first [23] swaack sum + - 23 2 . 0 + [3] swaack first [23] swaack sum + - 23 2 0 . + [3] swaack first [23] swaack sum + - 23 2 . [3] swaack first [23] swaack sum + - 23 2 [3] . swaack first [23] swaack sum + - 3 [2 23] . first [23] swaack sum + - 3 2 . [23] swaack sum + - 3 2 [23] . swaack sum + - 23 [2 3] . sum + - 23 [2 3] . 0 [+] catamorphism + - 23 [2 3] 0 . [+] catamorphism + - 23 [2 3] 0 [+] . catamorphism + - 23 [2 3] 0 [+] . [[] =] roll> [uncons swap] swap hylomorphism + - 23 [2 3] 0 [+] [[] =] . roll> [uncons swap] swap hylomorphism + - 23 [2 3] [[] =] 0 [+] . [uncons swap] swap hylomorphism + - 23 [2 3] [[] =] 0 [+] [uncons swap] . swap hylomorphism + - 23 [2 3] [[] =] 0 [uncons swap] [+] . hylomorphism + - 23 [2 3] [[] =] 0 [uncons swap] [+] . [unit [pop] swoncat] dipd [dip] swoncat genrec + - 23 [2 3] [[] =] 0 [uncons swap] [+] [unit [pop] swoncat] . dipd [dip] swoncat genrec + - 23 [2 3] [[] =] 0 . unit [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] 0 . [] cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] 0 [] . cons [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [0] . [pop] swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [0] [pop] . swoncat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [0] [pop] . swap concat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop] [0] . concat [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] . [uncons swap] [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] . [+] [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [+] . [dip] swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swoncat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [+] [dip] . swap concat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [dip] [+] . concat genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap] [dip +] . genrec + - 23 [2 3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[2 3] 23] [[] =] . infra first choice i + - 23 [2 3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i + - 23 [2 3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i + - 23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] swaack first choice i + - 23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [2 3] 23] . swaack first choice i + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i + - 23 [2 3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i + - 23 [2 3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + + - 23 2 [3] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + + - 23 [3] 2 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + + - 23 [3] 2 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + + - 23 [3] . [[] =] [pop 0] [uncons swap] [dip +] genrec 2 + + - 23 [3] [[] =] . [pop 0] [uncons swap] [dip +] genrec 2 + + - 23 [3] [[] =] [pop 0] . [uncons swap] [dip +] genrec 2 + + - 23 [3] [[] =] [pop 0] [uncons swap] . [dip +] genrec 2 + + - 23 [3] [[] =] [pop 0] [uncons swap] [dip +] . genrec 2 + + - 23 [3] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[3] 23] [[] =] . infra first choice i 2 + + - 23 [3] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + + - 23 [3] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + + - 23 False . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] swaack first choice i 2 + + - 23 False [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [3] 23] . swaack first choice i 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [False 23] . first choice i 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] False . choice i 2 + + - 23 [3] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . i 2 + + - 23 [3] . uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + + - 23 3 [] . swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + + - 23 [] 3 . [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip + 2 + + - 23 [] 3 [[[] =] [pop 0] [uncons swap] [dip +] genrec] . dip + 2 + + - 23 [] . [[] =] [pop 0] [uncons swap] [dip +] genrec 3 + 2 + + - 23 [] [[] =] . [pop 0] [uncons swap] [dip +] genrec 3 + 2 + + - 23 [] [[] =] [pop 0] . [uncons swap] [dip +] genrec 3 + 2 + + - 23 [] [[] =] [pop 0] [uncons swap] . [dip +] genrec 3 + 2 + + - 23 [] [[] =] [pop 0] [uncons swap] [dip +] . genrec 3 + 2 + + - 23 [] [[] =] [pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] . ifte 3 + 2 + + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [[] 23] [[] =] . infra first choice i 3 + 2 + + - 23 [] . [] = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + + - 23 [] [] . = [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + + - 23 True . [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] swaack first choice i 3 + 2 + + - 23 True [[pop 0] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [] 23] . swaack first choice i 3 + 2 + + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] [True 23] . first choice i 3 + 2 + + - 23 [] [uncons swap [[[] =] [pop 0] [uncons swap] [dip +] genrec] dip +] [pop 0] True . choice i 3 + 2 + + - 23 [] [pop 0] . i 3 + 2 + + - 23 [] . pop 0 3 + 2 + + - 23 . 0 3 + 2 + + - 23 0 . 3 + 2 + + - 23 0 3 . + 2 + + - 23 3 . 2 + + - 23 3 2 . + + - 23 5 . + - 28 . - - -.. code:: ipython2 - - J('[23 [[2 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]] [3 [[23 [[2 []] [3 []]]][23 [[2 []] [3 []]]]]]]] 0 [sum +] [] treestep') - - -.. parsed-literal:: - - 140 - - -.. code:: ipython2 - - J('[] [] [unit cons] [23 +] treestep') - - -.. parsed-literal:: - - [] - - -.. code:: ipython2 - - J('[23 []] [] [unit cons] [23 +] treestep') - - -.. parsed-literal:: - - [46 []] - - -.. code:: ipython2 - - J('[23 [[2 []] [3 []]]] [] [unit cons] [23 +] treestep') - - -.. parsed-literal:: - - [46 [[25 []] [26 []]]] - - -.. code:: ipython2 - - define('treemap == [] [unit cons] roll< treestep') - -.. code:: ipython2 - - J('[23 [[2 []] [3 []]]] [23 +] treemap') - - -.. parsed-literal:: - - [46 [[25 []] [26 []]]] - diff --git a/docs/Library Examples.pdf b/docs/Library Examples.pdf deleted file mode 100644 index c534cacbc306d00ce08cde278bf40a42847bcb21..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 198245 zcmb5WW0d6IvMpM+U0t^AF5B#~ZJS-TZQHhO+qUhh+xy&o#yjur9`F9|`jF$dM&_5y zm@!vG%(;?8PDq4?ftCe|WM*M-1&R@$9^Xda9EytzicZnZ)(D?YR^R-WqZJgL3_b%r zJrtdYnZ1J}K06a56rGfjwTYuCJ_8dQJN|#If4ytzXk?F1Ct|7RXe4B0U}I0{R5lE2FQq=Kh1g%EYJ~lx&JgrBN8MV?j$vjd z1iy?OQd$Noao^HS0JBLP@j$ByF^QcojsoDkKs+dU{Y(fM7{0C1su1MfkMzW$d0T}Z zCbV;Y4|*uqCCa%Thlv=lEOexyy;2r4QNLaACa9y2fgThB-L4^I5v&!ORQ&zh0EVR9 zQw%k60Xu#lG^m}WJxJCZbyM5@KFG)n_8qfo2+6*k8aUS>RUpnjS6TM5nw10JV_iC- z!1y4pn~Ywrn~nhjOn^>#WH`8|70Zj1CJLo9`k~tt>G3>nBDC9=F zpx6?aE6&6$z}&t@G=m_X`=9}~FCyl6Nj{c-&h*rgkX-5>il(cL^y0G+GA$v zVZst!b}*IA(fW|zn4uebT+$p$eD0a^q6KoyeNFdlv(X^P;J(e+;pos9z@s>38VBS- zEa&D@M;#^5vrqP#FOO-oJ_M?t#$WXsH#^*>b>0KA1m3d!=TF~?1oC2y&4N8@0cNO@@?wE5m{wX0FLQnr2R-Qo z6Iuak&AL#%-tyL#xOGupIG9|y49UDgz6S1~+~G~s)P|^XPR>hK$~iJc(Wjr?bjx+^ zLl4xKljtT|t93CW=`Hs~jrB48Dw=7zf!pqH8e(~i06b03V-h&8X`k)RjGJTjrIf7? zO&O5)?4CLv$%m7)PO4PkMg)n)YE*49>wZcR?+1*X)Gir=UNrGgMtaIEY{s8P%L4U@ z^=ZBO;F>cI|)x?OY!?S?O z{uVcH55C;HVDS5kk!t~*JYc=3Wn@C{@X`H2K&WNr9wvip%$*pq6iI4C)4Le?;9W&X9kW3w zWu6tzC(`z3?z@4>&?D)z(uZ%cCOivmoNGg8?&Vq)o5a9kDO>-K5OLW`93Qor*R7vO zsXyw!oIK#sEQO{dNKWIjmyM7#RQhQsW%r$PFk88Az1khtxO2%dX!7C`QzvGO<%k`U zl1V7mIM=J$N~QLDWsFTO`)x!`9J|k9teQV(+d@y?HPW`hJMBwVAe9fo9=>j@J)T)s z6iQx-#Z@dw_Q5qtZ)bfQYcft2vW)u{hZyFl>zF37rWCY&RuNvP;lJ3xw3NdZMhUal zc6~U-XCOpTVDUv709bVoY(q>2ztAj$Po!>|o6?T?4qs1RBZ z19A(*H)CwY>~(L%UAvw=on!sYbHz06!sx8LIH_%YT{(J$2aG!koeU5QMX@JDdE3@G z>PFB_`GWeox@Veu)Vv6}6vRmrQUw1nn*%I9ms$tt|p2KH9061!HITES;)PvRVgmT{KJ^@tjFA@pwy^BGf7H z>?4m}Tql;CYEnU}*fo4HdSR~AQP&w^bRp(C{8iHy$jS}Ft;7g0?lKwpSK!&0f%GwK z7?FKt%$@yOy(6%RG$jh9x#;16VT(GxC4}+IfJQO z4MORb{!)CNYmJkD8fLr}1+bczkclFXyvsJ6N5o1{#YQ^Hju4j`uq=t}Apla%yOTq) zvN>SHP97wF2*BA@|K}H$YQrJLA2S?Ol1T0zCY?BmaFG5UA>dO}*lUO%>CN0wjx!b) zcVf{m8YLl5c%b?$LIBzXPc3~vTG>S$>2*$r5%13TT6d_Z=MNoHr6Hi*Q9`5jcvOzo z;Bxn`j&L_**!Y0}8$+ff8H$cJQl_vl!R2meUVK>m1KD{icU^jVj#}^d3(2S2VT9UL zzj(^vDENC-ty1G5>Go!T zi;XJMHtX~-oyRH=E4fnyWnI+kJv042ji%9pO_J+^%2biH15cL4yF=a4T2txCcqhq{mkCKBr5k1pyNERlxhCC5ip`Mk z734*{_OZbe5=jdadi{DVTdC5L*)C=h+v*`UBN)!XV+8f6J?v?es?Zgc6cB4^4$4{DBsp{3_-O<*O zYSmt0S_ixVM-|m9zp671Tmu@Mwwi4*8bmT$S}^V`&~EZt6|`xR1qVz>S?GMY*@?Cq zOzA#xOh65SmN!N5zFHik9UUIz?Q6f>|7M|sm*ezVR@-Fvyf4Bin+O$akK{%G4=v`- zNC5w8L9vNupzH|E(-h`*w2`|1Ss(tfUF+1|CAfDr`dq(H?}4!Kj=QY|bhXYwTbfuz zd2sBl2)9Igo>@vROWY|=))^YanSt}QB8lbVWl-{I;tuv$ckg5 zG(-kIj~!87j3m4UG<6*-cLxJrs-~gla+4N3bHBpM0Pe`jjakvyj8gHkJU3uy+=z_T z3d7Qjb*7^?hdvejB%|}#_p98p_q}M_c>Wm;Iz=qTdv{m4_%D}lI z7wpP+@7!q(l$2qKCD!Pf!kZq?SGT4Tc60?Tkq20}q|ryviiG|XIf$>axe;K6iS$1K ziD~W{Rb_O4&X2u09&Ox;NXD|?z1ecr{FKAl*y37R7i?|nHqd^w`L-aejJTboGka{izFN^1D`h&W zJ~j_6_hwLlwc0-qe8_TmS~qPxcYoIF*IS zlbB^n@yP`ZwELlr9*hh2%5YJ4H-2t@jFJ-obDK#Gi!G3pkH{>v$G;d_$G_Jqt?P+} zppKSS^)m=wt>PzILkvo2m%Ey#t_o2Lv{=n7orRs6NoIj)&4vs zOO5eL7%>5SwEqiD%ES+mmO_k1tceuc=SL<&B@Akgm~sr4=jxguiog6W1rYAlc%KN~ zYM&W$+?*n`mN;f;U@ob&T*Jn7Qg$M>?@U%29b-fK{?*Q7N4|?l1OMkl~;w{%_bZUmJp1hoq5S+rxEASmaQ^44PgT!3Z);}XsZfbCcSLFVBZOU zi8uqpe@2{zh5jE$yzx)>kk0q7?qR};-@ND^tSZr2WzAqb^2leThTp9QYF>I#XB#k` zJmw;tJQ>4s|N1?GJ0RAiZ)86r_cL~?i#H^Nn3nr;`{Du*xPJjcAV+>>i z5>6SsX^pWjT!8~PANe5q{f_4j=Ma}P?yL}0PO2TbV-UnqNU-02uI{KAHbu#UrPkra zQ|464Xyz`AtF7U9EN!ysJ6JAWtCVRtNEGglV6R7erOu_*1Kh#`VQ{@qbB})8+yzZc z^W(VocljpU6KT0^EnufTNS8qUkA=(NQ{=Stvu$b6Xc#DK`Qmb=>=>t!dwp29jf|sN z;-}FFTW@SA%0|LIh_RGyUn^088l7Od0sb$fsX{5gp+jNvINeJ@Y%PC~<~rNj(jVX| zkJc#mPU#h@a>@B4wOj+^G2oB5Rnrb#{P^261UGlXkz?#tVr)6uEvhzxE94*sW4Lh`+Uhqd3IuUHaV@@wr z?rsk)LW}VT5l_!T-AeRRbfr5wKmb4D}9^#6rgp|V3Lq4 z^Bysdz%Gv#Sg{5=L~QB~)=1mrm+91|1Gm+_xLkJGQ(wR%ig1*FgB{C%!j75!|K^yI zw8@}H=(?w(eneoU7X z-hVd+L%8sTbjAraIe6!iSe9U%?o>)Te3k;THDNN2+=qf0muw0}t!R3Mbtj&)gAZ$9 z%ML^g4i~dEO4(80*Y|D2@GN_E#L4X+1Op}!NnMGz)rgA|Qej!t^5!Q17I5rmW-RcH z*xTKsm=y9in_~$v_&H{q&lTkE_i@CIczGUmU^TnwB0TR|yf3)8?A7Rjg^l|x_-n3f zFue(C>a!hktu+Ic4Rcox$CvL_+-`Sc5Y=041M`6cKMjyL0S8e4D~8LV_ek`U1Y@)` zb`HBjV}g1jm=Mr+WhjoB*inusE>1SA-WtSBec7cZ|J@0;x{kWnB6fqhgPmAn4Nsmw}Fsx zy?0{{ey)Gc7yWUXCDPs;Y;$!FiQ1I#*}Nug=(x41w(t0%J*`B`yrBZ&uO%ILESzmN zj|`cg{2R@JPV8LM^I4%LZ+_R*Z1bYo$ItYHQa}T85%YZWjSa)zis!X*VCUAYgW6oZ zwaC%%ZV$-4Kub-3!wkoNVup#4Qz8a6F^pZr6ZO%EX`cjKiJZZ%DKLzdi?{t_8R=D$RSnPE>LbOoi16qj% zu*7t@6ok_o0+6Z@NEF_J(Ms-q?T_?x-GUO)lB(J*KH%}|0i3{lF`*5vG4Up0?tui? zhP9Jc!-fOSEa2<}w8mi+SLlX8_qOQKLYNrrf)FhQ#4*D%cH1;h%0w{)jaVpMSrc#p z7n!YPl0^$0bI0m#;6Q$g>OoSdfw^~OWM@6Im}VR!l;b}&kF`;;L2m#JQlHDjp6XHK z5{=#CvUXdaPl~Ep!5z|kw8Ox#Q}6DTp;qYG!rLI{SKXJhicZ6EEm$r;ntduMlhrI= zJ-AsCvBmHKE@zK!rqUV};75P(tMqT&N|toTJ@`lw#ngfto(J$>N%H-ErG57-uG)|K zA#Eb1^OfItA0!VUDVm@^vmk={EPMw`bJ=40pV4Lff3+0k9%(I9PaYss=0LF7iwA^qj`Jj+0nh5}p80YTV1 z$fLUr2O4db z#~VXr6Au#xox=g5iNYu7EEM4uycfbmOK2dEf)(Wlo&GzbMJxm_o~SX9gj(}b9;hB@ z1adiqB9Aa&r(kfL=Hf z{2TOH_g+5%z!Fr6CLc?iV`VJq%R|XR~LnDwTK{2jiEchb^6lMZ_ z0vC*Ek}AwE2RgmfF+j@z(W0!Lin17imHoVgpqwVK5WW}Nj92TuF0GG4_EJvrbY>R2 z;^5opa6OzE&{=UHJeUqz3Nwht4DzNs!OpeUjjCrh6RO`#%6aNNW?EB>upLQ z$9xd-*gL(q_|NMlPIDR$$(F|8?j}|0r+XU;bK`*61R zF3X5j*eVI0Itt2p`uKQsaP6F)d{#q1Ts>SygYc*vINV?}MeTkBV=xDFo19`Jputto!Aot zoiXr_Te9J*u@~RbTP4+aXI6nPcJATF=AC%D-j?y2>NKTDQn{#}u!_E@^)>N_FZ}DO9}@mAa2gx}Nb3X;i7VEdI^8OE{A6qnHJk zWW>Ry85#DL_9M$=CLx);o}|5i?jB=_x=&V1a^T95m0koYz9bB+wxz)P6~kavivBlQ z`xs?#6WP|`^mU-4vrRK(EBa*#A%J+&iMp`LH~|v$mWX8WY=CGhgtmvw7)>!bPP&S^ zG)84V%fO58XMo>>ho*1%Fg@^<-1t&Na7Scs__BU#6;2W;`jzgi`=0mY*(TFD>7rrZ zg=T#za4X8-reiP3+owcJ!%2GC2d#)sT~gRW0DxBkmjg+8te^1W7Ha>klmAl}{Xatg zzf~a?_J3Y1bt+0nuhIWY$oJGZ_BoFp5SK}8GM883R%(@36b|(*!J7DKtn&GsX^1T` zW3J*i2W^nShG%mW$+3zcgT{n=;l=QNBWz4;(wdZpVnLXoUpf^cqd=-85SB)Ly0!Wy z_iC!d1)!PH!;w0kLXk;$vkNZk3ZHIAirlA$-5;$yz~6N``8)`NeU(I*M#h+n6e$p2 zF%vZ4g29LaYaJsZbrrRpgCAR`DNZeRE9b~cqYjx=$e`aQ_zuS8g=HM`0Hh2Rj=1Ng zY*qjMU4eg!TCs(Xil1KA6$r6UT(fIRFp0_>_w2@%R(H?4Tvg#|(4P^&Gg!|BOeQm6 zN0c}xRnSu#2%xh(t7#{!Lzw!@-^Ao;%F!5oG~(?`Vva#DIK;leGz)GiU2NvZ_tp5& z?r6{nJ^{q_kND)a?S0PAK5Q-2&_Hj^?v2L(yp9omdJ zAADg+N}VZfgGl_72(<5|psCS1+E4b3Wxgf2M8A9|*Vj6lPPeOYrl?NZtoc)|8bt3! z@z*>t3g6)|$chkFgYzdSqbV(J?TFJDa^W-rY^y^Wb`VAMz^XQ630sQl+3@oE>ga zNYdlO{`?0ufVP*-ogudyt~2z%H!}zCoxRUoKJrYD$IH;StJ6(wEIFO`?p{&hLb8FT ze^5HYT}tVOePW?x+=UJw>py|7t6zftXGy`t^p`0m>;FY5-a;p_~7S4vXr~AO6ucR-%witJv`T$tL8f23nWeTJ*aCkTSf!r0yb5pk7Dvu@6l@$ z+c{zLKBHHJL%q1fhWL6j_ioqz8*>kVNz!j*6C?K=zJSaf1C@Y`7W_`i_fSq$yU<2^ z59a2N)rmEuMk_MxxtsmP9~jLOuT*E~C>Fi#skMXHc1}(_i8Z?@)PuQ>Wk1k2o`~t* zU?{v}H^Z+3dXY*(B>W)0RPk$?TpcoTq_#*4u&Qx5^vT3wldAvT8T z*WBj_P*8<*7n;PjkOMJ-n*YMN!H#E<3YN+iNp=y^(pWfCE4*+_pt4{oNB~tWn;#zw z&-F76f#mMY(Ld&b$eWoIU}!$V{W$5)=hbaJMm$-^E*oBk%_ICL?HZkQidUa> zGSUYDFRC{BZ9kN5D8%O~DQGC0j!G$|+8p8IKKH8$>-Udh^_Q+Bm;>M2DRJGI3PaF#HbZMg3Ak*KOVUdIdsV&sIgpalAacP5jy_mbC?jXP4NeNwsg zinanI2^CLPjJwVFu$mA_xNgW}k-idcs8zA9J~E>Cb{NfA=!W8bz`uqp$0f<4ZhSx$ z>w2}l!G_et^m{XJ&(RFZOSbUk7g@)bqiFBG;hf&kpP`z~n^)Y%(G5C7LQ1Ti!kE23MkMlj9IN=hi zn?1Dr$pT{{*8>o~Cc8=|=Vt5mCy2g#GgXd^ZSEW=JO!gnX3sm)ax~n$jYK^MKyd(? zIe9zdbbV(^hkLLTZl`<^Lt7m+b;37Q>Az)@&f97h?V|5v0_+Yz9Myna5krIaU`enf zIwWgZhO|{IF!IctE$;Y79cyiVt)N+yyY$zkdw&N4z19)oo=NLuwf&@)jYq>dk5`y9 zuRrf!MJFM$^XV*8q4$~9Xe`<|d#I6LaM1#i48UQ7qBQZg=Y`}OOxSq!~gw2R0G zA^03WOwa`uKhAGpA`@94PJlj1N6r>Ya;dxOy_U9myvk8ew_sD()&$_qZpPSpY>Ta1s7)J&i&rD6`T>k^gfr3aD$wy6AqY_}Rg#fz zCv2G#J@j*zKLjaFoQj&SfQ{8=CK&HWy)2p&nlP2eshybMoR#0XDt8HN3mBL{2wDjJ zMhQX=-0gtc0h}fLb5+5M%`~{HMs(6QR*V}uFcK6|8p43(=6~fFmOv=oAtowQ_T%7= zwQa0At<~Gpo)rBC$TCix`Af1f|7B3kz|8RPk>NklnkD~qng2?*8?>@SggscpG)a>^ zDTk949K4_VFMN^_gP}ro#HgI#JkZqSSPeoP(QmqZJ3PD>w9fShw4-s)CabZJ)8+Nc z#}TASs)LI5j}*CmNCZ}S1*8$<2j+>I#fz2%sZ!N+)_q4_D+fwlmFvb@&g-j_i@}Ec zB=Sjp5}}E{9(EtoOyVN0r21JF0wa;{Z*Li8WJfel18J&Lu`io~T~@4v*r!A;0r-kO z&<|rFw4AKa5M6n=q(k_lZfQ? z`02S9@OVtAxkdq_#6&L4%S)&C`E^)kMLZ7LQvkX#h*Qk4j1AjD_x_l`b9fixmE5n1 z31D_$i$i~PZXC6BMOQq&S;-f$(r^Nl7>!5#%;rUIPeLZZgtCpcX}zzz08`bvf|dxK zzGVcJ!N;!rQu)A)y?;r(HepLhz(J@)J4yO0TulvBF)W)0oLk3gi+&Gq*M_9e z#?y}-baNl+HwX4=yUt-n&pz+#lDi(Bu`P-T48*aaCmcYlYZMhY0YoMO?VR>i zr*ji)n84A3$1N>@3c;QsT?WYlsAaod?F#QtPM`?S8KSxIPjJTkjW$Y&Xc3+UyD+tc z7njX<%~{o%D1Sj%t^iuDEPI^{SCR-4xhw-*lY5~lL)tf`341p}gAxKvyws+Fx{7%% zbnJk)j!WBjNF54>4h4b0l{ua!E@62-#XkQd1wMg`#KpQ0*N2qh&E87yNo@qneybKo zl`Exe2-de3Da;XbET%wP0579p3$bj})Vb@ih}qhb(qeBL5a97jC5GdipTma^r$qCC zFU7hbyrfg)jDESP;^a4#-|*c2NvB0C88u-{BGg!~^9_eh7m}8EN4cu^zWO^j|n0#P~rsqhwCVYoj ze7-6i^N(3;Ucca{pJUx_Xl4>>7}(=a5ix{GLl=o$yqtZ;u#=T`e>9hQHWXICp?Mdz zTnEy3g)J@9mAr#XA17hp<#tU^rw8Gr6%a&Ves+ofNMjciMfUO`#4Q}xlW}UhEh$Y` zV%JKXtWNDS#pqaZ{Zbb~o`{YPCymJOFUZKmjm>nJp|opO)0;nVF8?+#EsA}=m7)|) z@j>K`5=1B>@?tn=M?^t!pos^SqUj3t%;ABl=~a2|3wF4U|{*jtlp_2 zX|w-_)&Dq%PW3LOCnO5U)j*%-^pTnQ(8Y8g_9lI6O*JC56HlBzt~rr{>&VBqtmK%3 zZA&I#x?hj@hn!fW&Np;gTfW*_-d>~JWrXs4z^3#sT_a-YQ#b+PA&oZF2Bz%qZWa&! z3|en(50S=jl3#c}pi+MMV!e;gf1+Y|-V`y(yat>Fo(?WUFOT0HsX^N*4B<7n1c2i1 z2u;5&eNH+VYl{(zu(0wRwX<9@uYRKrdi3cU=+W2vP!OALNg}K;L{A7dgu9SrR6KU% zWQ*-7$T{Owk5fDg?g{7CkM!K!Yj9-F+7haiWlg2qLSpE@3TpWR!-cciTHT6OA*I{lhSHr^t$?ho4R?PtV)kg3#0kPbUh!Q0(qAnb%M< z*gZPU_KqRP`s^_~?D4>{uQXV1uRTX!(opI!U>$h5C}9-vDn=Y$O)=mtJ5Dq2k2r^? zBtGHRzKWS zw##_K$)g5d0;Ds+>)`87(WE!*0(YwUyHE7N&IuzDh08PXDrcokloju8)K$qiXeC9V zcp;8mW}ue{fcDByMm3@+5~08f+l?9tLGzMa;T1tlM*Y12T`c&a(IfqZ~<^jQbwv~lNa$okZlvJb2MrP^zPw;f6 z_rW8}i9+o*qSfsm$+fs`+RP5!$;ryvPHM{@B-%!mgHE;m(VK@e)*vAYqfm=TT&e?h zd2Kt23_*I`s1m>9Pgv0;GHy$67-JZ#YMrhDqSgo-q7;q%6hLLN3Rn};9wvG^yXJ#k zmxR;MJoIcZW}&h6F$=bqH6m z3brtEpgr&~AQSLcmCx4Bmxk6AG-sAg3BSYl=KPA{AYC3Z@Gf)NY(x*X-Z{-BJvWR` zpTL?Pb}lK*gfVEA*{b1aqx3=)aa$Ds3?DP^|9a&0`~nB;P-pMZ-a%y=hTt+z_0-n< z1O_5GfBg%i{qaux$KZ{f{+~C6naaKP|223+&C(Q0%Ts4Xn=zx!q)0s&pqHXc@V79W zL9tXxl6-w1GgYaL5Er8}jdjl6s>)J+>Wn=0h~~x{st(^OHskArOs(;83t!0B6BDt# zs5KSxqrXG5uyHGQExiJhN7$ql{u7i5b`2~+D>tyD0|s`9teK?jEGXTw0TQM=tx<4c zYJ#Vt1qSd~OW~&0Rt=ggmSw;~LnOfLm6y*ddsM1eV2Lbso*{P2dz=)rM3P1_{uX>< zWb>J#R*)aw`(CyCG20>^y&byUc)t&9T!)N0>M@n-7Jj=2wqd1uf0}*Yn+^An#pC-} z+3D=x-vAVPsr%OQ8OT(k`V>Adw`b9V!HDjv}fOjAyru*{`ihhfQeby?vrsm%X0W)#=PzDzvd zF>n|!Trpk18KXo^b#28qDXg*D$*ZdBU}XNG)xxwuCMe=d%al`{mpSUPNWLjPNakDb!P-wsq1 zA2IIN5jID%S8gtlMz503hoax9c{#OGg6dd`NdLgOT&|6u%WGMRc6F1gpsjLO7vo72 zr)t+>`{+Wl_BcOth6t-UmZnn^VaBK)lWQGqa1!o#65y%v@CE45S#bz)bP);iSYbBHXlSwURDj?&~-ajdlE>ffBSHhD8 z$wv-6q6?%X!?Fd!-o?N?l0}=5|K)njLw!{sCls@!tPlqn4fzn4s>bV*B(gDn6(k0X zjLB(yuP1hf3%d5~jMnT)Yzu`=vv@ErGuFFpRriDnU%a!jJIwVbMZY>hSuf8PM=S?n z6rhWM(|#n4EKrWBWQFMWPcC;^D`|Eh_~VMyRIVP^Lfk-c5rj2FzJ9vwL;2G)bh2!% z{M523e~^?1o>NxvPo$8=?T|!Wa|{5poMdHglzG z1_kp39E3b$o79V=B~dC0$2};RPC&qCi8{(iK1oQ`0U#?S$rAX~9j^bSu!qHV@N-t4 zabwFzYZ#2C`dAHNs}*f5)RtW!*6U}qce)o>hJL1x6f>Uu`J}POZvj}mzIk9Lv zn{ThFE!6kL4d6um@kP)3^Wn2b*Y%4YwlSYc&HR`iOx`?v6o&0iIsq?S6IlH3wV)nj zo4qR?Odqra{wp0O?yMq6@Y024GO$jI@P_pm8^2dhP=^>iv&?lNFeH}Xq%wZjsmwf zj$GzrALm@y?G80j^H}3EwyHK~`L3MuO>VKuKcx1^#RQUq&{Z+f?nt7)09G=C%>D+% zzX~t^+)y{DEd8&cVCTDvX;JWwd(5LRh$iQ}A?Yv-+nDd#fN>DO;LDEpHYiQRVcY_P zxQAX~$Gh`(S0X(TXWvM_U+yOw&C;`9d`ytKDH1m_Ey<%3U&CE#Oqh@c5~uztWiA-9 zgMpSo)9_CQDsw4$rANk4+)y-t!jN$e*hJXCDsTKxl75IwdlBwQvf9?fz0Z|jGpt7& z0D!LT>B=-oCvU-zqLEd?+ANLJ?t9& zLl*ggP3h)@6t}pUF?QQw3byr*n z0RWO$;5awsI#q43Xsl7M#I{)FyLzfqch_pp>eedwOls49gPe(5c@MXd6Ur?={p=M?O#C2`WL;0h2x)J)TmUJw%Nx=_;XRi)}nmumo7|GHI)_Bog zWE1#sVP#`Fdt~TBcK51(_gtFiwZQ?v_{ zfh~Wg;zZO296Pxyx57;yPaNUUs9qFf8+ItG}q%1O)m)27WHWCDxG5CSedu4vx6+sk(R<|jcpfl&C zzV*S$4$E?^rz4IyG21fY?6OW)>rg>@q1mPL?aP(EJC!V;(bMKunD!Kr(xL}%ZX+Bb zi2C{M*Iwo#`YX2F?@>IzHBfhl@q-t_QBXOD2@+L4iOtzb#_0nSj(70L8%_PcLG&+T z3dP2_PXLd3%CA-NTiN~xpJ7r4azX0KZ5!P=|g*5t9B{d|X{rw{6u-^xs!r+eFDBj1&(Tjl}l(L(u+O_}+ z{0c^N(;$&~n|&`+bJRfqOBj*ue+!am1(Be%5Vw`g;6aV1|hhj`uoBSbJnI^2!Xw(kDVL%GqCRaMPYb=zsW$K+Ot8qXgi{E|xKnE2@nU6&#sP&N zEFkLF6QaKV{5%f~!V9^dY#=NDNiGum9)fe6aJ62b+U`zxWZJz<;%`n{QSDXV&IldZ zNe7%xihf*q+O4y)*6#O`OtJgrvtb?&)8{jrYw9VUQnhH!#x{{?r zhqupKp$$X~Rq<_C!jiEWtGm>A2^$C!w4@7z(W?iZLzvH%Fq%Td z8nJEw0K3e4^7P&6D?|CPc$TglUFO%8`4H%p{ zxKs8#Nl$9n75(zqhsV5396Tw;60MY$S&vvZl!VQe+RQGhe^0QvSilkq|9)udS7a0` zz*s++@N~ND95iJU8yo_4kaNWXE{?hTgyAH|Hbj7_L=DFDB!|H~kzcX0k-bHO<*^39 zOU-#&9eK`yYn>K7;jR%R-}T*2k#aQ+*o~5eh{rG3`%F4l8LKsg6lp%ZD%Uq6V`AY# z;G^i@lk0P4OFjTfF(h8czjA2aXKRCTLrNJc+!qX@`58(e07&$(%!R_`+H>!pcrKeP zW=IeH3sv!Ps5X@MWEb)5`QX4w&zfxwWn2Y~$P|WJ-@tLPa*yZ0E=Le;p+qEPM@0jZ zyK?L?{!{0W)JAHPR$AkH=*ek0t#vZ;lPc}mtCb$_xwC()R%q3cF4gsBqOM}B$TZ^8 zx~$Rp)g!shEe|27|CweR z+>PWkHI`U$nOijWul}`|udaFt_-tKVAY^Re|Lj3rfIJVTIGJ3Ej;>X-HjA?hr?o9E zz0Mq2Fk|zeGGj_R8RRy$rUIivvtqIEsfsOaEDVPS#K9 zuC0guXa#5m#HK|907XuQ7bOE=A|gVk#^eJs1$TUtO9P7F2DIlxCsL9H$4B;=JE6-l zy}l4Iu{`+51zStiSOYBO(GA}R?o$%eQHB9fA_E;G_e=isz7(qAeaGg{PUUmvd-PuKWmro_N=ZyfQa&Pd zclrl_6aZUJeEnf|!}nn1hd<`d_5zRQWX6Tnw*){=gRPz2j+qqP`MZGD^1GH%3(H1_==u99B{uVq1iEd0pFPf6 z+w9Qf=xp~TDumxNF$eY%+#LL0|H!}T!Fsce^>k`f@R_Wm|B{+d<^-= zMuGh+x|E%nJ%H;U;twYORQ+H3DgWA}R3AIk)ZWg<6JQE7gJqDnclj6w%Ktxm?7wn} zyV}^u8`%OW|FfX~ZDnL@Y2*2ycK>Cf0sKRi@_#s6I*VI+08JGwT}&+gQPqFQrCf|Y zhF-|d+y?m3k-tQ0fA*2h$H0CZI+lOVEC3x7EBk-xK4#Ix+79UK3}F9<8}OqB|Hb#C z@PF6>7&O%-C8bnp{%c(RG7_^hu{X7}GY2rUu>*{poQynS89!!#nT-wL&Ga$Kra+Is zh6KPsZ)flF;R0}Qb@2t5**n4hX(T%rfI;k!=r6><2w)KZH)01c$o?B~0vP1~jXwMo z{)ISM01PVsMyvn^)qf!_4giDEztM-E$-fZWM@$oYn~w_pQ^LgfLBaHIkO{y5{2OEj zFqr)fvH=(@{{}x&S^o`wZ}5YP`(N-sTder!Z2N2LGXA^g|99yBg;iXf?5%+smZl#! zyuX>q8M!!Fdgw5I>^r6p`N!*@-}L??0olKgjK6sc3)_2m)3I{01L&B!*Z@rIABAIL zVqx+94_}jioWFnV`H$iJC;oHz0f0acpb6~qg1re(uvJP^Xqlf_!BjaU85jLoB?iBy zbR5KT`cykEmT2w{F;Ji|;D>((d7-_mB)6VlQh;5tCRs4L&D%yxV%6lWsgmHXk)NC& z?q@Nf(HwPpwZIIyCI9kHVya{5oP4bk)|rgfxK;vy+USW0S9{mfH|B|V^xV9>kcJOK*0pIV@GnT-sqzG8!o%)3l=!snhzD@~_Gl!IB$Uai**{s$V zSolGS%;c-P`V^X<&fy33Lq!^B;I6AgdwWw-@SbvZ8WRR$9!{wlfXi2oajo9Mz2+1+ z)x@L#Ko^4LQK>O*WFnnd=g*%sU~&reMKIyZ?H<5{wo3p#%+y6dqmkjL<4C?f5&vv#dB72}IEaa#w3W-bt?V zJQE!CG3&UXderGJDux{U*thbPT6&aw)?*p)7 zjA1YJh~6iK4_EXzB&Ou&(7Sx|iBacR9$viEXovNhjBE9Pfspf|%2&wAw~Xo#dl zE~xv;E|b0#33+BkfxN9n+*qGJKEnp zCVjF_X-EjXAflPk{*1SH#oVxv?l~1QSKshZ5sshFjuZPtUVdS{!J2by{GDNlR0X1yB3LJOH1QKsQi<= ztvVhKO6l-BW%soTR|y0{x6`SaKCpPlmZ6tieQ!gNgtxnWut+Ay+%?36+#zAmE41o` z#ZaKW)NRmV2u@sE<@$O)0OfT%y`}I|HhgS|t`cbuEwNzJ8LmDf{1?t(sJ)+JiLrb4 zBdv{0XH3fYCOT;7oLBL)1f<6^;kVo=UtvVDywI(NZhXLr)!WjNJyQ1B=llxHUfOBn zAe%)51wXkPm$a*@VM0<87ObAoxp?265pJu18{;73n5~qTJ1iS^%9GF?Tdcs?5vnh_ zCb9nTCOSsCsMA72&DEVvXi8#T*m=WW=?E_RB%{d;)@jvR?cBgNLUgT&4+%ol>Hc8Z&}GuLTGSyD2Kr z(YI`J(1C)%D2HUMETX>!apx=aOf~f`Z~>kI7G10=EMm(%hxEHQd-WKg%YkeF+VS3a zYIBVy`dM!BI&ljdy&z}0V{xYvMBqlTsc5nJG$DbcNzhDOAEZJdxvQKuBI@g$e05%- zPSaT|;=WpbpESjx(@lP8Tp80!1(R}S(P-=z^RG545$bvsz7bm$F%_JF z&OEKRoB8JpSNZW_lIR+rGID9$G}4Xi^(LqNNz?tu%zP@UpwveVwQ4{7ev-7#obTU` zM23113k3m)SM3mJzf&(S**LWcrHY1^!Qk#G@hWFj(<6>dCGi#9+7fZGn0H^hN_^|) zf*7)JB>~1K3L-nmpCx%K{0@7O`hu?*-LhO4u)*F(Sy$XP=GF5K-7*Mp*Nv>o&AN2V zRnL8nKOglq9rxQ0wHLA$k;|Kcw;cwt!zC$`2d{NB2kEDrn#IS6odk$uhzgPWsS-fe z)s&9sHYf{bM!D%L$aY_=%K5nufv}(ne_B(vC#?I{pD7p2UsMnyJQ-&!bozeVat@es4<9(o}P<5T8 z1{rX++@UWJ82q!Qao2J_d?qqvz2mDGoku$PZGv~4ce=>)h~YHOah$^FO0#%DvB?mC zrQeX&5Qh$66Te5GZ0cazw`u{Pih?1`!t?6`T$R0z(TtzvE)P+EvlK!q0#$hh#)@fCDs=^XVcmqf6ePD1EfaUkRXVxaM0lw;R9-suCZ3BeNApZ-UAZt?2arL7q$0x@~<@ zcVXpzW!+{M`?}zkPh@aKAl|;xa1$Zg^R=r@w>1kX^z^+<- z>DV`7s$BfpbC~mIU=r99!mrdSVba36p-y!4o;T6>Wllzuo(S3C%fb!&ClkG;pRbCb z?IfTEjP_|qRmj^6B(8~aW%5+uqc!c?HtGR{lnMg2#|Ea`;bG&co|tcgu|6{eNLxwB zJ|peOW!k}v$S*8k*AwN6HN)w3%R;TsK}i$#APi;tbIW{rX+P=V3zh{R9BQ{RNMDuA zCxGX~i+TgZ zptwdewfipTV{;3V2g|9@km-oZuZ3`UKGz!09u{%h@}Pz{;1q3fc(mtI=P&2)Z>TAl#7L z57ByS8G)bVBA2@oLwY-W4SLvEF}|%93I-`5H^JXAB1_J`8+Ok?my&RUflPjh zw(YVCG|U>&+Bv)UVMIq4DO|R-(CK1%{W7Zu9sQ*hBJ2C^MMuf{4wDi#WE+~}uN1&k zw4mSCJz|>wC{LgNYlZdMdmxws1WyDZvGr=OIM+Z=dHrPU)`dwV5e$<%4OQeE|M~-k z-%iR`3L}gsZOk$-UBV;ipD*Elo+iSqpx+^ma3l)eH(pyo*VivV$#%u{q~-}sbS`V{ zC72kYFHIM~1mNOu^Rp@wSjDOfl`Ib~2Q*6t&B2$GGK8%-`pk2(WDzOLv>BkKBOQM@ z^d9geoTAR<4&fp}U6bJi$WX|&i+(CPr{j3GqkJPn>q(D=>!y7z-$+*^H~GTOn-_a9 z-AyvQ%W1_AuA>)vJ~`rp@EXn6KM3O|4VEXK};>t>aqRz*;%^{K<(#aHcT^3@?3%(_zVR{U3DXYnO-mZhuP1E z01X|5@it2Ny~NI-)6kV$pE5xQTNwyO!E$=Xq+`>I;o2w%um>Z>=Fgs-U!qtdN+w@o zgtki$a=Y+m~X)R;bQ#7@EJL!c?0rfU+wXJL9p4j;}R`K#8RQ z0xo^kqBBlIaQ4Z;6@56mqt`9q)1Y)C_`Z@hK4`OcD?#Hh=*G=9P-x~1-AEV{fEF}$ z0bX!k<}2btsG91vU{EBDyAXKQ?Q-H#XL(8~EleWFc}1_0WFbJYX!-n2Tv=ia8pX%3 zMH&m=^@SD9Hz^b_F3}`BYw5*LspK7o!|YL&$@uHrrE~-Xf$pO=R=-b=ZJuAv!8OT5 z(cpMkj_o%Ty+@-f|E%2#aFvU`lKEDG+B=-hkbLn1ln1fv z-E&?F=M(JAL>ww0v= z_?o6b4{ZFyuG+UN{Yj`N9Lc)N-!Rm;`y?YJ?^~%Us8JN|kVwmVwrTZF3y2AL0blj1 zd|iHE(KSi_2HimJz9uy6X`QqTiFzeb4`C%lNUHN2fvV2y#Skh!u04YBY?k!SAN4TA z+JV&vS1V`ocEY5*JU|4DV6cPn@`x>`a_k%aP~!15*`%4h`8nE1ujg9fa>SUBd6E6X zVcS025jvBA(Y9$%NFsg9dCz zDsdY)Sm@bf(sy7hbm}}6fMZk{oiwBvDZg;k7PBB0^o=emEK8mLwfY{Lc3L&KM|f!7 zuR(8Rv=Rf*ejr2w1L)=UM-|f+PnIAHT35N9HXw?}4%9h;3W`5IL&9yEtA$<73(2c~ ze>g;+ta;lVFr}HN#it5%I4M$4in(XAg%p|Y@h%v$8KDcL>&@s|=J*!&Btc?&e4e^AeZ(WSty z&Wa}1;K!C>McAWy@^=7TZ2w4S#YT{~8iwN0S4vgk@|OH8^fogU`DO^mjzTuPdK`bK zrtI@A=q(tvE~WbE?NDtIv8xvGq&dBi!0N%MXOL%xlp#j4btkgoDNhwyG1lhFcV3Ms zlh|1j_!XX1D77e+4Cj*8Oyd)5BCID*KHf1N>SLgAF{y%JSJ|mgU!1#U?a8 zctl~`2Ufn#Lz_3`j*K(V?KTPLG@m-s*n3?J8JcXkREQTu-%Axtw8*RbA|d=+!tLCjkMgKS2nDx^hU z)orX}Z-UkBs&?}@2ib&cbmo?jpUogW!i4l+&QmAT?Fjnkn1@l%>~>AW{1K*kA;1WS zNrxh_zd}0xgeC>`A$0LjOeR5=fy~$t+p=w~2uf~n_8@K{ycF?jZB0i2$9N1BEAdx< z=_-@{IUTYR;jbnD$&ixzO@_hIBQRGo#zMf`fJ3L4+JeJIqbGp$ z%59c99OrYcp%FHD9*H`pFHzI=2EvdS0U9Ne<;HJi?3h%!S{p}+n#{UpaVfJETRC3y zyt@U&ELjh<=rzn_^yn})5?1T^vbZU@>YeLSdOEQ=gH71e{7$cS?2I?fXR|x%#erY` z4U%}^4;5)gfG@8V-NEgfz4>5QI{I3lcQG1qb5Y5PNEh5NaM5PnR!Q8jjO_aNdn0n= zTl#GqzvAggf_Ec}D@=5$owCtDrAIcM)>z0WA-wu;g21SUH`!jY6svcj>_+4qBmAcS z>=z$V6~b(>$ocqAl?%QSsi81$eOosAeUk>aqc_Ir)8-Q*)6xqKV%+^6G#sz3w6xSU zt80=7r9YSFc-#1}wSgyrCz<>>>a~VvP4`sSp#zmYSW+e!hzl-k;vXyq&8AzL71DQyKGowqS2n z`@KT3vM(l!DlT{buD94E#6Ojl>XrkO8S_+2oz@m!gEd?5<|krhdB&PDvm}FkAKm3h z_5v0UVOEtPOs3@N|Na`}ZN#<0W7sblY4vFT!#+PzB5;sd|M+QaA+O(8-AP@)-G2)a zYV?RS9j(t>bwG9@tBP8eCqP9AZW%3^^r`Y5ipOrC%r<|sngJf-#q;NoU@zFxS&>%P4(y- zP9ax4{b?!3M=zl%o{1gZ7R9HEoX*^z4AuNG4o0So&{;J16eLvhMM9>IV21CYH%y_q zOGK9FFV!10ScPN+_r4WvlEIu~0d9&cfU>P!UfO zkL0jHWbLOcWk6arB;a;76HXKN`{5w5?F39Rstc(Y;O)}w^eETwt(x4;bF==8dqWo^ zgZLn}=lnUu6@ch4TTOn=Lfm*)Ta{ymjtFBY-2ln92LSgUT`Mz0pADqFr#PXGdQ|(0 z>@UR(*%6EJ@<1y*dX`xdP^kfw<;`9dN0C~mnAc|2dJpwQN7oJv)#t&@8xzp(^9(Z3 zZ7;~(^G#u#+JiE8INRVMk`oXIEZtKh=EcNA@q-F#&C#219i z<$cqB`C(>Zg~3m22hhqYjyCIu{Gzy(j`CraMJQ9cPmA+L9iX+}?1yj0DVV(Whc14N z{R(Zhe{x|vura;gYnK;jP=2C2yjA0QOcP_@eQReM#@uEj^|iXBk{~e)(QS&EHogs+7>O@`AAqH3$pi zz^0mNRN6G}<`5(hI14UrmBq5TW*i!B)N}&20y#tC0Oxrwu)ycrzNw9JEyNvIF*y@r zX)@o=6A_G>o!F$8mQ3(-nYwN4+`6BI50uRiyX*&o+|1Jxs~^`T$5#ELhH-8f$M1leRCUjolEMB>3&|?8T~j_w=JHHWSkc&d6>1`XIfoo z;wow3W2XA1ZN6-%fWCH05Ey@cBhZp?={**Efzzo-?}SFhF3V2X6#1`2cq+|izd)s#AaJ^fW6-%;MAPo1xFWCd8~2dG+#XWV0}&n+es9;g z(AZ1ziP%z7rk)i_fFp)thA&U@=UvyUwNcq}ys^#PeYLQ--4d*+1*q2u=b%fARyW18 zQtN3ZciGF@mT0uvu|2-HT8{JBWdA*Qg&^ z`~K3=DNvv+&3{YqM~TvJJj<7&Xq)ExSw*^C7(<5Yv8{AM>s-xlB}$4^ODR zuWy}NrAq(Xc?nz=njAmDA&E$p5ifip_yNywZUkKQSBRq1&77Cr0?BxzV#*erUGF(f z8&4j2Ply?Iik)XSy`nw$cz^W#$jgj)+t>Y@#3I4aGn_h~LM_k;@2+S`&=odFn_M{f z^C?JphfHneY7f}}uX>+GIud}Q+0N4Ehrv+mvQ>gLFkzlF%|Sj!>%}tIm=vX<-$Rot z?>BG}m0%ZLU;_1(^{3w$Cp7rmP#aQ3ypo7>(dY0q*S0>XYQE`iyC8qd!`N=)Kz)+K z4kms7lso;4M=|gBO!jhJe{p0?ip-b@0OMK#OE^^|K(z_V;Rt5&X;mA|Ety)2y6e>k z=$vN%4u?36@a6NoQ5_Eq=5FUe>pQ4My}xL~X!qU=MpzNFIRu+or6=bQ%0jH09-z(V zFapA*;@(gVC7a8Z!!+f1n9)&^N zg;h_Erb2zot(uZvS$C5*@#6G7DMo62xvM8a_q>jv${R2NiBtY-C}{c1+p@QB7x*`w zzgBabJU&^Am#i<#6G3Iqok}w9Z+FTcV(W-2TG(Kl_e>Ev$}!4S?953xOBySE0fJZQ zu-4gkc%zXO4$V$pF+zm0<|=-b@Um3Wc+X&y9X%;B)w`R#ji0lF*0WZ6<)=ToXeIdR zyuhzlrUh3fdoU}G45HexI&4$g?h%9E{XqX?uT^tiOs2!xktqrhRu_Kb81>L@BD~V) zq&ohgp+&$@nhVJfp^tdc*{hhl%_)Ai+YNcd03FyjQJO}WNv|QI;0|v8xsR8~vXi5| zAb+jZ>S6b5jYi(Xj4~PzW>(EG*Qpp8k05aci`L9(vq)zFzFla7Kx1+cb>25;ShXLY z^GPcTXWcgBF#Ua1GUIMuabBX?MD14UP{qG9{Ni)5AfK!uBrX%ZAbKwDq2sBH-)EYD zoJGM%OC10_col(XfqqVbr<5GVrbDx|<)du|dKrrW=lu`jTJ zUg7!DZA%-`A!1F0Cm>YXo+6zs*lJ-=ce9wtJAXw3Ds--c#8cS_PH@-yHP(a+>n4|Vox+OBx5k2GFT z$TUyrZ+KOyQzzXFc=ub`@e4%S2IP1U#E=jg<35$R*&2xV=~iC2{hifm3ZFRSS&QY~ z%o07JvQhWvZTPM|rx~+1(IC;p`K9k40X&*wPF?$lg)N_nL#_&@{5N7YVIZfe?O3vh z!AXlvgIbVf`qF6nu0vTy1Jg@?f`f(ja96 zE!4=r`q-vC4=R6VEXZ6s<{wgYS`cPtZz@)sD-MwUem1MYq^gi+Vf+j(EGJ6~SU_ z-k5O4|Kmr!rwaMHRVjF?cN7fmo!XS<-2z6A%gQvu8{=Nxp;HYR{FU zyigOmEhAIs>2+rl18Q5c_n1T^;keAV{`7_*g9`W@fYK0+>(bT^r?Nvh=UH>(_wO2% zb{%!XP@EVtMVQdIHQt;lyAvGYL z-?tcvF`#X?K)Y1()jf+%@Ql*uoqXACH*>$jE#|*2Kj9>ycBXH1+-CVwpu{3*ElPy+DJy{oSO-?X12Zt>}Ed@-e64fn$#tVsS)>z^PnVuoBcj4V(IzU+3bR zcOt21itbk`{R*y+h#YM zX9wlFo@IL-zN~D&-_y}L)-6vl$O5LkN+++ly|1DKN@{F?-R=lex&5U5t{2wZSt`}G zwa04oJ47V)eb^;G2Y#q3Wl7oBpMs+g$}H%~B1j%gcR}b#SHV^Z3OfzN#RWZY!tG1) zsa>a8IAe}&O2XTiJ4{&R@pb7LT}w=e2QR3xz^oCi&x!a|vD1nbL~oQhLVjV;aiDED zDl^buAz?&`LHWyBY_6MpEX4xeenKP)0ln;C7h2;ok5n6Dpg{^LOJNHp7ZU$=4i9^} zFYuP}hy_$t8a??%%CEe{ySdPLkilwAzY`ckNYwb6HKdg#TS)3^Rm@&iGoGiIl{69& zQg)JOTIgt_bdg$iOT@?67_VTDlz}srF~tYIY2@qtnt7^7<&1cD9;Du6~;%fdhedLNr*P)xCh7>Yi z1vMF`ZXjO0vYUQXAI2pR&%E9b&NCZ>zrDd00dOprcm^;pGZB3aWq(LCsH>KB@cLBx z?-18yro5ZiN+b7v zI{zbnxE@ma$1FFno0xG}UiQ1Sv|*v5D+2AqJ`+^A5?56jlbL{p$Ys7wVwfVsyxv%Z zgux{d*7cuF&3Aa2Rw$XI^XPbs)SB!gqS2_?kMB$6oxdQ-dN3+?#I$T>`-LllY%3)pIVEtx zE_vY>J#a;hza=iXQ zYn*6axdgmBcb7vLn9=;wv2r$iS1fuVAWhO|>@S*H&9QY!+M8{*WpqB+i?!=U?hMM* z_kM9_G%~nHgAmwqP9>>h_<>kkPJ?Tm9nu(wH!!qOJl4))yPy&PBXD zrW~JAaElSE-l2B-o_mw?EZmNi;wi8w^D~qX;V_$x`4Qh;dTz;{ zhI$^% zGlBz~pdoxy*$u+grKQ(btP~$n`S_&nH_Xr9`fk>(QjUHZ6^> z)SH@c&lEMg4=}>DxFtbsliypmD>&)s)%P!6aQT|UtPsvv<%nFEj|c6nwV=gJLzotl z&qYm5QneLQxYMN(`#9~rYL47>+{Sn;%^T8|4)w}H6#5>j0d@3Fh3LLaKndae1(F%V zhtdn}eARE-4i6=uXy~a=@v+m@xwJ?u%bo%t109gflGDl%31)fwa-{qeSyibBey+n8 zC-i#U2;v9aREDa#(>Ci(j$>M#wvh>XIIK209%En=j-B~1aqcj!_X!IY50zjy8$W0s zzr@BQ;Nos-rTD{uG0amg*P-4PZr@m3cuaj}!%0P4jJN%v*@ETtgm?P;KJZ#XoZ2Ek z>iZB<&s9MYel^jEy?!&Sk7HaN$P!QUj!xtyFM?5_AJ$~WP=~2@2O|7wM)F(aof~N_ z0@~;uay&u!@J}a^x@^tiA7<(US3@n)#EPIooRzm^dt7mf zWlV;rip#pnr5=40x=Tp0perJz_=+#T8rb43^p?F80L5A!pPf5F5quP4QS>3?{1v-= z)G(CZSb?GnNmr(tA;#x4IfS-dQY+&_ zgK?BM1rQb233XH^u)kzR6=*h4k{O?yVI4bBBdfx{vDKBp4k z_iV(TrD#DNkDIII1eYoJ{@sZ7NB+nJoLTsI2c)@)-@=>Nc0%KoZsvFHo35|RvShq# z`|%XCc!S^S&BYbQf`h2qJA+BJW%QFF>-3j={13uMm@Sr*}YPW276?BJ0 zLdR{xn_YxtYns)jLZ4o$a<)bk9jSY8YJBn;_bl6>aV}$pmVuz!OW(MAJ2W^%d%u~N zgBf=58UdYnC5NYKLbPHl$4bm+SK5F{_&RUYVA-h)&dV71mfG3fNMl7VzC+ELX(nl~lJ*d;IL2PH!sGu^#cGOA_iQn(*6DVNban zI5H2z(kZI)y=h(79s_JrEibXI=@2S5rs;5Nqyz^(fY!J3018z!#BH)D@rIa}cmP5N zEDU7G@w2_KYS2U#Ty?TuH7J?j@}|y4j)ET8ob{IKZ7FkpkjH$IF73|Hm09z2aB6i$ z*tkg@LQZ-tGFOe<^tXFVGvvB5BI$lhw0X+}wUs;VrC>U${y% z|BKKG(0CwIm-10-9;4B?)8^X&TiXUD4!hFe;vfbWv^;`48;z$)U@XdMc?Y-C7O{n; zl#LJ4L5mRLVN>?n`#6I=C#h>#V@tiYaUo84e*3b0H=#xvj=BN9hypI09l=%=8PY-> zzP_l2%;<3FnNz_dp5GOhi<%6Vz9OZ2s=5cH|Nr@LLw^z?#y zl+P~_|Kpw=yey@jCny z!kE76M)QC##}MR-u$S#iLA8DgAz!aq6bF(H8Q;q3z=S19RWnHn-+e2AU3I*@hz&GI zDRUjT#|%;7w`Vg7z>SW;z5rObWX$rW$#1|!U1}OvMs-)e0zQR#2SRXV=jPf?d+cZ_ z);DC+5J=~sG)n^1f)vtKsqkpMIJyB3MiRuS(?CCzhs?~)m9fG-lYqSX=F`%^G!J9i zbrKb_8i&{=_fN?W+YM&Qm@od#0ilaGapQ4K#Ps3a?eAuQaCFfDT-A=sDq>ntz^db7 zx_6WHTa5NY4+aa%{bb8YwP(PZ$G~qYl64*i>}=eWJM|>0P{QihVS+$@*w1D3Uy!j{ z4B3`$eoev=D&=Ct?L)4BS8$|NQt16!wY{lRg;oG@7YonG;R+(cdom5qYNn@zlPNci zbRrLbcbfAl^#!kL%f=p_U;(zYs+~Z^(JU0oY*{|VYAO*=AeNLmO?$nxW0vtb-W1Fd zDZ-#NItK*uZ147l=ncA6hYbd$TJM7T^Mwd4meNM}-5*_&<`a3!xDM4=OUq2L?!Ipn zQx7QTqax~i&WRR*hY|XrMBC#E!I>T_J5g-pJQ+zmD3aN1Z<-3NPLdA5?Hjx5OxUfg zMzEnUqnF!!f2%yJUkPk@d;)4ZHqy)3P31IAXlm~`plTaqPkDvuRL${OSJ3FnxWs{f zqsJp8Qajy^DFeV*o4lh@TAV0`{YLbP8V7W=#{u6!O<$px2Q(@v4UbSdz)BGxtdYSh zcD@?2#8h5|wZqWDM>da;o|-AWx>?XX?(y+lsElNaL1exHix(47%-6um6r#Jtd_*I_ zXiOEllFMgu2i?*qYNo*bo;2D|_DI^ljhNwJ3an9OV+vJc#C3b0l2ZOQKKfR0)`?ck zkfTY`%n2cr2c|axlW{}rjj7esS+F6}Kt8bTTB8M`a~(%ulQ=~GRy>{FR)^v|*AENu z5L{SC4C1MWl&?_1T$yh&5r9Q)38Rh5h540ErZr62j{Gw{TwG(<*pZzJyH;@Aw&j;Z zOLqs+?$fAKOO}q)ofyA>5bw(uvNF zVJO>T;fQF|%;A0GIQT#WO0P~OEB!OJ6kBIgQP-}+4u25WbHCrF^}uy?Orpx;6a1)0 zGXf1VXB9NZ%r>VzP9ylyPuw^ltnm{VnC2HKWIcm;w1zXP_<8X$98Qv(niJH?Vy&tp z)o6vS)4VgUy|UV8SxMcQ+|g>bfe8YR^s3OmP*TL4#>0SY&2lTgr6f@OHwiY6<=eB~ z%>duRp`49H9(<~reQ%|1kU0SQooF4n$_(#Sv{(9Eqwo!}MVW9VU@BZGd3~3KfaKSq zVcQ82i2InF4*PA^|Adql!x6xVLl_{y^fzWVpyty?GXJCu(lT(w@ zo&E`~fz~2+hOFS9bq3D5w$eL2yi>HtC=n%PGEU~{a)zGFq>lE8@>Zdq&A_pBCd7bkm3$r`*L11FW^Mxn| z7ZN$boOux$#djuM8jxc>XmB5n`77*oDu&l(*PD}-7*dj=%x`b!l7szu*YPfps6o2} z#r7|P&s|HLyCQN>(l{}-qLRk%_(9=Ay~2Lk+OCLXXrkNS&9Lzx)q{+M%lTvYYLiEm zY=yi-b1X}GX5P+Bv~vi|=f50duONOC;jP|CFv0t!V?myrOP`OEX+PLA>Gq}mm}3bR zK>gd1ve%(`Hd<+nQ9#pZY{iap;D+4{t?G)N+q!7`yrJWW=V%CmB!gU&R5lcv9sUR6 z=MbY<=N^6{-ktGefm{R+qje3ROyHtA&Y+5o(KWi74?+lgXB!riANQmF<(Bs958`L5 zBa$V@E6!^2>EU%Z`vpDj%sEBwTVy#X2Rbs`0$P-I_uay~)uqlP$isW9ljddxygLYO*yAtRF@64W-4z`OmSJA!)R$j$R&o29fTjzNL!vF zazzzvqkOyWPSdTxl~=dM3P?f09Nhr?1bsnCh``#|M2WvoTL`%X4bb<}R+ke(%igx9 zP|0TwZUXTf#i1FqyY5d@5pFu{sPwj8`dNh4e_!9o|AI^)Ev1xC$$8F>9N0_oSg zOM;So?;Xk0-rZrxYZeJ^K}y)PgBGZK@5N+T)}|ayok!wD%@f;=!;J|y^JHmcJii5R zQxgEH4G~>h)WNj#D$NVrQV^TWH_u^&=X^pc(Z=aS^{>{1Wiv3#(~TxU9?0?irKdv# z!&qeP*uJq)ko^n4WQP*j>XWUhMn;kk;ROTS!$V{#9=hg0DD7|W)Dd$-r_brXIc7z2 zR0NUc^1P^^3D5(gQ(RCGl($Q#dIXol;MJPb9HERG-uN0QroXH}?#fw0+!8U3onJ6ctzuNX&|}Qy#!;%MGf@&?wU@1 zPJ97$<9G;sHM4CS=g^()RV2UF{qyah@EHt~V8QdApC^8zA*|6qsSm`T`TI8;KkFO? zT*o(RctXCT$492wB#wbkBfv?74Z!%Q_AAsK$IcP2+u5yPZlS!IE#~uZ#08Kto+E*Q z#lTbC`W35QT^LJ{iq1db&A#r#N7L{cCk_v=@Y~XRs_O?gM+eGLr<*7;9D_P;w6L*BiGYwYwZ=)DT~IA#%)+auMj4rfR$TaROd|~n^1`ReMe+b(izHyRf;9W3ed71tXaSNz z+Z*A&mBgp?ntp(?7-jDiW7<#h!+g~B&#~eCXSjUe1V6o%_r}{st%C!*ck@{0drvlZ znirI6a>@c1|Hq%_8cw#p9j0iM<)-s2y}|d{dEjP6BcSO^$HQkR>d6aY;hRFUMyn8q z$gH^!!PA|wb~DmxthT)R+YS?kMNsr?BWZ~qBvcpAySC@ z%Aw@@hRU_~a{}SiczUHubCN$p()+e%RuU0pbB%Z`rki;;GC;rI^|U?k*^!vh2>x5p z?eN|Bme98PY~=ooq#56(4)5T8g%1Q3wEW~mhr6GB6PSy0=HbX#^=h6~8ohORZ|3{& zq&p+D@r z@#fR-a!OzbmFZu+=yRt4&39-2V=W$wUA@g-8y2;`Z zO}~{^@Kmg`{4TDE#=Ztzq7>k08l+?DIa7V*L^y^LKdf;6tOXyl7OAN=%$mv0FrQQi zHnK41f#?q)M<5!H+*S}A8}}nou_BpI=OS=dj^IG^m>ENvj{1KAc^-!0eNV~#)fqm= zTY^mcA)0P>7_OHF^h+)lxi0~*&Y(XUB*0%tgq%H)!5Qh(hbl~IK}um?iLI&@$2nB< z4Mns(;0Zy$5OOh$LmfS!7VyaFN?bakLdmB$JUT)H=r^IkS4UWEcZ3v*fEYt{dU!znjTF9inuu}8dFdl|7vu1O}l+W=mccDXo z#l-u`=1bv?3(Rw-?@FY0L%AvauDb-)c>2_HerH-$I7%!I_cVMrixC>vlBo_j;Z-X8 zNMBGQG}k9zbehJTcqXOqXgbu#-Y>(Inhn{dFMx_?cbd8rg`?OZ^BE)p0(qt7?EaigPq z(36Z<^#iK1R<4YPK5B=bY5yWd+3>%PAyJ=<@ZN~kYgPhUq6o0djP%;c!}hhZjZzkpjiqe(A-9s2 zrkg02NFNuqR_g)dDtj=qx(KU!Y6K|_CU(lgzljNl=2@6XH-ehyn`dJ-`joX>+WX;Zhy3Mg<|PyHh(&xyzh%|5 zMR=5_=0aH+_#ZxB`vaY`J1!}EZ8aphb4+@lmyxUogC|H<8dbAV=lM{Bee^!pH+Dq? z<3{w;%%kF@o~ob@Ffw>L0S^i>@g97b*;+xPd2k@aqrX=*+}LiXp+k?Tmv>~j0&0C=i@qh)Pf(aH{NX={c4DA)1-{6@ zEpwQc>4iLWJ2IUIi6Vd`!y*H9QZ3)t-snPcWH>4;cXYUeat!wORL@hrnjyD2B+p!~TSVJMZV#(_*CP{2b#Wlmjup&HVAusx{+Mm*C)!(`pjIf3NE zhYIvjj!Suy3mXE_39;E>)2_JbNtqh z)o~#7f`M>1fguN`(=1bsm^DPy?=<`Q6WnqLVML$HiJcXl3y(S!>lpcPiaN?oJnb>X zpiaXi-~Eh%D6_>Q{ue3AUURO4MxV9`S|{V(Bs_T{V_0tP)b@nOIW6}|%XHn^lNhWp zUgb95zg>C>QzCY(_+O#PaK9b0&h6tN$6>xL7!_H(C`GSL2q%O&A_$}9(2+`a1qOIO zFw={8EZFTfCiBX22i(;wH+PdPvJH9Qm%9UDa}@{t4B`!c&VAhPe{bB|0+!YgtZuMG zSfYM#@5>5#oWahTU93iDXp+YHQ~l4^+%uUn2R{;LpzqKCSg@QI&^exlkX9*k+`P<-PXfw#t^O zo>H=t)DK}`F^(OIJu35$)>FwIYb%^l$E)l9`Ur0RI8#o5{B3Yzkag`22$jOlH2v!#Wf{D)z-0>+=oa)r(sF|_1x==}iSC)DI|-)- zTi}$IHf7wcTPExa46rq~@DxZ!aSDH`|NH<(SzK{Qu5sdQNUvu$LWGcyu_tID1KgXi zna3uRW2o(qP6U0ig?1=l@INZT)QbHkUTPAXmQUx3Tt-zoLWX-m(8>aIY%>_Ej~cUt zeKJc`PNn))2!H0U;LU!L6_^uwR)A}P6!ANoZoY)y*|tRB`*Fng+~214=<(cM94s%; zW9l$J#a}4oM&BZi?Y`*vt65d`u{7=BvlRgLVm7V~S(0d8TyqZ|th#Nq5PZGgsyP$? zZ4#V@%Ln}xB;`#ybV8uWua)E)wNy#?I6bRHW;G-bP$-Gg@!RY4zAQ^a%#s@wnp?Nc z+hO?0wPh;zj*3ebs~4l1)OD;WP^!(;1_#W-j!thlLS7sn8=XW^@+|hqk-+hAoC7)2 zN)y*YoXRX*D#Ugq8+tHLVbbm2+j!3)??;X^>o0OwEoQ&5td? z0M)fRpb+F!jQz7)&7x#w-X&_v6uiW;I-&y`Kg9V%?|<@$swvuz`+5jcV`x-$*~Y&e zAT*m8sW{&tzg}+LXM!;&M{WC_Q$#NkYHvY}qB%5zh{l znVi%4{?}MgB5KT1c5M>j5%r)qxj)WyZvJ$Q5Vm1cskV?7{q+pJFV!F>Ee@NHav(Vx3^iB~UKrBe-)Y3n>!+CtFaF=J37GNrLV}}Y z0Qg7KpE@jcBBdy3)Orrz!;#Vy8>i3C`U0-`f>3G3$(6PKjMldnaz&k<;CqRyDK?qz z?onIU;aLGA32rs%AM}NV;yo;osDwDv3TpB&28w6-Scz0_eJGgk>CNY*tND^$lR$FM zvQ!JB8M0_bQIhqPw+}x^UNDFeRc=QjbBRO98Q`QjTXZCSVt|7V+i+mJibpFPAVI(F zW)w$f8s(>|l`pU>cPW=IgnuL?1OMRL{k3nMI<7%YBpsofrC3Bk4TB{Csd^AA<`_{D zmZ6S3l3KfG2A3Iy#xPFz&L#W|!Oy>$AXX}UU7^QRM1PvY`F-C@u{je8emL_C^aU!K zkX4!y>C+IWUkhp3`@(a&{5Lbu`8F6f4Y=@eW%aj{N|G zt&FUv7mj&YT_l#ntt_<8QKf6L6ZazjYzY6pw9>bLfx#)}xr8P0)X9HYw-xaLg?@(Gg&2X04nfdhr z-E9VeqlgD%Cwg-fimbbzz|zrN_#~1|luCFcjV6`kD@J!J`;ow7MD7Pa4b*fBdR{HI zaSJtSxdnj+1t(;HqoNXSpJDVJ!q%J(b3>qp&O<73k(++X+!l!ThBmA)BVR%^p`u8=V~!r( zqke79PvH!QLvgY*mz+Xc=OI}#P+KO>3nc*sFp4)%M-))pR1%2ZeVGw$Sp5P!&+lr= zwW&!{e{X&JS;?qI^evpXcudb0mM#OH2xdK zuzB&Hxlp-~&|yWL*x|Ex_Dr_@tEWavVV$4!JDCS+#1+OcxSVTqf5KZ0Zko#Pe`V={ zBF;kN&i22pEgccW5Xmf^JzMqUJvcBF8=pVlBgaE172OtA!5Us)s@CI>A36p zDtzHM!dmsE(EDJ!NKsK3d>ZF_uHfS3=>p1|oymUsTjp?-swCkyb0UsY`L@=#m46(g z`m^63{o$(M1-6dvjrsDx%)&Py*R$`U5$zN#$R)^?e`g`6F({-?-^@X(2vj_XixV-u z#Rm#0OJ9wrz-lm@{xc7lVhYSuG;FtXCi0*$fT#`}Pu@hjSjNW!<(RWEV~Y|GBJ{`s zgub~uJEk>Zc5+4i=hj$^s5SK}^><47kDB|D+9EHA650$E;*g;7oU5cr%s}p)M{VD2 zZbIZ$(~C+drXocDCIbA{A{dK%Ge+64&4}zu&zVHzXU@(N|+%XC#%_MM&&NF>8}IMm=}fb;@2*5VyMgzE?k zdlIAMKY{jk$#>F}eXT_wKKlhRARcFs#vpQ^QHcuOX@fq9lRAlHh$-=!6ayyd!35^4 zqMqvf8Uu%p2NA*sSeY#n57<@bsX$avSsgiDxy@Hjl&sBqI2vZsEZ3KNF0Yd` zRnY)`Vz}eE59^H zRf%gJj#3mf!oH5z-Z;msi&=EZ5xKb&x)MH}1RQf7fyC?2$tP+C1I=1o4vE@?Y@=R) z*4myPSR`2mgj~?$vt;sP72@ie0;iJ{fNi+QfU|P7LzBGddRK8)C2NK^0tV zikq;3?8xwAlVGSTKK7>8KUgfPZbI>KMnD3MW!xPwhECqE?>#mx^`RC}&Ir|Zj&*8T z9y5`mnm5&z3L379S*3;9w|gDb*tS*518j^)OCt!5V)D{=bpj%vZrrjnbYdqk@bGuXA< zdObAZB!b`u#W)>?$J3kVZ~;)Mv|FQ6@6>P`g{_G$+;u!Q1`WFs-mK*}d9ea9BT_># zC!4ji^XzMg+QA|2E>HF)I)dJN1T-+z;${Eo3ta!VC!>FZN)TR=r%%e#Ov_cHG1NnO zd~_b*r({-QSsD|e1D1km$veNf!1jrHc|~SHSRIN@7hXR?1M;Wg!tknHxrZ7=r(UH2 z`gvE~!p6kQm}lUW9!Uq;>1}!`-4rpf<8>Wt#iH~`xPXeaB|9`YaTcT0?M;9S%0OBc zh_U`T(L^ojudK@yWE8CW{Jjv=)6zuw z*QUI~?sQE6A+h=IQM>xUCRVwO zKOdK&v&-p5(}B?(fNBay=m+(CWZ?d#%WLq*?zqDgNYSdh9E*c}F7`U-MTo|Mbjdnv z0pnGnk9x+;xY9pMQtmA(x#L^_r|7pPs3J242xR3$MJbm!bqy1rDMS~R)jf{8vGL}( zMEMCL9I`?c1YA1cCO@4fP6Z7ZR={m#AREmM7%TvR$zG$|@I5Te3~-c#tPUMqB0w?s z$l5=f3zr*H=DbkyE|D+-wsIo>`Z_JaV$8AIFgva zR5q^pk&jLlA-o5bE{ryfX&va7wT}BNVS)I;WI3sIw280|)7eWn;T zeq{4Z14_;cj~n6muIe_2HXR)|wazf_$sF+VNW3A|bB4bY@XlN^ItazI%H1YfPqnX~ z$P8rHzu(BU3hAnfq<%&b9)Sa(Ugwuhr%Klp{ce-MuaQTM$eG!YBd(>`1o{kx#(hV2 zYU_DUJdOS!-|6ij^a_1C0ZFq>TUj3S!lati&|Wks=}h!L$jV}{fM^a&DiY5gOn^_T zNY^F}QmfTWgoDn7)b!+Qs{NlUrEXTmC}|XfmaH5EpyS~f*no(cL2sKCJu-(J^nG&T z)hJ^n@K+4>n#5Y`mC7&`H^bltS76&WV`-KQ{;R*gZWj{(_Shxy_fvDPvAX-vl>vO0 zj4*K|^l*c1LMDyncR%W{Co=xVsf9>x_g*=*k=SXX_4_FsWA4*9P4_F_2rQ&c>E)2c zdovll8o2%n-|-4e*PkXl?PcH$nMo=5n$SnYz-aeio%(TAfbe9}B$XNAFQs#}vWyaG z#WDYFJl~@PP=xR)*1rIK*_fgbYvmBCISSu}9VNGLnxau!g$;A^WGwN=#eI>-!R)(A zLBNHqO|eKO?K;4n0I&9JpK|4Q9jITJ(zVg{#kroRI9__`2tFGMnAhXq&Crq0R$^3m zoMoX%U{k~GDfuEY&ZLQ3WQg+FFqgeuoW=9{edyW6@RqNTbB0k(`>$RpHJ;-|)*TPo zAIINEU##!d2=?IOAwFbJ4y?Ajz2z8~C@igrU;ES3Ef@6n#aKV4O6n>3@!vWFxM^jn zH|SZQ-IAtVh*;~R)hlckcXbA_^PEDQQJU{IJYmGBf~dPxMwg7M&0c?glfVc)1`!O{ z)-GKaVGRY3tQ`+dU`z8MB!{iKf7T(jTe!3C1(I{F0nize}YQS8khx?CFcMmsubWYKEEA9i{)l^WVjAIOZv%6Ywy4f=$&^r!?#_ool`93fPMIrwF*_125o$ zEOah$8knLKn63XzN(edVChW0_=uwRgi>2+q$&pvIhIyY;5PkEIyy|+B+Wo09`$T1O ze2oxf1y_V^-TUwY!B>Lt)epcpUcAIEzTRv&sAUL~J0nGRUG?$Q&8PQJP}pC>I=D#3 zx6{lvs)QG!y1>b`ai%UNXJc39Lrk5Afsca!iG>sG?AB=eUlSUjEs!B5v_Q(VyT8t= zwEYIfzE!lB=D^XP@fr38vmGfO&TSMB#@T}9I!MECN+;;O|qH%6_RMmCFm zc_#1^j>J=J@@>}IwCS!G!DNe(3J=m4IDojVUkep47lkd7#0ZBW3_r?tLXcJ8w#GDS z4RrZ_E*anVUC0Qo^Q?yxR==*zy{gB{WCr_OXfBbok-!`)V}aj5D2_*{SL89YgkMM$ z0sk&Z!Y#?ffp0|tANJ}HE=5BezNJfw?_!30mKja+vG4R3F`$~A!EUCruP8lv1n}C9 z8;)cCR+W5!0n0X<{4K9)%fSn;zAUKoqRBd9&}hfjET?h)?J8`gho`Xs~ydv=0d;G$xr2rZ@h z2=)6m3l<$ANqiQ~V4O*_f32#sEt?w?70^{93{bVxT4vEVN{c2WB_=P;QLD}{*F6k& ze#9VLxD4>Js9)@0J&*O_nD!fjth{R(PzQ1_wp`n0RKI zd9;{9-Zv7~ZU=%QHez@51F1};5@2;PyzHZ0G8b5Z*+r_oH6?DX{sK<4`AS>tZX&7A+`}K{SyDoD4ycNHT?gLD)4{e zSs4kK7}(hUKX$r*s$z)B42&1Z8*-V6 zsga@S1?2QVZJ=9>O^s1Nw=#g%Gc+{T6Dul4a0CU+r5kcN7BEMk_nq1RD6%;ENx6X5 zH8eaDDgcrQxD$@Dmr)F^0TaMEfmeC11#1Ab_VooIua9ReU|hVMgRf_3Zv^mnl|}|$ z@#4}>(dPWu-X|vB%}e<=ievyV3nE$9XD2t209u$qCm1G~0Z|6*?8T%3XxHHkV446n zGXMw709X^y1awt}L{SMUiz@0$J_9do4OP*-y&I1H91xXNmD5cCBBCiOBmo4lU;rdt zRa^PU;8^0`x$}1 zWp8L#XAo_^)Byo%Lz|m<>6x3ev$2yqqm!AD*B5gpcTeg4tkBZr0N5LfS@&-)A({Yx zRx!}Im)qUAv;%%y2l8nFCp5DHu5$$ZllTJvPFj4ePqde^cRuz;cCik=&1JLwLxFPy z3jQdJ0bM?+)#W55;S8W#TAaZ)0B>Y=fpP=q=;Q#3`)%y)6DVilO5g7>}zrpep}?XA8Y0348-A2|CCx=ao1<(uKH`u(%j0-{JZQfjpl3Y%rEwVlFgm;*oooB#s0Woa`0Qa+_A{by?YXY6V3ADY0ofM){OT`jqp83NAqPua=-u0Hc`%73mB{5-e| z%M7@&;R7fqU?MdEufNH_Hvjm|uluchof;bz0XBmy{+bK_a6wyITOQu$JN}>+L4FFQ zzWhnFxqO>kz%!{dxw19BtE>N-q`86jMCgso?SQ?u68mK?{pS*Avkmsb;!g52K@Ch! z4&Ukbve9H~ZUp4y0OaQSbqd%xo0y1Fx z0XG3<2>u1!0GKiR3$SOM{R7+poI(2wzyUCu_8(wJTKn&m#^x7r&tm--R`b951KhU= z@b_P7_+vNmk8TC;lO@AW$b8yUTl;JLmA>*n>q~U`2KOPpc!qypJMahVcXa#sANk5| z;!S=13;(XRctro6U#0lTO!t=sM&mzy?w?2OZ>VZ6-oPrcy!3p7`5BMkSd5#(sA=hsTADzBeS1#J)Ld*TbZNFp-k%$l(R%zTpm zP2HE|&yg@myFh1}KWh_jPYzfSk015m;je0RJ5>mOtl`rFh*UH&Z9cNQRW$6VR^Y&G>AFqT181j|sJRc=USJnPwzB?vSMmS514d3q$LA?wq?S&s$2oW^`{r2258IJr@YIuXG4ob5NrXg|BB3`hE z3g1L&C@0FwG?VymF%qkcxw!B7MC~2h>WbBg9jCcO^IH;>@w$L*Qqn#;%IPhaEQ7+j z!8|-BJPvb}frY(jqT_(Mp3}Yx@@DKq3b6OD1N$F6Rb4NcC@@bWZG`;SuKFS-(uo|M zUN2j41H(d%N;4^4&W}pq_FO zNe$L81D!>=CHxiswxRMqQaiDp{3$DTU#=t^4LrDUbj|s4kMAt0CYs{|SXT^?v$@L} zBGFBxpGTegVM@i>BSvrCKzSX4ou!0GeBp?|Qd z8ZD^<-hT)74VO&FpZBWaBo!=XQEl;V^@fWQXkthOnRe-C6RuIb_O{{?#Gq3!`FCm<0SMe>gR$l zTz?h^Y^xi_u?)oje0r4k0tlGZq59{8@9z9`PM)#tkh|rN0^9V=o3{1qEvqfK<~55E zOORV9Xq`3e8DO_pp)&YMkty`06#o3;zv}?KRjY$4*FprUoTw*hpk!PWlz%D$A^nbT z|9s$4tl@)CvLaAeOnj2Hi8ezbOYFo`48uS)pS$vaGN5+kWOpH+*7i5~wE&c$7r(-B zX_XLBJi}VQ>`)a%r)eHDcbt}Dhzqfy&Cg;Wmc{xOr}qLjCSaG1HjS~2QyZ@zt(7dq z8h@~K9U(AZ2^N(l?%3#dQy_$i#n4k2ugG-QW@<0owe5QKd@%me>m`eNl~HI3c~Ap* zYoXA}mY^gTMCsh+ilC#aPBT)!%rLX8Ll-?7a%E9q=o(Rt8;9s~q%;>*TqfAzMZxy> z`OP8*)@CU8c<4)FvLufG_XghFYxNMQ((+2AjzU^s*$sWzZ6q)0n@GIc}PbQ*ARv+3PAv6MA~*c%Q9BZPmME8^!f zuE9VrhBE6|e@_}bdp9MCTbrQzIio~Rlw$_*GAvw^ZfaEgEWk0p0b<)cth<0`+_m)v zZFE8OrOS^oFZY9?!mM8@@VmZ`O2jbJt23mIJ0J_RO;a{-aVzK$5po`8@6e}robD1r z6DNOrR54`^m7==vpuJV;oi9}>&ys)J%_k3kPLLx2-S(6&)RKvw?6w?uyctD#YJSs% zt|KdrT09R(@nm7bFKXwwlA)W`M~PS13i>;DnoMYTMf5@Q-nn(hdv*9#q6lypT4A?l z+8pg>X~6_us?4sX?v9z5FX7%CoYwiq+^Q3MCbOfV0k{{N@qnK=M|7L2t~QV7p&GY% zP^Jx6v~0H77z4kDnZ9!8jr(z&&!|n$lSG_t`Guu?LC(V6PS4Q1yRd^+^+{iCmE*OC z8!mz3wss_XEKVDArs=|YO%PRn(8+g{8oNa7JntL7yo@!R6^HG~3k^jgyRFy04sH#| z>UlyRJuL_Arw$V|rh5!J9mlBRQ}BLf2u0hZL*0@&F*O5Ds*$0m>NmiJYzy)L~Ao<2~KhLaY$WF*fO(B>eTfZhpl%=eO)s! zWJB2Ux_;c%6>fBKjX+2t0>AP^yT1+?dDBcgGbb^_j+>c}=sb{F#w&tfV#gpJtcrtR zlP^E$-Yzz-+{I#d-k>8DJrwMsmblIM(i#kLVR+mH&&@6-i?maml&3>t(8|SzLsR~B z@#>i|mMiT2Vu$u0FC|U{!{Tl`G#|xHYwH|dj5n76GSCn)3|gc5w%=L;~3N{AGTp<)H^Hjaikar)*_2}cAPp`?($XGuA}3+m)e5TXNBk zrsx)UT%|V$+nsM-@8`SNDkZ7+^uW^b!6?q=qc6bG`l${ZrZY4MJUb9F&89$uhV#vv z^3GnTCrtAR+`;>zC&i`)l{Jntm8~i}mhWtY^cB_0tyz9&oQmen@J#?+p9LiNfY|uH zDyOYV`Sz7GE%>*eC+1Ok4`AozMNf+okKHH4`i1Zxu|PQ!L%AhfM$n4ZjG~nfx+qDy z)O|rX;4cJ_?r0odkk7h5lGTI}z-;ib&WKF|R6(cG@2%HqIQMDf) zh)-o4$GPg`KgpI%+ww@?4DJ#No5&cz*E7~KLR8L3O4pT76px1N4c!+rnM~A>CWe=S zq|MGq$+xi^Nb6wBDFRh2IdZb+?3_%FArWh)H}o*c#)>aNLBI9vOW;5*UpR@2x5r9h zeCMBgz-VIBQzSj{edpC-4#^xoC?30@X%#*$<7$RZNEVTD1|%N7Vlt7mEXyYvNdH|5V$8Wiac2!?+p#jeyOe|e)~e6e+$+#8c)ROq{%X!!jvbL{isM&H1xZ^ZCN!F zPj9S}ZaZG&#ECx<{hA2%@$!o8uwmsjJdKybFl`-dQWEjfGhJ`yJLbI?BC4t%8?Z+p z3A;^SI573Kk_!`E!m^73Bz3U8qD6tsbLUumS$9bG0$t{{tj9fJqLF6UHa*?Ke6|Y!M3Z|1 zq-*fqTFQtC{_!QA=d1Fw9Q>eN8CDXJeWd3dp^V=%*Wvt5gQ=9a_fD)@7?O@S!&~DT zUCG>kvCA0Xh(roTpr-C+DuTlS#1HmJg%K{Xe)Dyb$o?o&2KsV1-r1>vjNruf^v$!w zYYZm5Us3k2&*q{kYFng@QYNvZ_mZ?y9CNI}PRLDNrE(v}t%8gBIDMO|5mjmuZpkW;(3S}iE)@mw$8=#lld=)yO?}s6w*82?q4+bY!LOCOYS8ibf2hj-(0|= zR3iLEG@|s$6gK6Iuz3MP^yn0+_8&IH^KsP3;#k^_Y41bjsCvN&e;`_bWy99ca}kPn z!Km*r;=qub=bC%>lDOm58q`)d5TA&{SHxsuqdeEVQU2vKn^04z3s9J2XW9)Xxlfn0 zaKL1?`r&Og|5#6aul0=om`aWj`tZ$_@bnEVdn|<&Q&~ftQps@CaL^Fsz;3iJ>m0%o zZuyp8u#oF{^U0yto>V_O8OhVCqw;xFzWQv51_VmOdVcRV6r8V{`_ zdo=mHR{3q4P=TGk`h1dKTlJdG;7>%OL!zI5l$IuY0WGEEpN@o@$9k$cH=2zN9fh%3 zddx%FWZI@X$>Bn~mnPTYpJ+7Jf6T!Jk5EY&j4TUhJ~Mmd4m7@A2u-ZslsD%BOP8;b zK`)7O3W6W9Hs5@wY;oXrJDte!jc?m{vSD=FKNtP&f5$O72^$9(ivT zs*Jcrm2#+mdZ#5mI}-WR2o$Up(f&qNEB=bKtv#biUo01iq1(|UMwFC3(y9nt7a=O0 zv-#`MYt^vx^syHhmAD|hO8Jpb(kw>!@qBHLWQC;Z7W}ksW(K6+=y)ojz9RDs$3KXc zEm8(%MG&SUY+eDJh-pKR6H!6F_MPqg({_f81PpE^(5e@Va zEQ!j?O$FDlaG889Xux~cK$adhRChOA6+c{Zbe_C*qW4BE8= z6^-mf!^E!6!AHlb*8x~1nlt9n2JMp3lTVhr-d@rr#fBbHV8 zUCI(+c4)IL__R^=sW4!E#jR@#MI_eIaV-ZJm=QZZB zbt?q%3sbU*$zzK>29 zxzHdqXVDQhqw6~U(oPaPG5)r>Yptqqgn+!q&vLHe zEE#luey!W4s*~A0Ds-NVfmj?Z{7{*^U|(xY$LS9kM&%es7dnu_G1?(@bMVtjoAu zH+(OHymMKwr&%59Jee@@@+|k)=e$gk7xwXr4b1PkZ2|plJjAXpRN6N>efb*z`&Zum zu6jlZE^*hETs0!#b%%9l)2~*cw<1$;K9nSK_2>ef7&hYEO@t$y2p@`-{071Z>z{n|mbId(lWKVr}HE1!;5{TjbAnUwFi$WP~y=DSk6 z^nl4xOx#XljN}qCqTSw1-r6{b92GJ-GrhmI7nL+D`TqRS0h%t`jL*WUB;y!x9)z4#)DR1Iv$d()?I7Mw@Ij+ zB4heXQWk}|u20$6uShD^-bp;Otv?E2oWr@Za_j!$Br4#9#%Z$qh==sJw*H8PB@+80iCl7KvQzf8z1>PaWwHuq#n z%*%t*eE@S3Cri0L>!|_a(wJR)R~^2K{j9jC0A;B63OC(>EZXiplYv?`AU>6!06I?H zSo1y1O13kFXF}_vtn@(*o# z%Gf#u$*KWD{`3lx;}*_TA7@A_FSa2&oIpwWizrR?4zfsJID7<^`v?4r=oL>yvjBCb zEugJl4+%!oHc0xjEMGO7SZOYC@-JnFQI%>hs7cxoSBp&OM367EBdcQ8+;k~CvT;jk zA~g^l-<>3V-!LehGLfVjH~k*B>v~Ft(MRib=pN6t9wxtTs+Jgo+o`Hn%+Rf5t%fGH5np@y^gHxK_ zsC~M%v!iFCxm%qwAT?b*naao#)En&eZt%=U|-+OWM6y*FZtQI z5|GVN4Gt=0oKmk@9-eLlOax5J6U*MZs-R=$ouKB9qALm6I{L@0mqLillj!>^@+A;? ziN}R@RtN%rw>;T3BBPo;0^SbDxtJI{YIU6tSP^T-?xaJW3mTs*jFVV4N9!61XBsv1 z&4fcr7FhHUa*w_eS+c-Z6O<&98J{0q{sN~ww^sch%<|@JOHTroU~(2Ts4e}+fy9j) zs;gl_4h2s=P0AYv!{A&~j~Ew;E5NJ*tlEyajGXILrW-Afa)(cIM@mZj2$H%%z-`X9xrdYyi3aW@9>7t`1yXlV*VS=|(80I4LCcDYj=NC+=qQyg;uY@U!Q zP<`C)=W@x=YXy090rPI3;OE5vxhByF=|!6i8DB2nrSa1Hg5pVgpS5-jZl|#G8r1iL zio5-B%U&lU_L)eEEBf-01>95wM$3n>1<3q5HW+3OI|~hL*i7LWKHM1XOYi2qsY&6j zH!()@p|crT^Tx|GYcHQ-mL$qKSt#YGtmvMf4hT;9Fn3`8Rx_=Sp@%PIKRM?3e%sO2 zxlu-C)4AqEv$yKaU1r~yrL>+wZwDv96um@}a^@fs%}m6^!oqiqTK}ZguLg>jAedWv1mX$)6zV;Z6MV1Fhb( zvjs4|ky$_XbVk0M5xl$ov80}~^XJ|G*`OhS60c{iWlUu7kpJ$M5ZRAIbO>NeoY7>K zgi^GmooAE(ECSQGR1>b4NYsll*jk)Sh`*R{lmA>4mVz z4VN^LC#}}Y>a}G~q5A@2m-wF3K)@&S#F5z0v%Uxjeuqg%ju39WK0m5nB}+T*b6go| z*A42P(=o9vr*0af4uKHv5a}Sq2}EqgE!ysWmI0iaeQwmn7@>d{w{ee}(QxVQk1Wrsffqf3onn z`FikK=$?&^D?qPs{NSfQ2>S>%JvRd` zR0@XEYd#}cSjMecmK6OViciiiHvA5r%fnb2v54MdYyvQAH z^ezae*cciZD-!oS6IOj-E+P7ddZHfCz4uWtg6G4r9rXeP@U?*-K|M9_9=HYPgF{5} zyf#3mqaCZCYhj699ST0d)CeIBHD=^Gftd+a5FmO?9#WIgWC{&nm_dv&ZCykl@EF3F z&r^nIs}h+7_ua`Wyw655_eyRpls1E(c$pnY>C=E58ld6~ zj9wcTunW|mQ3%PM5H)rP1w(bzk*R^#-a1&m*RnwOOlxvuf*Q3skp*KX!OOYlA?6QN zW`RGL;lh2%@Ok*<=!myv8F?h@_r%-r^2wc472Q{C{})^D5G)GMcH1u7wr$(CZQHi7 zmu=g&ZQHhO-S=;NRkv}{dzxvbW|BF^)k?Haip>4KiVbS65V|#*I<@!iHe}f(HmdlI zp}yv=?Ctq8)Sqt!Y>AGH+{nq>5IL24xRMzj$%X-K@Lh|nZdab$d)9+jwQHb(t3(_I z7&jdt`qf+AaGam7ke_yYa^2dj%k^f{h1xCU5kUT~ylaD-j?RrAEQVu)q+w1oZ|vAD(GU=Cmm2?9!Yp&^=ha0rsCi?>ZM3`WYfcr#1DMYpu07* z;z+mrw-r7nwyZhaT{zRKDm`dX4UH^lq&kvqJnjK%)}5hn*bAD3Up%{-Lu6fBbL_`$ zw$k!Hk{#eh8=Klma!)mt#S6yq0UGZET zk5O@FUvgpNVZzj7WyqfN%a3*c^E)PbBChSim;+h9Jwejxma%o+llqhldpD8 zW;Wz(yY24^5SquDe2IJ-ypQ+r#_~BM(*NoQe{0v4UkYAP+E*RPY+Q=b1;z&_-HY6) zyJ6&P)OENVw{G!mC!Wsn=UuJ2GNZpsvo^9c|KSfd=^GaX`H&x0nQJ}RD#M#h+-#7d zAi*GcwHy)=RwIk{bX^DxQ9pQpn4oQ5wvNv*jW|XOKb(X3EDQ}Kih74uCM9|Sw zwdOccVbPMl6VaBmvviHRCx+?F`p}7ok=-2QnDX(M!RxR-DeDEw$%oz>X~;Q5Q+Egd zF&^w+qvQMg#TVg*gzG>w(M9yJIt=za!8D(iK$YDla1N4K(PFnzKOPas*nAT0 zqpG{u=Y!=CfnT5y99d5p2s*?#$W>=3;JC;mn^!UBKr7caksbe)fy2L9O{#couA!$G z-%N@7x?INUtx=>LrnderA>oX0KlA+OOVk{9z@e~J|R z)rYzbR2X}(?1V(ddLlBw=Rv9jz2S3xYV%~ni0@N=U1nNzGpI3CRmP$`w=&~~pe)Wh ze`w$B1-WwF5K5sPTb*#s=N^IaD<<9x8Oi<=`sVwVsYsoNP3892LjOkXMFfwvP48QP zT?9;lfG&5%;=1h7z8(=~9;~!)d^(12$sHiXrZ^ebL@my}vZggjJr0gGc~-7~q?Bm$ z)E@D3=fEQs{`i4?mJ9Ed;l$b4Y^U)8|MqHXb0%2kJj&n)WHM9 zZ*@SXkFCsJ3zBW#J%4^AwBz-hn;{=@LF3%n((eYgPr)P^BC+P?ltOV1P0={TnC)oE zG(ksNEivx1w9zFLf?H+b^Am<`iTQ1qS*C~{MN4Jw z8cX9PNd_zexaWj+!R+VsQ5lk9ZoSVmM+j>nOuM!sh3|_vn@VO!vX^~2GmiTKk=7@O z!>-4A^|z6;dFgwc8_Z^2!i0+98gLbM+SzLCOgyBUib1f4XJP-Oa62x>s8?0X(3>-f zLy7ZM9Vs(KQKo|52|%Ki+9{;Yh-6Ro7&Y!3O%?$Y>QP{IpQn5E_m3p} zKPzU^JW*Z0Zw^;Gtl#D2p?Ulbp7cNE+c*3NN;opfR$Il~1VzEqG0*~-qs&BMNJ`oZ zNPHDYK@ulRSKa%b6xa#pb~Flg4Fp&a>^wIP{z{bTwbjd$Fln)g&Apa4zR#Fm@_{oj zoL02Ct|Ux{U$R_s?(FfSX)PTIF5}<*3db3hyoS-(-e55Pm%Gpu&ETwyB`m!-lBzzHYQhsCWv$SrP2dYFk6_|D6+KA~9l{UyPqSrGvE@J(J zHX@zHBM|izR@%{`%aXnu7tz)S7RKKbL1dWJ5(^qSYe~$7y4CGF1e9UfW;WsPw0uHb ziHH^Z#&8N_wq2Zz(8csk*eDX9GFJ%-veU#unh~Rlx`e~ypZvh^fV~wSh6VEF+`g76 zA2adr7dQ`ZmQz6!qvp|h8Ka}{1V%tc&IDvO&uO?MGaZ_Cb*hH)n;+Efz^cld3dW7$a)9D(DS6$XyUfSI+@6K>Hv}*oGGGbIO;~3BM z;CggNAQJob2AN7z?Ol-d@z~(>98~)tnL2vmoXl%Jb8TS$FV9dw4s`WuQQDz~^Gooj zFr~nq;Lv!V?$v1c@HgN**TkLdNM(6sGH0)DAQpmAiL0ZA6fE&Gfq>fFvzyP0@q!VD z6vbE*dqK}=b0r~tM+Pr7&n4HL&PV5Nks(#<{PFx;u~Ooi=X0uGta7lOtqV1i(qhgK zdK&{fo?Rj5IBe$f0w9N0;cWCzGY9Zc)t9|e1k3Ju*Kr?xB_)#hSFV%{`36FeSG}5t zym%kFr9njEZUAeQ$hqohn7g&%5}W`b2C4jrof7H z+3FKZ658H;lq>pH042${Le@aN73*e1HsR589epdEPGu`Gj?g?nKMN+xV-Z&)rcfp& z_NWO})6OFzx^QS!k$&~KDoAcoW#2I#WNf^;#OM0ZA=NkQ$MEqqly0kUAS3S_irz|9 zou5rt-Z2cnsPSOR0{LY7vqyQ9?9Ov>z2*K4PiyOYp`usWpK=gCpa*uS7qjtvm%?Y< z+Zif?%M7cjTX2(+Vu7?OUJBUsEC|l$$S|GA_N-L~eKG>|+ypYo}o8%<^{dq5(AILgm8{s6l zYa;JbJJhEKOHzd?mTpfcDpGtNUz#{eIQnkQ02SA6mHTYLy`r{CgOA zz7z$SL35VB`#fUX1%`ZZaWVraWzrY=){HDaV3yRQ&E5H-E|LcGrq#m*+mX*l(KHXeS|og4yKyLX4C#Z@I#&8OZPy6|Vq<4A-ah#$wZ#e< zCUB#Oc`1;1ANqOQ!+c^@*qY}KdMg%Ta+1TCR-}%srngI*pP6+xI!h8ax9?DiH#qY*>I+hd5o2W-=|#|A?lmQfj0pWSqJRKsGKN5q8 z*_8(2dfQcDNMEcSn*C&~dnt~QL$!!O6Yk&ydl|7wU@X;W=MGtvkv;{Zg%_ToWmLQd z^FK#GS5EkW={2ivLq3o+EASD&LBhu?7Tpns-@$FA*r0c=Y%5crIvPE9NPYdSi#L5s zP+})*OT}~NxcSzJ@YsGlN2!&=cZwN#)x|D(=vGIP-Cre2cTb12OyZDV$6@3O7VFp8 zSV3l`ZSbGhIkcNIecVlj4-c?y-YQEcy)(ZO;Rd6($fDT0P>w>&lHof3cReL;N5J#k z?yx&>GtBFP0+WpJ0MFQb6j~_t#)9cx02rEA(W_yM4k} z<0yd8CNpqWeO0w+W#lD#FQS{;=M-VI!^r=MgYnBr0K){ zMqe{R3{NkivGryBB~Es_p|fL!9|ofUP6zWmtZD@cd5Qd?eQ;_ZGMi5MD!@)b0;(p} z0hj7Fr$!p~#a~9NH2utwgxe<%z5@;d1Tf%N3G4`xpK`lJOZD$R=nZYaR7fSW;o- zNBIUI4L4zN5@+izFv6L`@ub1;=d}&{JA~#wja$4PVRi8D&YUp2ScUjy(>2gGdfg8Y za9Drrc2GAnorA~O8Zn~>)P&P8eNGBdm3qj&Gg&(hox_?}@Oi18$Ydc?BuM`;xxGCD zsrGbgvm}c<79>dVD!(V>JG95nicsOK*Bv{W;ZUOEL*#=mG=fs$abZK%n*$9X;#rqV z=t8}p*zI0#QsPz*sj{?>ot;+i5SW0cuzjp0i)FqSYJ4X#2KJ>K9>*C9X8m?V&>sJB z6+p3Fop-^|!O;8|*IK5@uUF_|lhzo#s1*Fk;k0p0$g<6jhphs&yy3Ao%GL)SQ(|0y zMxNF( zvssZzE5`D@SoRuye=3a-&Vo7|6X)M1bVo2TBoJ78tT#u~{Dng*>8mg~3z9fz?m z{@}}@jbWTrr(`$*dd9wlS+c>p&Kg?|Vn>s_m*ozba7`|wScTaVCW_Km)zTv1(Z5!- zNVv+G+f6q?;u%of?@Uhg_NYP6cmzyjbuZMq#Z0`tIkUY15|W^$;FY3FEkD;|Ph3!i zEW0^2d4d9#0g{a0YxLRXfw*~PpPniu?FhmSyNw2TNqvG_7e^vV!crRvO=m%4ggwl; zT&LF`fLB*Pp7iQ4ZsjCA+NCR=`$wz`sJCW$%DGJSDYavCnZ|0v0Tp9;7B2E@l=D?q zC4UP;B4wu!goJ6i)p^yL&ur?A#GqPw?ldP0z+KVTFl}^^pI+irZC{qy)*bxlgZXPz z&n-Ga1;+kvN&Xxur?gnL^Pl;+#4gPrxsbuHG9d5=Wxfh+j2&of)J*VI?&z>nW~bHI z==2R)G56b=`$(mZ`}*`@=AyTTfxQU6aEaUvKhr4#ToKc0u!2^XjWt57_V~3p{yEo3fb;`{&f`gBmaBsl56rGM1_UdKI z)uCSN22dPSm&BWXRxNujlt3Ty+}S8`3!Ys1qfoE;t9iXK;3M{NYR7Ep$;Y;jidB1u zUl${!!C7}o32Q!|qRcb_O{orUr3Ck@iK(zo%|LNoimHK}gAwI5s5{Q$n;k23wAN6@ zCb2)|J%TMCwOJzJ?9Na@=D-+caw<>pjTH%EsjRMVS>9cn2RVF>Az=_(Lw8V=k~X>A zYb$oVUf#93xDqRFxZX$B7 zmerokHgV^%c{6A8)-4NB3Lb+_N!X7l)^fpH{t>kHAq&qJT{PjS)fRUNTBBmuV`05a z2xr3KBqt=my}oQ!U(=Wq?An{J`4osqJ$0|KEZ=0hLM}Aj^$z+VR4o)fs|Lnz_!Yu6 zZa`$79h+T_e5GovUzoC!?4JC1-y}aoE+zc7W{py#=uWN6r5V(#l7atcnw|Ox?hBFE zPw^eP@m4nvCWFYAM4%yUtIZ?O52(QV%QfvarYMN~Bpz5J*85uix)Wf<5LqPAS1z`V z(v4c4prsAN;Z)O0W2HpI4b<{4XNjgt&1ZNKGCIu#YG)lNy28F3I5E~_`bl@{vcin$ z2vs6X)dYLzlyZApJ2;A;ch(%*9;BuKF^z~BG@BqJAC8U9_^&zQ;<=pJQ4H;LKl8$m zs+m9{x&NBXV6NN@Vkm3UV%@9c*{OoPAbU5>R+8CpJX=np_sOf{{FSGgIgN#l09bsx z(6+uurt2}=gIC>yKK2XZds7MM1%&NA2b=ZJp#l^F$qMSM#j-gj3=kNs>!Y$vU-j!< zp5Bs{$+5KT5vR+1u=39;6(!ZR;aVtZ*JqbmiPf^Ecg<@AxCHe1%@FaV*~~de&~=sHRMwdURV1ow?&x?Pd5`Xch6P_}B!I8+LH&ExLvgOrVx@8C-G z39DkctT*T=!jHUqH1=)Je~wW4vdLyVx4hAWT5n1cv^3(;Ca$Uavu0Yh|2MtcPWOY*|~`faKJwEIRM}%qs$7F zWQ2>M!%CqIends67c?yG!3e^)<0#kEaN;vCNye0BYt7H4caSBrD8f8WPR_8F^os8V zoIV2|-HYP5MLNlDvZ)*rPYYeR)GO#vnN1w)V;}fHD32E!G?gN#0~pO!O{$^)kjU^T zd|?(zD5%+;z%O#T3cb|Ex6($CQb#t(8uEsjS}RSH6Ud^5OrMS|uT`X^> zn!-H!l?l?zbpZe-RLY3TncY1djI=qWb+HyD7kpFNt@qsK?FWODr86&m;a(fE%f);; zMEi0CxR^jOOE7CXG_-SK>6U%5SxFaig9c=^&KiVvp(HRyZ~*#SO|2<|q1W94hg8kh zne2%Cc-TmO(f_%f&<04f-5`$kKQ+VAdtY8klAY2Ux4)~l_g!+8C6xvZUpw{e@A}=_ zge1JwhuWpkH;=%voa@aLk!GR)>zC00$K1aWY+CkCV-C-P$n%1!z>U88p#hvoz+8`n zr~m<{gOW0W{_0(B`#2spseg-ZE+9HT-eXL`KMVv>b!g)(12^Cir5+Q8e}{NpF9)eaq~e(2AEYVooZr7)?YS{avLk}~Pf3b|TECjwItZf8%*6$P z7rcO5OEMuIGUcOnvZ-GyIHZE#BE4^6%mncfylboHgIXL2qW1H8H{-8f$XMNH0K#zuaml?ARHP|Uscqj>0I-Cf6(@Pm~TrtI-%((~Ptmy3WBF?eBmUpg`X z)0nXdVobeIOtuQz_RSIr+~x#lV3jX&))F3_>TfeGt*W7n;qb~Spyx3;YL~@TDa46G zftf}uE7N#AauoPVf;)-bz$0&vKNEqz2{rfRz`h);T;AY!?-e}WSsG7XS;LB{!hibY z@LWx=zgEIxbSzqE3TC_;{&9GQqidoL=7UU+bW0jCyOVOI<5!zSH}*`T6{3Il%4ov5 z@r;Iq^lXg`<`7ZKprVy@#$gmvC0a%Jw zp~uv_%jRB~V0!i2)Jv=HCLrw~Uo0x;m>!2b4v|$KW8*K&L^g_!J~2rxXDk@q8zv)y zbtdY)(?0q&bZ3ll+4r9nzc)Gg+%W44W7y(b!%`yp1vyW9P!QB*kaBJ&*xXG+n~^)C zs&C=u5r}@oefMx^p3hh3mapn-Hd{9_%UD;}_K^}$$Zp9o%^u5cQSh7CEhJ4OpY2C& zr#=r8gGY=;o9O;g$%b!14ukAAsqTzQ$Z3RjueM_6+a&ppHJ+?o*_xCV{l>bSoa>>8 zRqUZdMJkNcE;ARhq2K1bRTXKkOgx}?m;bn){z($UFVrssv$L5x5hE zqs(jq-IgVypu6W>I`rv)Ki!TC@{IDoWwx_Mu2khS83*vRoc{}@r#Sk;RSeaHVJ+q# zgiBO7p~aw@y3DJrEKZ=CjypA0BT&c4^q@~(4;|YJ&0c(%sj%$b*$Dd*&R-? zS2H3qSSn$@cptw4t{cAZ`u;<|$A{n78cbmD8Zp*uh#^qVULTjdU?pm>U*7)GiDicC z8T69#FahX~n9KF&{uN?Y`3N&mI5#VY@N!}RG*CnzDed@EDRD)Juh(W68%0&kw*#gb z-@eQb0Tg=F7kS;z|svxogOXCBOg1 zZ%>R7&_auX`6_7z@h#qH?qgjVVX{O0Tnz_qnYj)8u-#z&`)ln=Ju84Kh7Fp|LbRG+ z_#t<;OCS17`8jxY8$^@2lvRr6cQ+EG>`&tS#16coQMWp0?ARqjot`|oz&|JH2K``i zEI@9>cKU_wpLy<_rHf8Xg8ws=K3lU@%|(1&?c9w_ftnUkB6s?-gs^!i{Oy8vvLud+ z6f_S7RM@HNc>M2r=4&5*nV2dOOJ9()7kF1e=!r1|h&X!zj9!&; zG-&rs-@-+RjIuvO_`Ol8AFcgx%Fq)@EdBkhUVEUh8fQuKW~zl}`JS*`A%A&j z#3=j1Agb-mUkPwLUkn59++t(eOSay3(IMs=VcN)SXx+aCJXaM=u3Q!nof3N5$C%yF z^}6ue=yJ2=!ie9`!SoVq5}N24abN1#JMn$0gwrvvkTi0d%M~tpZe?(>YL#`<{};WX zaA%BZ3F$Z(5KEpxtHIOyCAHCs(kwaisZm2PC~b(Z8C`3Y$6p6e;l4B``2#UDrN5B@ zMNR{Bh>cz}EAiy!IFU>~-=oXzq*zMvIDZ=Kc!!=-f&Q zm%7AXQAfxn9nRle%iCA>Miu{(vk8|Tr;!nM7rSJZ>W=X?+w=HAVLeq11L6cwalkBs zs!&iF_`luZ)mRA?a*@k`uPae@HFnX%H#ChJhkzj0Ib-I-&1KWb|0D z|4LqAS5q~Ke0Q^N4~&(c|0iFIL0!FbJ*}f%h46G9QP&7%5|_=*3Z?!_n}quhk}jCI zfXTffm(f4{2DEXF0AO|?33GHkcxL}_1=8hl*2U>M=6=}N5Md^`OZ9T~x9WJ?A=B^L z-pxOc3}}F1Ts_ug>KMYRKqVrd=;Vb>HS%iME$6A2e)zHru%3JEadP6)9d7cO9N5hL zoASCZ@QiTN1Ym zF({ZVnwlhMYGElQbl`<*gF_jw_~jYZd$|Oyn{D_0PD|AtUb%d_JBcZmT_--nB6$IE zAg*|6l~9qQI-9_>`srr_e&Y6dG|J7CS1EL*Q79(<-nrJzO`C776W5&2jhN*2>fC=0 z`mFeOD2;5ISnJZL$YkKZu(1&Jy4{V$@9GEqhl-Ig+~4P&VTZg2&Cz#i+U4Ub-6&^= z#lOmyP6T9vRMK;c@rJpT+^e#eZ5r%$L+N)VX%up92+QUkMeOKWiD2Og;;sd@ln^Ls zH55|P*OdjPeaaQtyju>$fTJTp#U>XPG3tG{Firo8j0h&!rYFk~cq0l*cy1?+fq z$7<7-v~O*A70;gCD-UAJ0if_5&T@&jw1I074L#_QRpjFY381lF^_o#n&l(l;Ep9SZ z$XS^L6Hma#lxQAh8w3v&p*lP0C)n%IxQ&PQ0NmjlU)x2IF^E0|nBDix_<1B@SI)P4 z%Q?qnofkX~ru7-_g+c|4i3JYS2=&KsXaX+G-T8ATa7SBGv{!|P4R~Lw5TM4@sJSN)6a(;lJXDd04#ZKK; z``@MJ1`;xV(j_P=j`UlBfQWMXWO0P+MQ}k{&GyC4guLQ1zK*qeQ#~Mx+nWdI!_DKf z>V{7H;wlYLv-&$plv-H@OuW0$TSySL3lxT%2bKeN)~Z&B1}16hEH`{%zzi~V)N?Ma z;Pb_iOhmboFDi(O5a!B~mgTbyE{bwTB7?SSZk$2=a-Wk7xUyBgc|0^`W^RWYhOrR_w@pH!KF z6x+z>8_`4@>sGe)kxij4P_kvGmu?&QgCiSt zA2Hvi^c4Zb0qc2n)Jp(_QQ=wp1`amG5I8qi8nOHo_rfZEOGwbq|D_iQpmq6XGozM2 z;Zdff%lL-<)AHua`N_N`a$-p{v#iU1ToOmX`vDv+Bl>aN=a9{V%m1*2H%rO4;e&?% zS=7Nmvr`v}$(rX_7-rax)R5H^0fS8XOY9a3XWO5&*twnVGp?}>C1w&6hCBt{{Kg|C z;-b`1gaJiA#9u>0hC~DfO$8R4@V)w>RmVlRUF;xw+<3(DyoHzH6Z%zy^SdTxSv3nxju7rkEvPE&D!f6$clt{qDbm+f7$L)RMSPf{8 zc<1J+0nkh>Wymz{?Swy~bt%YZ?yjpGR97Vh0wQ3V@octIS5opoK15zki(=Gw;_?eh zt?RqRjL6T+OHUQIKy-coWl-<4%jLA6CX05LnDluNfV6 z8hnFC-YG??MxtfqYT}KM?C{3_X|F`pKnNAhJ5=cEmQ4cE5VAVCzX(gsc1xE6aGF=r zWOHqvZ8swpG82Kr7^FDQR#tt?^*c@L`<pMJH(~TiV@2I?t_kiQb<)oL*){;m(Jay5wIi18H!&Ycc`q|M%Zaua-t4wyte@#tgvt-S)e~iPtT77WcbW1+6+$Iz)XZ; z?HJP|d}57YYYQY_oy`$S=bOl-1jaxh*lU8m`k?Mk_2B${)sDn+T<1Z1z)=2!)E`<- z?@!Qf8*h^f#NFr|Ngv!Q;Mjd1uCHopU`t?B!c$yZ+U3zP_O3!#q1N3g);3gPvn!n< zg+zNeiWV~V0QK^PZp&4IxqaI`#(i%DZ}AR5v=O?U??qjsSX*bU;StCOfHv5o;VdR) z|Cg>o;VfVD^wS8!j~b*GI>dGW(z+y6`J|Fsasqrksz1H?ix#kgz>F%h`(xdGq7>9+ zjFI?XweA5a1Ao&P166p*Nq#(4w@_>Wn-YgVGli9(kysfFU8)(G{*c>ycIO=_NaC`s*8?lc5db;*2*p&+^+*eDxhn zx3>KcIGZ}}3Kqn79;XSQTT@j#&4=8-XKLH30 zRmj`b=^TK>bH@gwKazsOaAg)zkE50%gcz@HwL}V+(spfG+EB}8fTtYYm_5%}W>_X1 znM{eE#mi4+0@pGh=46gv$Ccu&?67fRp?(F(6-c~`6u@50NWsLPy~tkh<*@r)GoN)2 z0)WAF1R*aX#&2fWRE=&MOB(mB_F#M^$9@b(jp9PzxQ^6S zWDH8ZT2*RI=qb}HA18{z1q>Do#?e|eGwG+?GC}1snxb22@0A>-s{x@H2@h}WE76$> zrzLX?Q+Av&Zyl)DS+M2#WC7y8&rka>;SM^O6jS5U{)yY`#e6IdP$XrTn$EIuI$Drm zWe%`t`?Nd?EB6<%Hc@E6i%{*U`-Sqj55ld9xLs8FFltfm*uV2SQ_IkST_%V<`+-OGI;oN+6hT)QJXnoAc7Ifa zt`=0ip?ePew$sMOZEiZkLn=`UGO+M6GM`<T*V55pHSn>w!NxQF9;huc{oLx-O6I&B`y-a}4@q6*U>0z+-&_Z5`nDYJ-{w9Gk{%U_CC$L_qmw|5>ZlC;_ocTK!qae9)n zg_=tW;aDWV_r-`$@`LN`weH)8IX={xS?2w3_caAl9O)~6?hE+%KY)0-V{ErIM>lyp z>W#}rBt}BrAaFHVC2BVp+uj@|fWPkoC91mNmL?U6L9Qn2-~-QFHTYLNHkA-%2PJ<- z^X|-%^j0{qhMCxO-7m;Y^$YT~*e51PS4-$#_R^2K0j%2LV;2J0HvOp9gmp~6le!wZ zq?iCY=;42#^=4t9_ZXQ6+Gkyl%`L!9iuW|M$}h!my)&OUX|%6Jr1CTy%RB-e;%;=z zWP5bO?yTXoUY4&OpgF(oR8NzsNp5e>U4K9o+>Mq*@`nEPms-)-GUVoa&2HIh3dxkZ-1`GsYDii z*$wEg1c|OaDlHb-%jV#>$M;YYwGLh!(HED;ZzTamxULsFXH?sg6OBgn9Nkcie)Dih z9%xJW(@m#OWV=vwANW(=$Wf63lrI{jKy~vhqVT1e^p1T$zAn=?LB8C{(-QH=j?osg z@ax7RR}uPj7eL3$&%$uzMg)I#P<|*yQ*HT-1ZveGl(4Gu6}#JcPPps|9+lQJ{+;JS zq4gO@3g)9aLT&;<>7$5bh*BF%D|bx6Scnug0N=->#$gE>$%l7KzZO)NF?8Zrz`*)L zHtksHUtmn&MVc|UpL*9{wp~n_#I>o_$8qJ}Qq^KaMZGSxl?liOvpR&>!p6zN1o7Xh z>NUs*bNX3mu@JbzBYG@)wP}T;#<{_It89vrfD@mlf;{%=*T0DkEivrs)d1X0BM5$| zrDA=v`}UC~gpqvPt?-u(K?zQd+5KuSUTM^72?nB6i!%V0UX2kp)v)+yj|>+2FlT^j zx9R1DzHazY`agX0Y=0C@TaH;{t?2NxNy)BLmj{%U%xJ#90>EK-=|v@O0)NE=5d4i z;FuMJf1g32+IzbZQ!OAWzqP~~(5M-&#+#T6A>{Cu5 z2IKPrIgB3v2XD<6my8@3AU?ggbzjX3)BPfhP?O?6rmYi540iZHVuZk<1UAu~BFc19 zUyZ_v{&xWHnb6_2@|ee~dmwBLOkCROcR0zJ9`Hs{{*qg$H36Hkl#?U;_-0C`8C~}q?2761gIukV$-XTo{^kCrwd_4Ewf)!fkyBH<9>4%xYYS%**>sib5C<9}8xR_= z0$hr(Yl3CE+OdfGNvB)>H0yqk=W~I)+Aj{qDKYg}dU59Ide{a(zo; zY{OnL*_qNn+ApqU06hTef{I8UD@!Nep9+ z*+&eifRm3!F9ItBR2GO*eY$BBGWLzu@KK@_ys`%E;HL9w-jw-9?F?@+|XUN>8h_%(qZZ)kM(pY%F3%9q|n%FeX;D7Cr#wK+tM>oXg7j# z=t3r(&>Aup951^jN@~SAg5!H>HeaRW^OWiPyCQfKzs?ZG)xnVIa-@(Onhh6R#UO|Z zj{Yv^64B2O(7G^~w+T1HI(;WVx!{_#>mtkJE{E$;Uf8@ss333e=>*svcehocAysHl zgC!qf>s(<(B`XV@9Sc90@XqDQeRHhV=DofmV)vn>bnxXwW9GP$Ia7~TR&37+WH4udhE-b z8JEy8;RbsrqqP*@R|$rpzFkFatREUouN+1p>lGq&JpPmBGA{J zj)M88mYYqD`9`3ZX+eJNQc7p69V#%55%lRG`g#k9dH8*dlW|3)q3vG}tqN?>y__xc zqKS?q?>v@PHS|T0F`HCmI=C<$fT&59>&;`1-3ycRF2|Elc&u(6u+t5Z6j2V?kd~NU z9sqq=rpot6s|KTpbc_Rl#XAby%Xz`^(iu6@c6p>vP0FYI7y3Dw>M~8y4~dp^H&PMT8HLLxZEfA1`&*P4X%Skdp|q8|ne_dA-8J^GX%VJu__|Fy|S zZ=~pF#~o-hu`l+rJ%k_ zmaD6)d}#y}`MyQYFq>wkzZ#D;pCex~8F^}44S_{fI_)D)Db{q_StNjJR`zkmx;fVs z*r~41pE}UqHRgd`%H-o_TnGlf47=mH&5Di-iHou5H6ZFp4~)%=-ymsNZ}9yKL;uJv z73?^2P7NIfpYl!h3L!q2lBq<6q0ciAU9OW@x1S3eWB0=2KSjW|2ddlBIEgkZA&?Kd z(ZqNa9fdL{X}ql8KA`fm6`LrtwgY}v>9d831ur@^GHJy2u5POQ8e&YBH)Ax;R0>c> zr5%fawQPHBrJ5&OBEj^v#6)u1u`aaUTvQL?u=+X51dr207g)IFK>ZK4G<>3H_nw=4 z!uG=&9$enAJ8=lmoAWNk$t6pzZG(Y9e9dPDj8kJ{2afKYeTH8^eE;J-vayu$?`Jiw zqM+`%)||}Jeq1>bi=nxk!nd4Yl7n(~KXbY(O3ePmd_Vm+nhCs}+PHy$A@hXCtC0kZbfXCD~)KYF(qR{&7fD|z-8_r%-eI#tcH z{aF26#mH6yW<2H5!b9ZDq%~sIQYWHrSgBLH%eg9AqWyLa3=R18D)v}bH_x<;v_KexZhk%D5?0nl4u1PUO z3ZqGXHSMXr)>ocuUVL8GV2XP*fr_ma!Yx$}2Q0S#7S3JtRGoh3n)yUhESjTg z4-fX`smO5wfX81DkV9#V*Yp}H_P4XPeh^X!$Al;w92#v3VZE)%aQ-8TbS2uUEI z#FO%}P0?C@6WcW}a68a3k9|AN{kjA3YNTPj73p3}`B~@i@=6upw;6(V-xu#0jT(5A zaSSrHrS9`v7P2#GM{dk zy<6b$76`WDIWarMR;(-x-d4GzjpjSeoU((Yj>RJ2pjvL=kgg}lxQbARI3ZYi55?q1 z+Wx0^j2wma(!VaDtkdn-9k5qoa)IN~6Yf%WbK$P1HhqJAusKkOOa3f_WVu9GMF~47 zAvWhoB>cm#v(E0=C=aU1Ql*F84-opR>QJ1=u07cC9BC^^FX9u7s=%TN)vt7>xqQE6 zIIw8$@4hTt=jjm+a^Qv|4~6fM;ujkO3d*wd? z!w`BpCksXmczy~gZA?Z!rqY%t251skac*OJ=uhRULjFhLG!KTuj<7w6yh0PX^B9yp zM$19D!3Hjuv?JFTp(mrb$olBk9CDRU5GW4jH{JxM$#CYQe5Z-Wk1=xfaCKh~$r(p4 zB=+EMw|oB8lLxU>+VU%Sq_Gr81uZiysd1gCbEs=v1wddx9^$cv`hz#$5$L;TqIysC zjb~WRWC!9HW*G|~%_4U?h{;vFk7qew@zB@cQV6-SFZJ7xoBFjj?^ZM$AqqCxgGXo& zp=V9VxAME|aw=|Dk(W%hc3tn^6CQf=VJDADMel+XxgwF|0of4Q5$YdvRkQ4yLb+*R18tiJI7<#u2vU?8wJvV!8_`Jc_<8wxA6o6gaY+-i@tY~Z=QF1_6+$}bo$P9 zJ#WmF`K1a=CTMLyngFH(vv||jG&Vp0q^7X(Ngd4G*iB&bqe~0hu>AvrqobiBva}aq zEN}I|oYEQI0H6Tfc&z}c((v{4>p?Lw_z_qH&@Nz|fhlSL(E0&P^FumQYoOzB`OJUN z<$>G0>9o^316KJ>F*(ffc-KUbP7kh4O${&axWP#oAMV9_yGS$upw80Z@oinfxc%E3 zQ2G6Z(?AMH_xXo(T9=;|i<* z;SM~(`=f-B2^stU08v1$zwelif13l`fxv&Iu{C%9%U4NFO$p#+Zs+U)bT)Uk1RHvo zdw9A7%>I&re}PuCe-{V@NP4=t{m!BMzbd!?r1{^{B|zZLj2!&~%)S46#mt>O-TnT- z&A;2W1Ub9gxqG<(9T5nywsQpjuHOCkn%O!3B~unxk(ZIy)M8cw51uo#G6>9$GmD3h z$6waJ|%mcmVADTmUxkkV-pSNrIf5z*V~={iaXK4$PAW$jz7a{~c@xXOOqE z|No(|wsW?!{>{CWrwgmLvz@CaP+sbP%)uh0KQbGj2Y?L#bOiu?ENxkTC;V$(ev8?E zi@`($_`85y0M_P??!W*$YasXq$=}`F3kdLV^8^O?|5NdAgv8DZu(GrC0FOF&yCD4) zUEbLm1mOQ$46fvVRsS;tbboDCdhkBA0y#VS0<3`6NUSO#5AaCP{r|Jm{wtS^r=z2a zxf77?|Kaq%4b7eG9DV<7`d=oxz~9x!_U|p_2%cT=`D6F{_yRDqbMgF_4m_5Y4$eS#cL3MlZa^>*|5Y)V z{onNhSal>cvhg9svMrkQ>tP1?AxZuuA+E{f+nmtkVBMylengnLmgfz$*I(aRON7 z{~#^^tHK||2VhnCgTOIW|AY9zG1dMca7^_-hy%c?@dtr3X#PRq3|fB>FMw6|4+7`Y z`w!v=>&*Wku+HKS0_U@E15X;z!x3oh@kh@2ANk)i`yU0kc+3AFZg4P5kRy0a|5w7r z^;_cP^d})Z8@NNOe?V|b;GYO!x`F@7z|IEl+WHUV0B5we`{Tg*8+!dC!f$hsr`taQ zfK6=v0l_8N{wa_fjC@^efzJQ10L$$D0l_ud{{w>gbNB}Y_w4u&2rkd*4`c^7`zJCt z*wq<4-v7{py9fO#2J8&_mm1uR%O5p3n2S012Kd+7aIyc7^xrE3-czhDKsP(kKe%QG zGvWFNa)HZn^#p+rcnimWg=FXA`=j}H*x!5gZ`FUv*}=5_gLHNI7^A87b+&|&C!A*JCx&i;OuHfc9yg~nP09Wt%4+t*V>mLwIrT0Ik2JHQhWE|k| zzJI6!yZQm${*L|cQ%3FgP5ajs!uIFb`JYFSzp$o<8^{5uYi9+1{Q8H9vN?F8_!zQ* z&wqBX9Q^aY?~MPIfcnqX^$%|e36PIJGZ!ZtfSH3Id|GjVdj-z|Z@|BNE&qNR`0MTg zpO62Ge_zD_AkYVBiL|l^vJ?!r&uWdV43sYZS_MnZ&+?-NPee~41!g7ZYZozrRN?L$ zplC@*TW~H-2}ns!z&J1?#JNn5Ivm&WWwSlKcKXIjU2M-hP&tqoO2Yx#CNPV z7$(q|$^@kL{K?P;JeM`+GKb+61Z)6_7)1%V_Y2X6S@p7Ws=aQ~n|BB;2N2)MYszl* z`T9qFQ|TXaoRGjMZ)5m7!zRc3M#xyUe;J+7-sgAJWb#l+0BXeOuT5}QNpzsrVyM= zHj826)!H68_^~``podndLo`N~Tx0A_zg6BaJu#ZlM&I9fOpUJ6qO{czr?V3KG?#j_ zD*sZD_mqzPmit$PyF_y0v@!%C5Y9@K2J=cX6 zbW^9y_3^Vhk?+B|D6R;N>9UxtqIDbFm;s`+QPIbq2C7$1U~Q<<+71$aeWHLY9n&`) zWJK%vlhAQPXyu`GW5*t6l59NWhMNjc>HWpIAAxMW8uxcOQ66|db308+;5AXzj$bl+ z?fb60D~ff!2zd6huPDkkj%tvgYrmeSus1qOa&VBVF661V;A$ct6E%7GUK8g#rys~7 zAz#BlKev$f#0S6%6Pw;8R*XSjPdSq%>WZ2i4uojBFIPxd6TsxVW`MLZ64P5ne$K9t8uSYiQuSGj#WsVbb{9{SuZve|XlvEfpJg8G z&FG3SoS4f*O5q1)>MX@L6x1Zfr`(mP*i%BRdz6tqdyyg>&B(BSLYy zzk15!OIk@`51hV7kSqDc$*jj5_j>(xMr3IMp5__~Rq;YW#557-q1&l(d=`D&A$37UkIr;EGb2uU z)~Aqd+FT6#Yv{pDnDq9@-JiL5iuE&EP$Z7$lIcT~;-&~UNu57#%X*dV@>v{FFp)!u z6<~(faVLO`v^dr(SN4oh5-?VBr36XZ=~b7NXbjU75OizzlX2b}w4IE)PbToo9H46I z9=u(?KSpL-m0xXn_}} z66~TVAvg}G%^TG1&=#rYkFK=GPKHUhh3@L_0yU|R6X+v8`WN6FGrd(uv<~^?%9Kh= z9uoKb6nl@D*R?VEx?{3a(CLd2t8W*hqt%CG%2s+0xh9>($xFa1AefXHha)zW((udG zYkMk{7Bz~&5V%_^CdrsJ8Dw{7Q|5QwvCWiLvRL4UfXA}@=%}wk?1<5GwXPNVHist+ z&Ig&@SNOADEIyh6pb`0Ppufk0A0>z5@-F8auj@Bq)99{tXBypJK3t!KBT`4-w9zR! zT4@+6HJ#M@P8-b=vL zQQXy6lHe=qGo0(^B=4`as2$U!qr}PmL{31g0e`a1=UNdF8!ko|j?v7gZ|;J;#MfqA z+=jc~zrW;CaP6J<^gEQ+BL=u7d%J7Ri1A{7c`wkj8~2NBJH)MF;K+)m($`yde)r%z zH*YM)qtJ_;(c2vFgoX`9Ez_I!v;>wTsN6*$&G-joXi6HB2GNnsN_U~|f~XIV!&DaJ z{duAm;u0ZUEkY&sA?6D_179JDm{t{+mWb5xc90FHJ(+m&wgsC!%>8DeAS@H^_Vf!Z z>gnvmULpeyIam2WX|=3W#6}e@hF1yQcy7oIgG@PDJ$hP9(iggN4MjzqKLTDSs7+u` z%)dc!r#m{cL0N$&A>CtZ+G{nszAjF^|33P)e2CeR>{YCMop!(PjhF~QZC)Xxo_7nc z>>NAI{66ioU&o7qE7={xAg$@fF^?iz!c^J8iXn<%K08j;7&A(@#ECx!ayF+hgt&H0 ztjheL+0Ip%*cNY<=bHJ6JbkrA6!XUqOTO>$+-{d>!wJ8Nq_&V*Oo7)DZWMO_3Y3mmAKyR!SY8 zKZIrv7+{?nT_z`gp4h-gaNp_o6#vNJ14DG$c6r8l~XrsyavYylgG5vT(7%^eW?2l@j(II&o>d$1bhYLwlT8 zNrvrFoOi+03n7{?n4#~-rc81~*XOcy<(zL08$+DuNWDPfIRiv@hq19j+U*PaFH5{E zSMtB0Z2HBp^Erw~ScyW3^?EdIB0Q+MwX25mR83bYW_CM7g#zT=gqqX}=#z6Ga;>Q+ zHS^PF46(aBCVQNptWz6);IKqGem5oWPX9{8{Dw@}>Z{xomkx3-R(NvFWu97U== z`GN*>Y=AtG+~zE_>n{hWQizn7kD5xQbO+0c&k@!!qB@Nvrf}D2yB87l4le@R)P-8C zs6n>G7r*%7t}t=@i)5DKEm~Q7iVLN~t_P*#SEqxDhF)WTa-e!bvA1YECSSg(AK=4B zIrEAuZS7v1QAc}pIHw{UC8qqDoNin*mU@~fodz(tZkbDL4==2OX?RcK-o`gq(Zj^*{*$3} zz4;$?5y*Ad9+p(zvf*11SY`?pR~uuG!$M#<glgKY{Fpb2Ms$KlO{ zdlGtR!}Xd+lj46l^Xq5o!*oe}DLH=g4<0B_;);!!UDCv7e1oCYL}=0LE%fyuRU4C2 zw8l@sgr8BP<(@0YLT)w+I)wbstTUER0UU^q_JJx0q~;rbqAR?jIYEl6PYZ_KJwGV5 z;Y>fi96H98v&yF-W&rTzO*-_qFbSaaew zv(1d4GV|XjM$K!BWqhEHoe=OuOP^jCn5|yqUJZJ|?{?D&n}QU|N6ZsgFzXyGXHaV@ z;Bk@ch&Rj(hb*29$#S9)s~P$wYG$%GqJUBPNnN7k-kJ8GR~PbOet91s>F&8#2oaAZ zR&{7nwqLDcn71bzw-=$5=lLgG8yTB@;ayVxXqZAmUM{awu4eA(<9=`U^;-q5viCZ) z=$(_C@HnnD*m=oQK?(2z@v`$iFZj_Py^@Yz1U$G7MCtm(1CeKY^#|QVJ6QXRK2~xx z$Qj^9@jRIbIG3C%DDxUJORUX&LiIC&Zhm@qqIvCpPF2COembT0KGk7iZ}8{0fwNmi z8P#u^8n@0q3vrj*sjS^|OI@~5G?#OcWTd{CbRqUpj-ZaJds;MToQNHfL1J+dO#!2! z-4>lD9yuKWRC6rK(Wrs<#JSN!`n@X?f)8Ja#e5_X(YUhH6D4;>`dWA$O?ePvC|x$; z1@H&#n?EzAH937&ef<)<;q=G_du@f->@AdiO!a|C{KNKp(J<3r4p!yo?-k&_ zt~Qv|cpUnF+K*Sudj1jUm5xpI{ZJGrF+86ShfbXKdGzzTk|8Xss05)NvvhiHynru! zId#*g5KH4lwHufYoXpto8W%3=VvUp@FDJ~`XM}4>7AU_l^@I>oT;TG4BA9Jfva;+W zSoa+uL;kpT8r9KVCPooEY*;^CWSHc6PgoIE2D@!&9)Sxg4ktz>_PEjISf$%SZes_;NKu&y8Hk^DW+Jh-U=#~Z;0)Q; z3f&RDBVRc@Ij|{%L=Awi=x%?NYODcd6z6#mh>Gunm~^^Y^1jvG9pUM(U@x16GuC}M zF`@_>is*AR*q0qm9TwqV`}$?7WSV%>1myk$zUliW#OX&dogP6nHI+&0-qkF(4ZjU&Po=NMX57<0FYSFB#pf%-rxFS$-)9(boCg&u`k(l|#ta%TRiS7n-7-Dh@o@Y7vH zV34*KQ((^}S{W&wtf{&oYCFFlWjgLLrNcxr$IZFJmoq~`mpOz^p|puRwKYS1a@|IC z-V#JkWrVW41*G8uU|KHx2lLkNtoJDKwqFp*p!A9BHL@o|ZoTf_)=3@^*an6OK88i^B!2G2DFl25+Pgt_2 zQOX;X>sWx2(xPr38&&^`R5D0#W6GR5eQf0iM5s8;g6qNsf%^iUd8}8XwKFSUY1=+7Nrv77@VbX<{~iuiQu8)@hq|5$a=75)CV_zC zkWZE&i7362C~;vH=dc$=Bvq-`()CbUOztgd%ykMRYR43$YdA1g#n0o+@y&p{UkJSA zM4rl|iZ`s-jgK07j<}&w?@x?qiM}_*dsxqS9@m=2)$(Xbu*9-v@u^3q_hn{K;rHlR z{a4Y9RL8y-Gl;bICws1>B*t%+0UP1Y%9K#iH0-SKcerb=Qb9GuYY`|;fzKJH5u$O0 zeHhld%|;ysT)kANuO1)nv|eUbYER7&U_SXcQsg89Dkd#hb5VTvEe$ZHoAP(nYSH&$ zgKbM}W9nyDho|zzmR0dvYbK*4>0w!xarP~_6I?d^hdN#+dHv-qg(2Zvfl|XY+`KA- zelFwi(QK>ob#2JcfurS)JD*UKw_wp=rj%PMhVdyI*cpIv)Irq)(_V9?wV$=7((D%6 zg64H-b{Yhs#|u9P4yboa)4{qi!CdADiV6|4Fi;E3P`A-|e0(Q5Kv`XV*Z>f4lCU1e`!^Lb|k?D^J1?pH4WABeu`Bm zT?prJcWI%Z-r171@jPp#2CF4XMRw^@EDsu@z6H(A9>?~~!{vS%fICN#wr2gY^E~}fIldZv= zbj1rSr#%e`%P=woq_wfkZ>HzDLopukopFJPrP}z!%8iYePCptL)p+u!_cmi@zq%8n z50FZo47Bm&z`Vv|SSwzmx_-3HB` z#+Ae(_#ZRBF6`j?hr{s^a$GcNVyQVoU6%OB;8Ap=hHKo+N_7;yet?c{rs98=YAy55e0vbDHs{f>|IC=69CMca9r`Zc==GGzfO z(u^h&w21@b;#u*H%!a`#b2V$lM&8DM96`kgDOdj*-`>dJF{~O;lX})kX%Rmikr;Pf8YMxak3|+qHm_&OzT7p*Fi{_91@Vy> zi)++MD}~w3e60==2$$LYz1N$Mc-s;-%jQaQ!lIoT&EQNV1SOoGDuPjNlz4&7!p+bN zzWbirjgd-)tSq%0V_U3+H&ntL3i@G$Neu3j-CE0*Le;e14Gv2DoOXKrnRp&kj0Wd4 zAHVsZ%6+VWk|Ua$`cB0M&yUQEH6lgGZP!4TgcFN@uAnrF(?HpX`3B01yf<+@7k+08 z%k9nxfVl7ZG}rB?;rO#E)e39N<(8b!?wk>(GEy=d_PiAJ7@=R;GvE{`v<~xiR@6Vm zX??+cJ3h;Rjg%CJf~SZ!kUDc4^ZRLjIF%KGctJ5q6zbxTq};HjRE7Av8?}JO?HSXi zUNw)+@zo!}rP^|cLBNp~5!e959=9)g9t}u1*cRAqosTQyBql%A<&vQ7ux-&qK8|>N z{D#y(ysmWQm=@rI2%@lUjbIEfkBI_k9;LxU>hWzoW`z8A^^uTty#3aWB*Dd>zYv{b%-XVIeB4HBK! z#6%E`897xhV|FRFLOZnT;6OFT;@Vxy!Rx&ZOX40K&fV+ag~Bb;*K8Aq4b5!+@-q6( z4_YK@t6F&M<1c!WUo}fVt(NSLej&#i#mHvJc{xN##$$-HUgC+i8Gzf3&tF!aj#aS9gGKl zeAQ!<9R3OCScGQ;xU2{59Qxs~ouPVX|2=g(a%CC7lWhM0VZLj4i8}i#B zdzECq@HQ#Su=sXA(lv{b&QGgVxV7w`*4-d@^-D66RsyY5g$d(mO+OQ=4D+&iC{Rka z_cX=DQovPtjD3mMz>NKTmi?nQ(a{W2knbkXR9TA4mU3lxUriB>VJ-Wra8k0jbraTj zAf8y%Jj#<;{92CJ&y0cD=uAN@Ka3!O%;|?=UW1}IvvIO%h6q3E61NJ2fxSj*$=Gnn z;LRZBT`nnQh2JXsTuHoZa=nd41j;7_ZJVF9qKdo`xYmm~W%3U}HGQM#O44Z>_c(di z(EO{Vs!2sq83(51U)j4ir8DFWcuXY~eh%G2LR@A=d?8_$?wbvuxKC}bOFfiBH;iRy zX!Ei2Bi{4l)BbvO`nbp5lhlHsrT z*cMINMst}HP#Ss4f7fL?0C~smlT}(B%+wy>E4djVm|0ds-{6;T;-wU zUiOAR=5nsRI{*}ONKkRkuAUs!-sq_@V@D<5is@bU=}t)d5^?#_3QE2ClImDaUNAu^ z=Z>OayrnXsK`=i|BW*RFiQlWbEBstaDz=e(yD>M8Zz@7&&fo)UfYaqq+w9kNG$A%( z^y3};E)i&_=&en1Do&8$!vv~QlisnOi$dZ^YAPp!8|`^-V{xb+#df7#roB(WhwA{Z zIiWkFsMI&%K@s|96B#t}5}%CO4Rw~PTkmTv)#yg!6#Iy&mNfUb7%>W4LPFM20Yc9 z;74fhvP-#i2U`8`ZD465Ir}7g6;X7DxZr2M1QHG`-()m0MAY&Yw^X(C zRN||u>1vpwPS&s|KL>9TMjZZFXe`#};5s-NBVfE;F~By=drc{X;4OyIv|6jMlw>_v zL#8p^&?OX141yTIV{O1(mv{Sg%k)($dXaygG9BBBkfBs0eAPgCAH_a`kbLXV;PmuU zK)##6^xIPz`SqDKNNgvA`K$#WBKMV3s0~U!)^%fcGQbGD&QY41-#Gus!Z14WQh(Ks zwB$FB4mXmdcPY^OKkq*nupe3hN!DM!*8~Tg3>FWE@6;HBMh6@oUbAF_;wi|xJ`_Gx zb6N%vYQ0TJwWuLI2AXoB_wLC8JbS(@cI}=xp5mpSv-Lg+WFa^; z2ilGyDLR^N#i6o)_U`VoDDyfOyJ&b$bFhNeyv={qI9x<)yM$mZ?9Qk0>!hJo;3-O^ zZt0$M|4BpjX;a>5uvIw`H=W9=$N)^hL0g^9YA4BfZf&QX6L&Z5rb2yM>EclgpThm zlrUnJ%#xr-xq#MaYRfZ996ak@4!!1&7t*6dkSgDcRu{JhTh{3BXo)}r*9Oru7oc&a z^E!D4*R0bT4KlsG!Rzy_+mKFvZ_1PG;2>YQI}d#|(lw4x!<@z3knWX#ub*N4lT>pl z(zUxgk^pi+=iT1ok8ex|69sz;vDMKqHw880mBemKQb_(g{IFuB`;3hgMwn^XI|y>} z@mv^MCkxM*PP?5mefuE`7nPEgC|t9jqX;@KH_@f28cZ9F&V0-$# z$u`>Sp|uTa>`;|=;3o!1r_x2@e2lM`LMKcrh%^1v$VHnumLrQ;esWT1T*UhtLKK;9AD+ zyF6Jpd~|)Uyc2a}nv@;MzYAlmn{JSrOIKONM6qq`6;Qt{H7D&_E}fle>oX^^%Sn)@g*&H6__esD zAMqMJOYK+fQ9r_RJZAcbUp|vf3=n3I-#ldSZS^t_ANHHKt`g%&Z%hgcY8KGAS3Q5l z;G2KOG9P&#()2~hP&%>3rS?fH1R7%;y<8I5^!eOoO44A3$6IO}s&#m6kK zzLpKD`qF*ai0LWmL6#4?;rF_=2Is>U|Ed6f59=+j&!#FW6ys?YkmCkPAx7P#Wjs*W za4@Z$(&UGI#Z~;$pUfa2M94j5JqQuFX$S0(Sc4Y9b43`dM4pAvT477(Gkwc0sA}cV zB^5<4e4N?k(w?^pm#uFiY+Z*555F!J-N?frFmo?}(~&-JskWZ?Ci0=g?O??CLy=L5 z`+4>~leL(fxs8jN_!?Aq%mfhG)M|H#tXpz*T)7o82w(4=P>w&I&={;k@q0}5BL9OO zb($u@+ZslKcM+9>u!Os=oVjOKojq?pe$?=p@ZKL+yU2rj|4fBCgP(o%v*`(jPfgWt zt0FOi)P_|*DrV*kIr}n&!!E>9Ht8eWwml2#`^R;!MWA;xD%pxLICwmtPem zIe8UVa><6MN#susbtN|_4$kL#2FVE?L9N}4RTySv+4J0cF zXqMaZ2Hi!Ed|Wzpo%dc^#hV29@rC+7PF^n+xZZr9l|3%)CH|qg0r~!^i!Hl)Tr1rI zvq|K`f+zn+g(4ZO3ni_EWbd}%Q1(rssOc3@_%4NSWVX8n=BS9=m}F0AR8!lQ6_PJV z@dz$%7kN|q+t6F2539$)m{D*PbaHGe_z8O&LN0!tbjejCLr-6nW>y zsr}vFM6LUfE8cxrff%dn6PA%y5g)lYqQ$@$Pkl`J@%r55Qi80lUUxN_89$UUwIrNn7DUv=pR8W#F2|fyiH}LFAVZQv z)y>HOvN=yPn5@%q9U|OOx0mLkrm&lF(c<`y3Q>fsOrFJ47*7NFYexVhAp{(GRu|9F zAv=DY_KKSzHfd&4T9)+!b1SV4cKF@itq&)|#k=M4F|=1o&|{D&0ZZICJ3EmVNrB_% z@J-FKceS#|cK^rxf6yQhozrgEB;~*{=BE;dO|C>IQ5hJ@_5+X#vqLkC6m@!U$dLsH z-c#R%HU+%RgE%>nPkvT-1!&ukc z)uuKRq5u`B?dmftzeY|)ZszNSYK3QHh1hZ_tPs)GQilCBI}PNa)7oxj)S-5IS`aMm z2>K!1B(5sfbp!5i8mRjOoy$ki@qb8?gD~vGf)_r9bccI>l?V8|6=#D^`dJsLK;c4fBP!6v09UEsN`LMl6)ALWK6^(+ssg2~MlePlHw$C|;jJYCWRW?rJv6eb*$?4o$}F?TN~T6Z=|= z#~g7+fe4Va6fCUFoYEBaAjCp3Rc`XcS=I!zRJUk}4oO0^LopoHf}duvt^w`F(eDmH z5^GS%eL?4Y(4TdJ(#2KVIF%$`s`ctwZH~tKqxgDG3e=$Lu-FE>OucF;xF(d>5G<#! zzWmC5w*TxT=@4`Adh55Y93VpmzJw_f&3Ae?&g7g|ixbkwwUm^v$^(+#*%ZM}ve(eU ztc=t9h+_36-|fYh{xqQT+xD?;xDacmlkdbMk5|)M1>9C-YLQY@f{G6&rXNNO$v$MV z7Wh<^Qi^f`gKtIEN9%)K-+1c`o)hhn$7@u48gd5&HbEvBAs$DMA-LDsp{36Ya%I3k z8=H~TB&jrBf}()t612l4{3vWlsQqV6blb68G42NXB_++Vy^3MR+^rS$iA!0STUyfTkU4f?-Ca4`)XP$knI$J5W6h4>ygr)?p-Yj^F#;_aTrH~_J+qP zdKYI$}@t-r%}8F3&`6;@e2tdkEntcHE<6(#XCU zY{godACR8*imQfRcfp3#OB0ROCDo2q(OYhJi|+Tv4w+lMZIHWoH?>=&>%=qa$iZ0y z__f9j+rt=7zsAG%i5Y`2hPN%UQjX82bZbJttIUPw<$w?W5rn@Oy~^a_$AXXw4Sw+=zoG9ZV6(Mq8LAo*KTC;=6sBZd_b_k<8s&Z zLgt>_4ZTEHXoEs05OdMT43%@K&MANF_d=j8Rq6K(U}nhRQpg=f7efib z+6)-r@ucXxW19KYAdT{XlPAMW5kboRXBQ*CBjF&B5 zGfrmD+K+@HCb?|Sm>0?}ySA6}Ekg$tYDo+2+vG}=P^+d8rUcIdy0OFB9qE@SbXoRm ztsY(KVWLYkGq$@XlRvkRKyL47)x|q`GVwxwxEx;0^(s&b!P|YC{4i*b>rtF*UV8F% zfv~nT7*d#f0Lm}gOCSj8Y6E3T>}u*+*~dVVPE-`ezMIwASBU-Ob|f3PN53G=g6KNo zPSY`*;Q3JR-eU1HggHH>Jiyf3_`Vz|NbDOoZ2Cv`_!Qko#Qq+8H)m=k*#Z~D;0_SR zVGGA3s){vRSweu()>@!~kp8JQ@CwmkKsgBODcOYCX&{PsQv_x3zdnK*Ht6F_d;1wL zdH{MTMf&~8hut{#VH%U3GN`Y);rpgkth;LgO8=i+i;s$v9SaqdWUP= zxG>+!$3eY748^qVVO=2?2D#xkKh`o_#r8{ENBUH3XH36x`oabtcodm1loI$uLHmwp zE63OCr)%F`Z^(O@9fu+0e2Hz*w5RsO$wWm@Y0T1%N5!%^&{ecMYtvJiQoAxGzfD>X%mZ$cxU_x4sGoYej}szVu0 zSeDXtEFFr`QU)}HaM}EuA5;7-)|WeQS$ypTcyFQK+%gHK4iqGPRl`QV8(!XL|K9w6 z{Ns!DBHFdcv0Tlh-g0ZY?Ki(B@1btI83N?3IBQc5*_t%AQamEG`#4=UsNgOphd5Re zAfIHR@f79JVn6451j7d!uBDgcGP*AbW5eOWb1MkA6j!G=tameoDw+_OGijTZQ0)sE zD)Jw^jb9gCiEMVP+TBm76+I%KC2xLC7`$}T(9P`2Zk)FwGHA_WU#Vwk^{3fg zJQ&$C*WGMh#hDH#<Iu2dkq0DQXj)131{6`W4GTQ-vem(3Om@y^5yJ2|iS!i2 zSk38Gd2M1sLrnO`Bz4DCbU`i?zB7j0(MHj*YCA#Y=ZR77mN6e5;8V$Vf@g_(JSS4Q zd~u(T6PY_>hljoW>ZMN!x7@`RCOAWKNf@u*gV>a0FNqqoXJ1Y#jyW!_aPzt7m9)@d zJtVMGs=q^M>gNUf(`zC4*#zqQ*H%F>c|!KA4QsKnvTIjF0~*wWb;!2OiZn*iQkfAF zThvuT_Xgam2=Ba177+F~Rw5_uCtJ62&O`Ivle9F-RxxWC!=LnS_D08W!v46?IRt0I zt+Qm&DT<9Em6)q~mZVLMVmsf5sC>1!KBjCFBaPa3TXkQCoDW%IdVUXZ0F_{oku5z4 zx4Nn5Fzwl_I6(I`s2V><22M_ud%Ecr>|vrD_ZodG(8Df$1CeC~f$7PFLg*B&YY;F#@tvL z3c0N(6u+DdQO68&trKZ4KU(FcjJOK<3%$IsKzx^g;f$`I4VkYrqMpifh^dTQdEFfg z567Z{waeSGw5#4|uh>njeWbpz6LVSgQ5su2Nv2DDpOuUqP?Tj`&0p;Q zB!hJ6Xiy&}kPWiU7-;l?SuXx1@_*c95F+b`Wa5{~c%enu%N;nOD;v+>u@EY8TfXhR zs7Il1l2C0(A8HL*)oBW&XApUJPs;16mWpN=hu5>kxz4$2gX z4mM3bXK6LaVD$58by{No8Z7nnt;iKLkE<{MZg5R6%B`+Z zP|TU43I-}`1d%@+DLyaI!N70-!XpZebT^fAT_p8(m^amD7Gf34Np^o5xtcLIZD>wx zH0-@zF_2J4_GedPoFTE+7%a@na3I3dCFGn)a;$5+qHa0aJGkv%z9?!unQF;C?^O}m za%`z0(i2_RxZzT9dV0^6gZo+n`?8m@@mWN*c|J&s6eY6u@kYR+Xvr^Xlyv$H#nM=( z$;os;o$oqizQvp1S&yC*)oFn=n^vAl`7qd3){d-TWFq^Jy-rVz4#9vPyK3JWtBA7% zo89@vDU2@l3kt#IY(%Y)o{%eq4qUo#&pz<(z?VA$-<%CLumnlncp;H!us#Dqtj zNOumthDi)%x_eoL+3W}S$?%vH3>w>@Hv<# z3;X(blg4Wph~sHCZF6VJx;sC-_rll~VQ{redLNgWG`%Z@N;f&K%sz7PZB5UJc{a`n z8g|sStxoxguY#hkmt@$kQ)x+H6_dqu&W(y*tIVM+jjPX|kP{#bT4CEY%(C zyClTKyBukw)!Qc^f7$bcJ3aVPb`10MqjQJHY=H-o|JKfS4_}#jl_nGd=nGt7aIi1w z%%!D4Q-%!|RnkKb)^cFZ_QzLU5G{crMs*!Jrrt9!MGt91d0%(}6&GH__WW@9-K4ty zL7{tPDCEVC>>3fRB0?k<4?6oz{DBXUK-C{A<2amhn2nfNn_z;&*}pavE~&jl>7AI- zwAN-=+$)WOP{x^Xyo{#BSYk@kuzosk)_~FoyVn%!0}Ok25JSar zdC*x99v5kuSlVZy9WpjEky?ldk`dG9!kz!)dtxe%LxO}y6nD?E{5nhG(PR`^`sNi9 z3etWpSzKKEY<{CrLGu`bf~~n~i(ym8dd#^Gc^;)%l*`X~^X#7J$5_14vK32ggt&gX@sU)SET7HXsOTcpWj zmD%$YB3ZaVSHCP_23^?!J z+tldG&e*5 zSnHmMh{Dw6i|iFEnh?!+#d>q=75CG8-nQ#!_du!kZB)r1;q_lP>{%MLn>0TwB`HRx z%5X|Qz|pH~Od-K+S(PT-DQj)qJfxr9O?ABFr0{&M z+IFo+5~j&ew=%gY=Fg+!xXc>xL0DQBNJBJvGGm}<%96`28M((G37G_K1TudT{1y^2 z=R{p2hH~1$TWWOEjqI(4X=Ve#sMSbY*q=~QBCzI}c9dv>;z{T#Dv_^G)NdhAS?AQ2 ztvtVmD$VlE4k;0qIB<(SZS}GZ3mu(7k^#Z#HBJOaq9_xhOt1no9OjYdjlV8jK2hY& ztfn^$a>#d;%AK#z9)tQbm)2C$cNX5E^NuJNufClk%ssGe3TfMi7KSJbxWuWMcfxp&p6o?lNHis?skDp8_RtNX0R$SnVNs1Q2eyQC6w`_5d3a4Hz<+R`Y))H#GKu_;( zK9Px`f=*@0wn5tns=_+jPp9V2=|ER+G|toT1w9H;$HGOa&zMJc9|xKmQ%OJK>}&Id zh>shO zR`%L`i6T)KY2o8G1ms-I8@ySTcu5n}^ zA4>qW>}a!(-73gk$CaKu%T_I*v>iH{SDD4XyTdKjb%qiuWcRGVurxUY<`!!eet(rt znu=u_-zfAdR%1Ojs@oFwP`Q`#Exb73s5Ij=MT=NUN{N$vP3h8{lExuDTu3_du0BQS z2CE|^_mh9xwY%KG(IrI)6g{MbE01E@{@J(&t@Ex1m&zWLD&Sj`YUpcW>U)@PNoM4r zSj(?Z*Vu;N_hks-N6rJriHys%&vM;T{>L1tYbVqVL z=F)%Wdm5<~02=yx$@AE|oQb$se4|(rle9RCP-_o+B>m5!P02SKD{ja)CfOM^3D?T^ zWpE5Q(+=A6&}l<`UPZWxE6j3^^4)%HQH&R6pytB)ODr6RJ5g?n#7x;Q$4n`0y1Gr6 zT~WM8DG>r$xv4dBGA*>Faf&Q252z^#-n#f(V(ZO4L82e=Tu*%5M4>|1d(Yl>PdqVD z2C|<0IZ#}HpCbq# z7U^pW6Wfj3w(ZE%Li^~r<$1PG9lwWgXNQO{lEhdKm}!)V#U(2xzJV6wtE3D@O#1*h zt(8Yytx~+*)Ue1|6ch}j`*j-G(E-WWL03>L#Ixt9xw|$-;d4$Fw9$_whJGs~mSiDYgEhHwFeNV1WnL>Q& zwAFnCpIHo2NU6-iEr~uqER`FNP;h`lbtj?{n+21_fFi6w@e+3$;q#%a7dItW92HNv zqRVpeNp!g!?dNJ+Q{?EcTG1@GFAS zre-H}N=Az!xtQBSlkBvlUaP1!jZ4LaAI-k(H_kh>P$6X3W~fsHu3*szwX!=;*~`a1 zyp(oFe;-J)Owjzm^E1`*i*}w#ARFIXk(W#J#I3m87HchWB99MzVzR=IrIW+Mp*mal zss`!bP^uoyDJG{kD5+JcRtDr%9G+K*4$wLJSWAh^Es|*<%s4kXx(QS;Q;>~d5+GU9 z#!nLE8W1#6{R8NDsW>^XmXQcj9<(^MQLOu^WOAbT&6lbms=u%6%CB!wLm3Z(h=NZC z41IGJQTfA&9z)G-xk0kcnyd*Q7`t^5>t9R>3UlgII-3SN6n&1zt#J`h6$CWN18HsM z$kY%fv^wG&i^d1gB43d zH}>!w3nf;wIYd_XK3v*{YnH+)zyLtv*zhu-llJ#Cx>T+*A6(#9^trif1qAqS8eFpwP$8 z#_V8H;3Mj3XvnS>wjDnTBWPQ$+m2)Ghc=`>CqgjyEnp?UT2Hjz5x;{{GJb1CMLkuE zAL4#kfJ~}ll8j!pd-{}NQur=)YFm!ZzRMw;!Ixx9NQ=>OZ;<%MyVoVSI=huGBr)2> zxy@`=ADtoq>!{G@+ZYZUUaT#!wfDOp{iFSd>wPNU)1rRhEHdil4t|;!I9+(H3J^qr z(BK$V79I*8ez!~W^5NDwR8ZNV26bw{h|A;M<$f*n^7iF?sofsCFyl|g zI;N;S!FwqvEGk;WL~9VCaZ64XgEL_J&F#*jDqnq&!5whoic7*WhSQ)boOmd{8PC`p zy80{9ve0>HissGFW>&Y*Q(-Mff>lMO#e*fi7R7@WHke5Gj66K=9|Nuci)}j zK}i2!Tj#7LiUJ_Pv2EM7@7T6&+qP}nwr$(CZO?Ayp0dD((DC*b&gmb5F1wTpL3f`6$6U6S)BM{sum^Yokk7X$VLWlCZ`(CTaE76qfCxeELNpKzirQ3*JXJCT zmSmZ*#cd&CvkLR{h4DJECQkPYps+$}Y!9!cwsstf7^`YD9!Wh+5EEHd>a$u6+l9z> zE*#G@h-qf7z%k}LN`iv70*$S~Dtwh}B0FZSBEGG@bHV)G8r%3gHh}O?A8LMf=Bm0s z1Ig3T(K7F*iMF-=(QE8E;UB$D^XYFEL0V5{*xV+Vb+3)cN)aK*y(OlaC zm`&J}?9eN1X;oW+Z(v~6DmA2LdEUvwjt8aqk((X!l93UZ}O>eG0zX2_dZ@EXn z5@=Ue@?gYb%3d5SUO<^~QW#Yq+`;VPqihsKwk^tC#_dN}*B(+sK8Sm0tt7`bYJ#q) zg16$W@DrEIC_$+;%Z&<9ZB~o)4f?M3d5&QiS|1*RWwrQE_}uPaat6w9Yo7e8VO;LD zxnNs{q|)+F*+0o$5M+2* zlrnS!?>j+yUjnt#!u!VC>yF<8ZuBsb#iW%+(Mm(dFu429m*Dd8gR z?orkf;?+3}5J?;Hb~5@lAZ92DuD7UC+p8c&MJ28YVt*oeKR~|N(3%tA)`W{R7zHE$ zBrkpSV6VtESy{I(M)#jPS#>i$>t(!1bXt?fxxDG)Aa*79+LkL1FnD^=Js~`3tb4N1 zy4Y&>!5`}A^~oJI=yPiT{a)~bUPtmxa2%r)09x_;Ghi?a!K$Q5*?NR>%KYc|uGYU$ zyntaU-kH5}ZOVeWdw~g%$U88zz$w6cIwNR5XT3XeWs1-ooga}WnE~8J_LaWG`;_>Wuz{Aaw9DZJpe2XaCw0TccOZ)~ zY-sWc7faTb3PxF{lvUQQRP{6tMb zAxW=5iaD3rSV^V-*v83G^~PRC?HO9W@ZuZyR+5$ujfI8Z)|U{rJ`6B)!bQMcHFdrf zm>tNf;LMzl)xegxnItb;)GhIkkk-5FQI=+5uUCYo7rBE^7te{YNz>&KIOzhDT8)c- z<84MT6>>H(t&b~KeH$d|zRVyj1C!9ofo;MH_P0!74-|bPm)v?(JF5 z;Vpq~-|(tZ+c7dymfddV{kW?t>;)$!dlav9a+RLV7X*AYHZ4vDgFPgAtg;~H?7l5_h0udXV{sSX2D3H6tUKXE=G%J` z!;jB`5U8aeUkyFbFnXdxAk7gIxl1r63So>zg2;>G7-l$elVHo~$>g<#)Xf6e$v)A8 zH9>L{J%MLYz100$38@a|VCA-1gySkXTgiS@N zYFOtcW`=7*Nfz2+zO%%R5=Jx=rG-YWDE9ue`Jm5llp<2!FNn*Q39O5R{g_&&-|tYd z-jY-xm9HG`v`G&S({AUvtfl*ZSXm;ht=zreUuFqcw&P_nYYCsT(mAG2PR5@1NKyL znOuzo?B=%c7;}4zYir45%eHYn1-hzx51}k|P~RB^V|zPrMK2`MHg{m*Xz0q}H;J~> zf*Lj@P1UV0jMPZ{Z5U-7+wrv3t9+0)O5`(z6LuQLNKbOpgsjlmiEY$8TS}+df%F<+ zUGg`2(0w}#Um$hBUx(q~v)WxnAIkeE0D)7uf01x)0?$*=`vIL$69nGXGwp3AadJZs zXBT+ZKZrCtmOHK2A`BBMfI*@62a-Ea95b|JYCXn~ z*k`!ChMi+nBVxJ|r1_~56I-mhPsTfl^K`s3%-`UJ3f-ttw7i+JsVjW>Yf8@t@O%{| zd9L3kknsEph`14Jly%_}x#BT$%=!9tFQ4ie@Rn7D ztRvzcpp8)qH5e%pM~HroAzXDB^56n;m{Vd?+Es>U+pD~pa7z$aWC(2RV5C7A@^n@h zy>=lK&pztsM1RNK}5Giq51#oP~98u-BY}>nd z7jAx}Wr%PbYhc~!V3eH`7NTBl1|bRu9EL3Or--w!sh(q-b(4_Gh>j5=JGO$r)Y=Qm3*iB_?12l{%qeQ6S4hE?_I~BZM2@_XdCLjN za&g0To*A)~Bha5K8WT9}3aS^^h6LPfXj?3YQF$I>wj~KSXGc=r2|Nd+NuIHg%~dfs zrWp}O>=))~drVy~Ld5-@W>)mK9ug#j|09QF4HUY)b(U%{-DDAwCvErdpmw8agB^Gi zq!q2>rl9ukshc6V=I!)-P7t=3GQ7blXaL?OKKl%UemFTd#~T-OF3kos;Ii^c!0A-g zY$QcH1h};O)?r&tzNM)-l@4qp_+DmF-$#GsVSmgYi7axct$0n?G*yB)4?kFb6f2sQk=_2`f zhU)mQzygc_{(Ia_jWS+?1C}00(qkL;xcLf--ELsVXLm(Ks5#%q6dfjelIO2x-UI7p z?(S1V-mEkPcfqPUe~DcrU#4>o7H(V@FMku-^^5xFouVZmue$BS#iN)w-phct6Vs>5 z8A0u0WY(^U0|7~-*uY}gbzk<1e}$pwLCCOM#i~mit3?`r4Q#U$$^~Z;nySP#z|amo zzi?VVw2MoUA?;yp=Q*gG0Dh{B_*r`0?5dgg;QAMOLvPMLed$$KdIJU0h!pyM9fnyxnk7@72}Ea*Nd ziP?vL)y5iNe1NoK6g{b9bD^Ov^sT#R&12RY1%4}V{zFUuW8KwHn} zW*9LX){li6Znyv<1fGy(2O9M)F8_6`emJ5Vr2MT?MVoNBIh^SDTik=;L1mK{0I9C4 z*rzKZ%7UiGN7|2Q)`kC0Ip4a@6LKOYE7(wiy)Gi+g6I#mwFSFwE;KedwL%vL)U7~OIY&v8 zcqZ4)2puL-;Dx>dzIUNr-HJZ(?Y1Q@*NFYNsg&vEPQ~%_fOlLj0*39Y3Mx1>ijwl8GWq zeYd0PP}i#l(`WN&V?EpuA!&4)td2V?`(lgt-62=!?3n7y!lh0b|04QykQ+M_03os) zf=l8-#B8@|2D6WssIODY+Jm94~PDk1LMWEvjhjv8bv z^Tuk&p{m12HF@if#!BUN*Ef#^-Vk6}8XZ(a!7s{0ji!dH^jYM*K8N zy%OB=6@UtqW^<6GsyG%l!_Nh6LW>A68hHXg#lzzbx0Z0l==A|xfP~P4vtd%_oXA3P zx`-PNPmW}bC_9Yn5E_Z_Qze_@sC7V7<6-<*`N*Z}^Dy7#M6s5j}9TGUyv3C-!_uP8We;-`ao;-*HVT`Cz@JcyX|=SXAa%& zR}!3^h*g@>puhF-;KeCwSB;)I#w@e~)viJm&Ew4pegFrF)ToGfH4Ae&=*ji}Go4nB zbs-A-9Mx^F%V&uAGA<^!)zMgoh#9`34A(?l0H~mFgtGU_2iZ{OiZ1rMk&40;9huYm(ZZbmD-kg**!GY#h#C0gTW@ z>D-5Q=)=v%v1{eS!rP4LvDpRtO)6>-g#76VEL|8k-A!{PL#>3T*ZnHy_WrZ1jM3?H zyD?N(J4fZ+pv5nf1ve<^Bkc`{1T`ds;Haw3Y z1Sd{^Zooda>!#0HK>X?o{@YQ8!PY>{4N3o*5vMOF*jZ+_oU3t1owj%`zw;uR3^H$u ziwS^=w~tMOP8<-on`HFuGp1e~?Q<`j7oY)-*-=3u8;k(CG>!!itewmOBCA)v$7fd5 zV`oc$G|z)X@2{%Fy(8C?q7P?{RkZ4V&gBFpDmW|ENc0(|Vo&=a$FdBLXVQ>?g2}A? zvcUb%VRw%iOK&0?3YAuCkcFWd@MW57xIf?fJPN4XX{^AG9UDXA*N6e@lUz>IIFHA% z2sK5xD^>Q~e44PVZ&a<6$ zcx)yHKKlLGB><4(ML?;sc_q`_RQZ-gha1{7Ju1g;M#9WM{=g=jSt z|@Xdh^*9RfozlYI9S7Dpa-p$ex~k*mEWxr_p{o>4uw5elh3| zKo+A1>40Z_68OamfZvVuPZSYsDg4st#FDf@Rdk1bw}hCat7<-5eokj1*Bp{jgL*mt zgO>CFc9G}L(F8enD$<3797`1N;pbL>{Tk99@mL52tw!V`>_9!lQtL5u1m*aiv=o&F z=Q_%}r)w&YtQiX-`ypPcnr~9DBqL$YUNDh4C z#oEjNy0*alRQMEI6S%Dm{ZLsa2V#_v&(cb4&s!ZFy5)AC^`g&Jo>hqC$Ia>Xxv^fT zabyE;IST9r`Qyupx{3=6Q9h@}E;$U$I!Jp8NrLHNs|@lN%4*-l1~^2Jlu=JQ|>bD>Zv?iM(8M-pJoxd{je6 zeKIS7f25V?TBeQ@=*&DKVs2q1SDd;(??1&Ybt8_pjpA9b5f9RkGF_*iF;`0VT-6X z)%A@|kx2OKd*>l8899{jq0Cx?V(e;5R7dX%l(K&^Zb>IZUSI{`X0E^s2vm{gntNMA zQ#hF0q4Y`hTqF|$jOi{Wtx#9>XmV!Z`mfTn0f3HGO-XzX%s2qE4JqQw7{=a$Lm;AO z@Zc*B!&avFx%tybM)RN4c0`#M;#zy_pM*fHdG-?V+_x}_!$`D*A zC4_mclklxaZxCW#wZoE7PMFri3;rx{e7WbR3$MQbKJL{*qoHVdBKkKF)N`gOa>^|O z`HN3AL5bwDtZ_$ga!sJEJl)0#z-;Na2+IUaup>aF@=seRo(b7LH$$=BVn~{+aD@}E z9iR#x880Cm&0erKa2Wy(>v&9~-28~$7FIXUQ~lL+;D?1tITqoDKRC?@i&DDPzK(llfkwNu}4r5Q*q&$M+Lp;J#4?wMGTtV%0`gBx^#mj z6_KoTKt@+94)2UqrI^j+s%8o|{*z;tIRpyu}9efd74@|ISvc0EZf{APa z{CX0GEvnK%aL^~G@gBduPNfjQ6dJp%i=cf(u=nc;hTZEiMRamw^7NG=`u4IOT79Pj zeIa!%0>V4cu_9a>r~M-;M~FH%K~U6B1{F!sLUyheiN^@#fDo^sIbS?T?S>e)O0Raq zo%P;?i{J$zl{7yq=vIe_3vMF3t}O0H3Dwsqt832k>~5Z}p0=)E51VSaaF5)M`PKuR zGa8>+Pj^NGrlv%^_1_NJ+bzcQ~Bnbq;UmAcFOutU?*ebX_5$rtrfbDR08ZA$pE)Y`C#Sjdwpmwv^e&Ff2HsV~W(=tiBuHADdc$fQY4Vd7H6C->WTF$BlBbWQJp) zaE70}%aY3U`h?oq(145_@8~lK9FrnP-Mw=^S6D}Y5shS#u*;9~7D6jd;YVYvC+0Fl z%zjyKGdN&zntr1;1yKse%qqx4lJbaMM;b}b?N)@82(SHb?ho7~kq_%aD(GuLvrR@& zZSz=HRILs$zD>717cU-_D1le0is!*I#!cb#h04sSW#?OpBgG&90Qx)7f4_6)WVpis z5neuYhlf&kHd2|o;4w=0dEv%+9>k*e2w#++YF6>3!<(zCUhWHikX?F$Lz;rJRHHQ&=b4>Ap#c=1))ZO`WWp zAZDkpADEGu?Td2RgSdX0yQ-;#XFdeSuWN%41F2^0Ytdl@ebl2kNTyn}alVo%6-OQy z$=fRULq^pWMo&QiNORWKpPE*mnOjzks@vS<-_;8!87HUcmRZqEKVSwLX8@u!1e|2} zMfroupS_c8EonpulC}gH59)P&s)Pm1Cac`}|3fcOg|}K|O`|+&?tw-y*c+S`WO6+t zyGNw6sl5fN&APpCa_vA>IpkRd?{%xY)8RnLZO(8*&--g)+Qkx#;E@Gm=APWG6;?=6 z@6joxoZsZhnL^xk_0BQ9hmNnSt0gBpR(vqqO@t8mRyR340f7_D(g1+Y zPt<$(Qd%gHsjH~D;*63Q0OoCU-ju3e3 z)g0pMiRH>vdiM->i?1<-6oVueusGA^ByNN%^e`LNKRd|GUsE-z({B2wD$uYB?vC;8 zS(*Y1b}Si67^S+d5*ZQ9iW?cYF z=i91mNi)DtI;ruWr^~LEb(B(zyJ(AFh7B~~dAj3|s^k>g)V+G?px5t_SJ>sgu zJ-BgEOqF1wTbqv>X_S8w`d;Td`*u4v6*1o0&LiC&=J~$cRot%a~G$h?P%b+R@qobc>P>O z(7VbWJ%pfC4V9}0bQi`&85h?uylQY@;oPDm=qJxnZ;~3&yPlz*BX6qC zc5;NicJu~*jX+|@qrKTjE3WhnHM~I}kVK24^~|et6MndOuJjIr?R*&uxXGMho`W`fYN7y`x- z@!*ir(Q?Mqwlm`P(IOmOo*9@=>tL*&0uE5?#|UF?&k@AV7t);-p|LaP@HBVx^CFY| zaIx4CMW9=ym=Ac@DM6H64{Uf=_jv}3t43uxf@mGV&imv zSN19N#2Xukj`b8$tDS^L!Pw}g8?>+`aA&P_T#q=GlilsPFQw35PzUsty#cN}= zF?}=x5+sj39>)NH+e7CM)JjW1DJ~gyG^T`R?b8Ja+#blUuMv z;H}V4s5dHQ1YJ)x+DBzpC02Qev`5^Dk-3}cAi3L-h6q`u;Is_W=hWYlS#&0R8Lmja zQJ*}vtQ-B&Bf=8x4!eP{U`%yiki~aVQK7;$Ab^=r^SWP93r^dtmqySKxvYnKPoL&& z?d%|oy|iEH&67L2WRIi(!zLwg5uj_$q|p1Lh8Q&CWGSfyLcGuRq2h}u)WHlYn>TW1 zyRHx0$eCwakJB?0^2ipRvjUQ}$H;wdB9JT-qANVCre}^xwZi4J7HBe8mOn5SI=_lv zsjD=&VLeY(=a`tI^p)_`ECGrVB84s9p3gXqze!!caXPZvn2XNlYf|N5NQ;SuANJdm zpa8P;uGJ8ZUkt&a+ipX-#QY@=_nn2xr#d6Yw1huO*Sk8U05mj>>IrFb&SPRq_;;6{ zP4TkSV%|bsmQL3Pb1bI7w{Jo`+@x>2c>e$U1Dj_n$kkTsO`9_3+&sjF5#tm9C{t%= zKDVI+P>fn{qq{ex3%(I+fp_>6bF>hX3xL)%M-@uG6uF2aguT^2*(oRb42nfIFW^Fk zlise&PzXLx+0@^$F0cUTYu)MFWlOOhz#-LV%IL0u9UfoSC;q|hLnWT=F)~r#sIYcH z17LPa)QD_T zDKv0R1;U8O+OJtEZ^YDz)s{YpSUlqO#P=2`9K8}pascPdjZgdYq)y#;zT0EkxYx$`-;G;{pi;`Lb@SfCN~RF3Sc}X_}sE% z9!B}}m8^pGkTM5+mb~r)G(%m=Td9Sg7)Y(Lvd^uH^MYLiNHQ>CdYE@_1tzVWMK1}9 zqX4g|rlM2!Uyyo@KT})Fl2U@b$f}(;vR)2#W*PaVIBZrR?Pix z5=J>KIuMunB51TL19+%}dU(gB5xA^gg7ChDb=1sWi$TI3YgW!S256z(&aPcBm*x)l z5?7#}2O`4r<7U$NvM2|l+hAlRG6n{_V^mPX$!Qen+>88QYouh*11E^cj}0Lh%b?Zq zig*P1IhTdR!-G-h^HoY2-~XdDs8odxk;RoZ(X;@IXlp6R3otxc7m;%6(X73>1Rdt7 znY}ig8FxW&v@sC=R;eKej=@#h@zHTzED5A{Y3a zMjY&eCVxF6^g+i0gKrBDx+N%!vFC7ww)$=CXfRcrtYUlB92TBUQk2A6b>;ejhEoWA zP0mdD=Oxr@dKw<4OhCjxaRW!_<{b0HEdOg-O_S;I>l|H*r4jPBQ7~Kd%B^>~@kNE4 zJ_CRe#4LmfbWUwrD@eCyjCqtukJGlR;u=b+Ix0p6IKUg-TV0O32CjW4C9sychj(1~ zk)@}#gq50tMC{R^j@|9KWu)s+w|z#FNV-SRrN46Zy3*DM>+@b(QYtK)AG| z3c7MaKE>mzR!MGhHTH4tUJJ}1>a$>KaFeY2v1Cs}G89B&?9B6v-Ps>qPa!Pjvp9QwFE~Mjz$NbO<=pQj` z!dx$;Gw#^idC=DIa3Ab1a2i{~pLm}=YNuyW_ci>Cymrv$$3cbG)1k7@C5{IMp2JW7Bd5EP!yj2?!?J>Q{b28cc;+xCf+EXo_$oAM-$d%8hg2i)x2t6A_ z+|0kKlR~`jYa8Pc#3rGms2oQ1XBmuL1lSjf9D$IUDKd`n8V6%TjpZZD z`bp>IS~fglSWYMti57t)M0q25LoOBw9sYetpOs0d@h?p}#2hL)n~)6JM~a(j%+^eI zKf!|)5lS}?({Ej$q-%&bbboum9bwxnFOR0#rLG#xBKSxuUEOH>=T;TvF#q3P3J1T!8_f>egxUhq# z?tC9Hvh4m~{tg*^3ShMVDC(DQ)MDEVIdPEhl^vmW2W=yv1WOY?F$a8fT9v~s{5epw zm!x)1bhg@oH=vg#BNB=VR=iDL{wQkQyv|4#GTLRME+N-h&xoGI(yRr7iwMQyH=wjo z)P#VgyR1B*6ltv6ep$4f0N?vJ(U4c@p+N=KmR3a~2d*8(b4Fn5YtJ9zumg%mSL6@g zSEfP!fnl%PWQbcAZ?p~g5Zxk>jEt(#$w)<$ukwS%^bfAw^FQJ(I5x9dy;I=RQuEp! zd>7Lg(eGW=Ux;n>&%&n(7W9j@k$<-VP9R8(%`vC>j0YF*o)U=wHhc3Z>R2I-cMD)v z<7p+({#zI8trmyklkY;2-Pqtw%Gl!5fShL;(M8EJ5*}BOG~-9HhBl$w*&?J{$-KaInq^Zl9E_LNIlao>RZrfQiN`c z>d*JdPWBcWPjnpNiF_)(87C3kq<)$L?=IBTSFx1f;^!eYTbD8#jeG1yyw{*j>QPN= zE!HpG6;6NDB(K^37_6pcc&0=XogEfyPp}f+YZ9kQv+`EXmcX9%f$~GjE2>KsE}Bf- z%N8S%IdfQL`%;SRZcWJUCsMZ2_#8@IDQ+8CajK+_mW_MQx>d`eCs5OqhEL`{G2Z17 z0)bRGWGw7YeErs?Y*Hkk^XL4yTixZNUq|C)IhS=jJAX##^7TgLSjMPc>*dS}lW$R0 z`Sw7Y>k*MBmkaD!`O&>rnz*^Q{3;=)>ES6f)t)>EG9f=~Zu4vi<Q*rT=TW~b=Kw?00#}xb7nR8!d97WaL_NUqSvI6v+pOzDWZh2CiS(5F| zA{3Es(`Z_!jCSimg{+sHGt{rD5a!yZ6a32yI}yBX1ioXS;(QB7IoPYsL}oA^-E!na z&N;9!crAugwIN#A41pV<^eKOS4W75)(PqemE1X9WU>c-F69}@)PYrMu^)pErEF`xx zT6auAVzEw5mT5pO*gzjoE>vW}iR-n)+Ymd2@F*C!SORjT!1V2(KuC(~@EAW;qS71+ zEb7FSoBR_VSmy#~Dn@OXbgdZE8{evv(uaIPQG=eh(;vQruyE-hxQO_$!|S9yd)pu^bKztyy}VUi7IW(EY2cnq z63AP_uP;8Cjw?*@(n6uHUlTSY&mgUfm)fN1dA>Ya>AWGa8>d1z0&-`a)4eZm-v&fu z&tdvtYtFQo#&73_y@o$I$@~h5mCKJJTHX3}9|1{gYR^hYjM8@z=@RK5Z`Zo8ITe@U z7V|K-O#}n|;@5(>%^U4=SL>(M7t~&^r>ldn1Lat zbf%=MmLbPc^sFleyOBV~DGLx_escxnwP(qkuFd&O_bSYQh`7+8jZjZq7`VaeKv_>Ivyz7??@l(3_{+~zNU63 zX>>bNEnL?Lt0^o%*qhJ2B4nHU<@mI&5m|5httKp|tTqP2x%lmMtJS;km-oL75NHQ* zlR*HCcbS^}gsH8AO7ziQFhJwc-?wy z3HdkhfenvFOE0wNz>JTY{xAZZF6c&!IF$l33x0iUr_$*Hj~0xb3qK^ZRB2;xf>O=q z{*Lre2Z;lQ1>Gwt5`-q?J`{v0oa)tQ0ROwin?y4qJz|Gxue+O}fTVncGj%MpGhwqg zyVuM+%qI#W#wl@-{RamRJ~2HLa^@hAM~rEESLGxRofUj?;mY*$bZ zL{-chKlQJLz{VM9h&`_jY$B-uvdN~QiW6&d7kGH24^kXb zPP@Ig?PL~X0g5LG#~u){f`=L6v)uh+eA(j`?8jRE+K&Qh0%s2h6Gi|2YbFAnv-)Sp zyLS522ZK88_fK!(^NFB`*wlzJ6N2!VCT;q=7CXL?sCig=G7ya`0wS(hn*kn%!D(2c zU-M-n{9pc>tVZmy1>85h`0u$`G?l|628Z=laNhC?m7Xk>?=aW~@2Q;-Vwc||eY5{8 zV8B*cx8S8aqvQoota9bOtW(bUAi#r%%l-l?s?Rx!ZpQTvD|U53aXtCZA{M17aSVC1$h>Mr4qKv+uD9o#Gkj8DN!uge5x}{ zod+GHBLF3-W&eI%Dm)+O-`E>n<)p)kNF!kser>rUXlVm1JlIoi2rJ!sffO#gWA9;z zlp4OuP=U4WlJ3^Je|c&wOCX2jJuz1 z%65m*L)`^JcLq{mE;$oS#Nhd#~NyB+Z!t( z>%`s^{)@cSnWlNIxorB_(!do$_$~lD!_cSe+fQsL+b1o-#F#YPQwKjvFc}L|pq`$0 zkjKalBSze(?7oSR^`MV$mHrBA#GV!CXBiuD=UM^JUii2%uzvv1uwCMcrI94@xM?dk zBB=<%vQw#rznEQn1J{Qk&>`qElO`z(^rXX5ME$w4;tF+H!99xoA;smtK}_%{?+3;+!|_6M(K`FBfouA#`I) zLEXGYc^9SX6voF8a*YiA+FMc(p)%nR|JqrU7drhLXI4rwtE1w;k9LtiE=sRm$suapBH|ra!lkdVvXm6TCt$m&Sj<6;%z` zHx}?zdTI=e5+F&vO}MrQAYz^J=+Y2~&x7pTSEDYnMEgYP!{`10VL)IVSJDn7-l#RH z-!cS$>=6Dl8pQcl``z+Nl5>)Gra{9)h^x(fnNiOo*9xPW4I8wGL?0H5T#4u_ z4(W8Rz&kZX$DNhn0{O1is(G>pe1&w5tQx?iP%zadr9yy8^{`flx%x>sw5 z3U{AI#!Xhq)Ss+l-Urg$10oo0vDF0>D42q`CxWoer~(XXmaxI0&H`(9s^6&^$*Mwy z6EZDHL#Hrs7EFzUpRj0OwKWPqk5den>odoCQaF$q`S85d1ElL_!fc4p)>o=F4L&9Wo8xtWgwch>IeR&-hP{{9CE^;fV3 z6A#H0{?BSLohumnmo?c@s;HEF3=D~vETI8;BHNx{5y=ICOqB4NPFV6(fn( z>awq!B`G$k*v%EP>`6=Rd>e56mB^D8=GwIxDJgsB6D+v<$)l}}(b}7c=dO?s7cK`D z)GgGa-i8A8gJ!r&Ly-8OHe%4zY1j)tm()X&i(9X4K1iZ@-*3?{67c5<23Z~IWH%JQ zJEIo7T7?RD_mVhYz*C-}hLjXCyvsDF9#cfLuS~ozB#Y}tMR9YRi|DOYSCb)bK{Y6< zpuKi&Qpn8~{gC5Er?Rotw=|e9JRN28*qtMY7`HFYIH<6z*TZJ9z#(#hYax6Q%C)ev z(@3RWaJFa9f!YNS36Xr)AzPt6p+wKI2Q&Q2^@P4c*SGWMm+_->0WqG1YDmLCT%@aK zLm2rx39P{Di7r}2>ye4GqqcjWn3`NdXL?LCyQel382!e`uCK#cfRx|>#Bn>$zMZ&^_Cc62D zb$yv8Q?OU=Na8(yngtSFuF*lJQjNr*SzoQ#s==mW_dOYij3TzE(aBm+qm9d>WX_YV z7rh(W3LqsLfFxbj?-+`z)o7loEt(BQr>{Q@ulT+Ui;$B_;#<4-AZQUF;PepZ2X8x{ zP~VRVr?qi;B_ySr0)OrL^Wz~H<_>K-v1H~tGTMbY*3F4iYdBeNU61U~rE~PQNa*ZF z5~p|o)bY*fNFGg%( zbY(COSX^7SEfPFHaEHPzxVyW%JB35x65QS03GVK$ zL4pQ?1$PbZ_Q*N6Z=de_`+fCQ?Hbe9SaYtuH#xDQ3Z0NC$QURNvU8?mqG#j=$jT{$ zY>n)g80n;(jchDU0L=7^jI8kF0^YynU(aejAo1TZr)a>0`W zB!G56$9JVEz}N#I2Xr=4^{@vr0jP}r0*W9fXF6jer*}2b&fL-tNd4|20z=;+PkZn zBgpoz1OO@vXJ>nE1_n1bH+pjyCue$)qdC33&0qDYT39*(+(3@jfcL8-&<6MyF)ntd z?{qp_0RIl~XHx*OmL@N+Wc(}Z~_AVBaMZT z(_g-_ii)xTTO&(5XP}*toyohQvyrol6Tt8<+4~o0O8IwzK!AvgqvM|(a{p2}{%@Lp zl`af=Uzx6rr?-)e-9wjVL7S-Iv{lJU+qSJr+pM&0+qP}nwr$%s-|YI%I=xm8deFo8 z1v~Z=amBsqdz%)Y9l4n5YxkHt$p*a6slmm`{f+wzilMOy7*M`*KAWSl@lBeDl8}mw zp`=ip=xxix&BZy#&F%6ub2HgYDO8%$nsOS8RZNA zLxgtM-2sBrgW)T;r=*)@MHK*7x2?Mg>wd{ z4+ew_B;bky8^V7MxJcnQDB(YF#p>d{7JLC>CdMYuYc0mS`v$o^H#&j=gN3^ zf0F~79Rg-(X0i9NeR}=t|3lr8l#L11_uTr{o#0yzCnwR~JW*`f37F!y)eE>Xjb|#I=Yse-<>j z!nHa;WzcA|WoQ5iQs7>thrKYqyMg@1pub6sicwk7%zxx=zl_ODOhK5Mo0uUP8tXx$ zaB!n}_Aqy`1Ja}6_r{-gHcJFvd$}O`1Z*K4d|ZLoIypQ+rvzf|d|i?wLHqQd#Glv? zKp4`#=nV{vKp232fYX8DOn&@mfFK@y1yq3ohxrMx{rVs9<52qa9}(aF4P|%Z&Ut^G z;otGbfAjBo8jbo2xBvw{>fP}}D}6cIeX*iM{g~YO$}aWRMKltRVU_(g|L|dd4-LXX!l&GZ?FeBOKaarH{Cb-X#`@s{kda( z|FrwGOxtPw(0iL52LS@v_9wfOdL%%}A*ftBiDSaA4>)(AaG?80l$7?7Ie$Zx!d%RD zTPtwaA`$Qx`cdtbju48gB5BQ$Yv|RfCv!&%nZDH2Qe0kYE>GBNiI2@f#7jtV^S!+k+ysuLLUxNO+88(D0V)&} zFEiDa3mC$oh_>TWW!CH5rlt%yyF5`5!qh*mbDx%2gIlh$w z|gu-A}_B;qL(Kel+iCP_Uk+mbsK- zrPrg<%$9;~=;|{IX>Kui?$%kxUrITLl|zc;G#GLMRv2lXXH?n~w@(2qdc`KD-h?0D zeLyDz++G9ar{%~N1z+RVlsj-=9ks4}ZlAU^^gY$pX95(rJ{NcE6P8;asa>lt56u7` z^0Oc=m}5YUb|nJYnG8?Jt2HJv1YuT=Yr?9ns>h6r>WRvnY6q9;g9^zkt^|ac$5uh4IdxFgy`03eE>~~$1{!>LOP0MEHhttXLz`#-l%$SgE$Qt-jqj; z{^TZENzwIhQ*FyJvT1iqT_Y6(6hjdksFz*2Xu``Q${u& zRrthT=wx2(^IXvd<|=H$6-|%~T=5@H#vtGZ2qcwd&R(mbBl>f$Mew7jD&43Q{w5PR zLZn2-wL3)NyGgu##w*&N;rXK?RV5Njk~B;pMoY#tjikv!{H_6VH8Z(k)SW}GP2n)7 z`I{qT=x3rwD8S87g;WZX$GYHq(r$67`J!RXONi!@EvHHwUDgHm-VVl>E30AJry;y3OJ>J^1PRBLvO(Z2|UfQeJq$W$hDlNUW z3jH&gfO`?}%r)|}k-rIKcTfkEGNr`nod-zdW%Pl3GtWy7#7GR&Fw3m7&SW!NY%GId z{7`Ge38YP@&ag;o4D}iauA(mmQK};u1I3(p8;)J z-BWE&f9-mkd#l~$4rX_)j-W&};S^U?z02`7 zWEGIb-49n$P3$~%Qhh;O(zlT;usko7;=b~n-NDs{qVMk|`$@y+U3%iHM94JK<6H>iqeV??SLbavI4fzizd4a@@pko$a%>L$_*8 zA}7Xac@`goyjYzwy9jLampV!_T=*1l7vw-_tlxX zQwB|`%e_NSLsFfDui*8N$<7ILVkV-)X+n+U&;W~~`%IUX0D1ud3MO6dO6)n3x&*4; zNP=8iwF8SN+_eJw=uboPGCzu0`Y}XN{Cg96VI(}!VAE&@gPfLVo)Jz_`|Ws94O<42 zMZZ9xyptCtc;eM5t^Vi@|g#>j;0N zM567Js?dh7@rY*|8gzqSljHcX?PYah1)P!S`Em5}biIqrB)1V=dGllk$;R7nmaAq# z^>c+%CYrUDL&h)mNl>bOJBfJwwM}L*=LTCF{7Pa!f+ZgD0ecoy9kS0I@$ODMFoRXQ z8~toy$aZp5#_{2aQzBrqpVfLdoX6WlYR=(Y5Aj8-*mT!6tfi`NQ)V^1hT8X}jXqSU zt6&~h`gd}5WRN@B&m^YHF_C^~%FDu%1=tufWVCu|^>Rx{X5!=Vz;d|3d{Bis&0z8O zSs)6;BOW4>+&g*_vdM6TxfKBElpVal#pbbIKdQaJcq+viquU%uj|v;3b{@0++Yq#U z5$^!2WAQHOwC}OSnIc#e9gB@O4qGp!fhG7%J1A@yYRz-FWEIG*FL8v5abzF)u3eq{ zvdMwU(i*JpX;uk~Ciq>cc7-M50}Olb%Hc03CJlc@j8{<*R7P)a^lvF_suvh&lf;Ik(Ve( z7s?Vn?opJf)8jswq*tnDUre%+b#wW9su4T$TiKiwMb0gb)Uc>bI8!dnx-W>wr+=cz zHtBoeM{pxa>6dFMl)jqc}FiY6js;Z$SCz`lgm{(F&a`Vzyl$^P8*943l~C;y3`aE=}o#w z-}12|#Gb(j2oRG}#@#KrlR08`lVrx2WL?o1j$9F+7I-Mzt!WcnyoL{yjS}A$?5a7N zV*#2t*G9z}9^fzMn*T6VS*Rz0utHuZ`9Q;Cf`>Ne#bNK#nMzXjw7S zVst?!eN}Ikz|{oeH~Z5c<(DQOHKHej-J^>{f1trN>6!doJ22lOGEQ_E$OLG|07>?e zQqx*Tt%f=^GhizO3%G3Kc6HVe!PUONu&E^4nqBAc+Ou$!xtpLZ9|yw#(DjUL^s*QU zP1)E2aZOUAmwN;{UTzH&rnQ+hc&@VlGR?DvraZ0+gaw~puMy4EJ3;Io{H}$fKR?pYG{g8e zt{=mE;sE8-q)K6nTWQW1vFmM73^==^H)`_@5v=wDPDymM8Pn_}rL)>oAa8vz6;SK& zs)uOI0mBN}!cbAcF`13dEuxs`#!G^o-I|*T>F-SoBCq_`_O8F|Nt?240r`kc6Tu#n zIJ9l7+7=@3zMryNsW5)D3~9kJHZI?3{9P8^s33UE3wxYN&KRG%))9(&bG^g0s~XF( z|BCxbasK{QM(uYxm0!kB-hlSTZn zya8PF2nuBm{hjI@hP#yTJ;Tz|V=}wq*SDCEQ0WV{LPJn(O*|P5^K=zrbfE7Z{SMnX;7r9UR7B)?k6DA|Nw zj5%K6-RW#tGa0rV)t!dhv3icZt-$VGB`Y5?+E{8=lxhR!Sj zenc_49FmsKz^u#F%u5*Jz;hgLt!1QOE%xqyWbNS_Zt6kn;hL8sUpM~n$@2t+HlOK- zOi!AbO($%=tJbOmc|qat;H@dp2Bp_GLJ*|OD-RR6X;C{0lCNLekm<(JKr>>%EW{TL z1zu6j3P@$KZ3UjXV^MHPy}Nn$vC+r=#*Sm)M-3^>XOhhNvLd5cF9^f~Gt#K2XlTz^ zjJEs?MsBaFpbR2vJ$B}6kOHA_1ut;o(4RvB`^ESdz)h(qXi$eHgU3hCVq<+p7t`8q zc1Go!X>Vyv)Y`&UL{ZqK+#Q$7u&Dt|U2I?ds-kgJivziIw2+wh&8CfT;hNUqhY@FA z+II$gWE9mCnsI&#UGBzqcFnuY(JA6%P?hf3{)e!`Ky9l&3p6MG5dmm((myqNIsLRY}+y z{8rtI=2LRHG$~xtxd2#?DK6OkEiDQ~+}s0OfmuC__+Tcn$?v5U1{UN>c13q&Ci?}D z>*>HnIpm3p+M)T31|9zWFO44Ix?P7csP-=5A%| zexU3@V#gMr&yU1CF+IoI_szUyeBtp+IiVU`BQ^$Q75tTYS=r`bN*2z02~T9-rpShT z=Xs4I#y4@e^kU3BeSBrR-+1{6^M<_7Rajf4-Ofk!$X{znU=-&IFBkalrYib2SuB&TLfdpfkXhvz;fF2NtsJL-bMaLVtl;c(;oA;!oRPcByphZeD(2;_&6%2!?Y92wy9Dg}lnXOGH5hO(L0 zI0YaXjsXLJrGwC#7W1fte6uof5`$ATl4y^>rdL7!=Qb#5KB?*RoPR|&%z=;)5`RH0 z$mzJi2BIZ~L8%R)E~J{b47IibvuqQodzisysL#cfe1&Rci|MuI0z^w8c(pX*c77Z_ z#uiPjVy$C{9^u9KZW6?Zk79~Ty&>uY4)%N?gsROSpU5{>y-uUDNB%=h3W;u!@^lNysarKp``(VwtyW~ z2yM^a;T@*zB55NYQ9Uh4kq5p^lC}zZp9-e}hRa)4`U*#k$V{WqV+*6nq9li*uw#0e zTBnfU(-J%$VAomN=;VnuLY$i~UP}rMjkhEWw)Q{QcAY$7M)!`r=v}o#W&i&9eQP|n zoj|2LGqT)=`X+mnBWuEPhBPjiHeD6 zHd#vFkrCLgEQMUZA+5bsfOryn@HUDD=nH%4(C zMqE8M*KDID?F!~qx&@!UU)JegiS+q+kXZedB%&VowTD3>sXJ2b0~Hm{fvf}*+5FR< z1So+IN)Mqjj}QMSJ6os$xt4$RREF8}<#lnKJl@id?Q=BTwO9uflMe^cy7Zz)R4 zyw=G$m=E}9%d0s%o=~t$c^cC=2pEM=`(Sv2I5jc8;;`H&sk}Vv0(mZF!iIypB=n** zN|g(x>x5Q2I^tQS_hGDOGkd~)*!5U9j?hMU22N&F2k;9^1Lqfidbx*J$X(dCs{3bs ziT|7c$+fy3o-v|8zLVyL=w8jTHvAK(yJIwwxW#DcoyfJKXZ;K*zm7S}_v}%$zrVt0grcP1G!=L8pemlx zLcr`nXh})*yABEYfxW<-7)vwwdXjp`)P_${Y)TB4>ruBY1s*d^mU92sQ2f8ZSFw3- zGe(w#LRf{_I|JODp{892KrF`J9VYgd?cR$25si$y8I|8YlU8GG-;~kS-=O&V(L*NY zxb~5|Hk%1F1&shdJvEm*fip9k(?s%el$;K}toaLNxb%(8`DAZ!<`+$)C@E|wr9Xag z)ucNcwD>=1u^^%`)1X{~0c_jT-p zbaDYXh;R6>6J7+s~A6YP;W3=#QFk$qh3HMmj7fLd0Fj^Ti2SF=^Lgp9QQf<|36 zTRff_{-w8A?Q$tEBa5zhx{YahNuiV5iI7w3#7E&z`qteXX$}M@Gjm$wgH!0k0S@dvk2!GZbE&)D*D9tOh4bc{wcvy9NhkZ;$#pOa z+BK765EE9TNSZ74Re~7}e_RSdEn!dbME=GV&9FmpIj~iM?TPG${;`1dflJxb6uF`*$_Rf0NqbkjvF);EFBp>7;?HwkHbIf&g_L(9P zd}HlgXvd06rkzvms$DXkwP`B-LPrmZrD+FV8_maNTdz>rh6rEUY3py7Qc3*G!OtxL zFV}SZZt_8jlmj8lp4H%KpH3oTQb#udIxh{@19E9%h0yGAFH2`b#~KO!pSWa=+BhwY z+TX_umF_=aM-vy?Sle|%VXbiweQ{DK_boRm(VX@+x)*mX)7Y+wp)Llgh75k!6UQIg zZxTXVFbiZ}oIA%x8i<^??qAp)+jMe_3qk?HcQqnT*|J}a;a#Yu70IxmoplPwXB3$J zbA#d;WU*iE#D+|Wn=7{wrAhc9;}Pz8j=j<@M^HDZ@?#8?4XeL4Jl$Z%WX>GUkN{d-QXq(3S_d*a#|gh3MyEPAfX#(d02BDnMTsiar@(n z(*jfJ_UmgeGH`N*rM88Dy|ig9Ey;Ctu$QIfi82x}*T5DPgm^-DQvFpVoROv)p15$S z?P|X}Om@+2rlMtp?uX&mT+W@jEBzRpIwT%{mjMN5MiqAvq6%K088@yZ?wItQto+1a zMe1}ts;x}~?<~m5u-o^=LXHUS{`!89qDH}&R%apQSK9Y0zCCoR(@vR~q;L#KAZN^M zjqZJM?G52F4Eu;|Nzv~FQAYGriX||hSeVC-=`@W%CjA-h3jC`d#nv}c!$|t#&v>+h z))(2Gn`gvLZ`&nBX{!3MD3VD@wr$(x*hL4*7nRbR_<4LcRkRx=*O3>m8(~VAnQA4-one! zgT?*0lefUwG@`y109^k=jc9G0qpBojFN)s@`NIn4*a9ZM;tOsC1Kj8(QLK8c^_Ap_ zItWIcw$W^|EnsJ}T5Q6YKM9Anh>ejG6Yny1xFkaCu0;Y4?4Q}jFVf190#{?J4y zdI&YJ!|E6eiY8U4pe5c<^#v<|5O2GFrXzA70?wIdZv==-inwn2_#jo{iB@ID8LS;(Nw^YZY)!Ah~zUj$72l>yF1xyI&{IVt{S{JIF5)*MYh z1%vJDz7Ot-x4;C$m0|sWedW5n=VL@1nTr(cqq0c|tlaxcfZZ8RHL$(hW~G)}Z~+ZI z_`%#h77Xuqv~xq&>h!}c%mnx@cC`6^Z zIHXJ`Z%pV|*3qxWPP;^Jh+nc#7S$K)pLENx~Agf0y473|uK znwxYvf{c<`^bZ>jG2mjkg*=JR_Ki)-qLUAZ)NFg+mxJOYVfuEY*y5esG~X+bl-u%( zW${+twAL6 zS@!X%xZjyFiyK{&DeCl#viUA3Mz|fs1w*VU$vA~Z4|&^JIAEa|{=(V5gk}(_wJV;3 zfGya$tX`d*zer?Be@^A;^<Ib2*k^seqj=xbtohxz2eE5@aRlMBuW+7 zNGv}DF|AlpbY3HSg+uyb;25Yi)XL^Xl{4hD;53lR2EDT}3<9e_kWp2P!vdNRp6;To zI&w{U2FI7|?R7L;CIW95iuWiPjhGJfLpF>+>}qJ5zShO`8B?#lSw|+~BMsR?1lbD+ zDZa3RXef~mJLWwJ`z;7O<%thr4Rh++Z)K)HqQ&bs+2&k!Fq~)6oeq`yzmzDul}dG? zHAE0Yb48F8}-np%huI8b5)tQ2pm*)@}k6RG#%xT(M9T9pLLHl zFJlELGPo(n^mqF+GkonOyY`xf;q)!2*|%Cc1?CHprSgBaHoro~BK40Mp7?^Xkrdy9 z3OjdvbZ~Mxi0D@4{9Th|46v1AcO?Z_#{;s^2{HHr2Tmt=P5eUg-TFTE2hpvxY_HX> zEZd?rjWKJX;2 z4guh?n*2-K+keK`s+!;?FlfD+{=~;R<&st3@dn;bXxyDdA|dDM=ZlK8{laXLVAfijvqWL&0Fi0HP-v;xEEFPRV2?U1x_e?Xf5Qu0SnJ*7QG1`UaXb-rhN$BrA?3|QZ^mUu(x zyKtVWhK-K>QsIDn0+;f{A};Epw)?dyQo%X^DR1@~@3L6%UA(!)7V2T(DU(oOndZ5z zQXX!enui$~3o1QW+Q=PU7?o2(Cd(krnCN4p2NzLB_=~6Mk*qL#)^0P$(CAC&3S3rM znfVLv7twsB{=|aA;k!>FAAasPlZc6I@J6HPnP5Kce4?+#D7Q^9(_{FfW?F-%H6-Lih0k%m4Z%{i*IvK{wJy zqhnFjf^7PRJ<;$gwsr2YCHqc91#*n{bDBg2$vuy);z?Bp7vKsDBt)Sh>?!yoWFE-e>^s zx|eM7Y<7(fo+`JB}bMf3x^S9E_l0)5V+M~DmB8Fu+sB3{wpoAyh+^e9K3kxOogJ%2bts_XFs3Q&cr`;s#UBd|=L5B2!O5Fqd(|2ydtzbvqFe&%{9Za0KzABwqa+DZ4h= zK?HcU$zI>~SUpSSJtORfJJLy`rhUqva>|gOFt6HkgmT@W`?OlwUcEj>_oUJ#uCBcm z<4srv(mXIZ_H5?qDR2i`55yo}K{hXG#Pw@XPBs0GVk>cZ1KpJk@{l^`yI4*^@1hz&@iqY23)?G-^pmqM=n#oZu(@j z*}@7I0|s52-z@7@t^^H4>(*M6uN1xSL9)i#bPcA@`?o{)PbiM9pgEz(2n*~XCTcvn z)8M5{&KMjw?xAyeB9V-|j8hZQFr;8u?0Q$O`Yq=`8KLx!H2;jiHrLNYnvOtOMiEhJ z>CYN~JNg|)YCGp?8(>;7pqclfv|OMsrXmy;PXhgR1aWN>&@zT^8W_d>#-c^r%uE1n zju5{A@1q4KDfd42Q$@#p@G&RASX$X9>q*9~hwe%I&VK2SqwPpHFwG=WV#`b>pYFen zv~}!csAW_3Fe(_qX0yK(aeuPXsgF$f7HyL5?zG#2R~=bnQQbeUkOIdtiTHct4_}yE zq@}(JsGw)dGBvbvmFyVB^^8j$yDpq>E}mX79%)yQ~TBR_}kafHe#yG4h_ zf91M0^#`1WvsP;kZu}6|-@}q$S;g43qIC_tl?7wHQgG{RQnvk~Y9`&$d}dn5>ohyF zR+Snns;vpje_i7)XkZ(T!I829TaEa8e{&DIvtLcl4bbK`RCbvc&=oWs-M#PsH}fiJ z3~Dif{2?d<5;O3|UVs?a(L)k3#LgB(MvvsXIX`n@RBq*?lHR$?khHa_@6M^xwPJ;Z zkv(jC&N9udXSr40_yY*YnhHH->)0DcZiYY|&Nc956Rf_)&RTpeMw%zTQXX%512J{2 zLUX(zRDYZB%pf1kQ7Oe6$_=m6@BBbiattpKk))?3?@#&|;~OW5p?j!jPL#@)3#Ct2g_us7n&c4e`J zyT3{^-q7T0E!Eo$9W1>uwMGs-C*PzFb2jzgakitjq%=F<<03CB?~JQhPECo~Ii@ar zp-`4{92t1fK&`j8Ip1{Yt+(oUTaT|$`T*wryO{6HKyHYEi*F;&AthBi(VYJ&*(6Qq zMteOmv9D&l#5RE`Pv`6jUz8gQ@%!bWLRs)Gfu!HXs#`ebj8mfES1FG|wNjRVw$ne@ zb(EiXHPYi$Bu~=I@Pr`27=hpWV5LcD>56t?0Oh6}XP`q5B|9~zbI=5Wh}xuSi{l61 zBji2cez*_K8gv$(c7CYBIlJ-+gKl?e8MN#ll)NAhF75RvLg~wP7|(QqZ!A$LI)dw3 zNLNsevg=N0sPn>aU_EqWE=ySD2S0WYeW6jE{dvrCg!Tjf;7d1d4`_ZWwqUX>~M61h~12;w4CC&$NC ztM{?5JA_5GPc7+uQ8E1th1j80 zJ8C-KpC6Od+t2~|dqz^~2I~4g*adeC#aN8Lc#n7LFCwPve&Gz9K@}8^j+x*O0XqYI zVRr(3xiiJrdbNPLB+N`rk;5iGYcXlbQX$m;aNGF>x@lvHu_WSW}0w zde&wGYXl_x%?i>#G`77Rz$zw7y0DihtH zz-l?OPS3&_oc8mxP2=kvE<5m;5l=AyEhDtC< zFbgDK=jaXj&yKke{C_*9Zwes~Y5}~YGOVHuoIn+EAz85mck8c`eSLk60|<>QtH|ge z!4;5J7nH#PTFL|cQ&Cy*{ay|Mh6##0bq)k$ar?pVz61Z$HW^t7U1?4o&ddxb2kwKj z1Loq;1W0`9ZBgu`0|QE4ZY)mpO+VE@fRcj~6L}Gd3o9$B1KS%5Q3A6AIRpRMv9Bc> z8eHHS7leOyObs#*{;qa}BT(8O0f-!SuNUM?1KuyI7#isa>g$l??<;-rwI}sIJZ4|| zgXC!&w3wU5_QM3p0rHPW{ljC2dOZ%3k`DjDV{s@*Mqo_t>`qJ$4lZE70m0qApfZ#{ zqDW9k&MtOuiNb(gs?eXJcXsDrov#y5Ry^I&+CQGdQ35kDct2;;KXjWz2uEh;XGd?f zVFG^X#qf8Co}>JhCeRy=^dosB; znJWTmdO1LghXJE+xB)-d%#d8bX+VASKzW(r;D@G9FT zbDIlrZ-9Sx%yx4-By?{z4>B66BnQx-~L-^K=ns1 zaNdVypknW>tP*!zGAsa=p}rAp(MN3zpf&wJc` z6ObBBc891@@iVx&pfIoiZ&qP+Ze(z;hVlb0#f{lL+s!bx1@YEH;wyOJ+mbN-In|TP zo#Kl?1H{V=dHGL`jm{5YfjK#W+0}m)gY>ZP_rCSG0uZ%;3Y!w@BErC~eG#YhR1XMH zxRs>hIQ@dNLG_RJ^p6l`pZLIOuC9ROPG0TVz&pNK$$-Ql;<6VzVf%L0$FcQIPJw<* zDcd=Lqr`mkdP!7kT*p@c-a0>3?7KJ2Ujtpf;#j4yEm69W*2 z41ll^1j9df=#5l28+J=};v4Fwmhsb$urnLnE3*a^ zh3=bZ;+wj4P3xEEtKMap@`JQ%*$N1K)1BYV;@FX@dvE0Pz1+3@f)qS)4fGu{@u{7- zxxKn=aUs~_U%HLD{-Jy0ee_KI;S&2fe9+DBj(+4vX6hx@1CTw5J3w#&SQUIXyD+|E z@fdp5-dw?2URh$;#A48Y81{e|0NMX`piPOvpm(+fSGOvh?Hk{N`@A8KyO&>hKed$u z^FuTHxyRkFGspM`p6@ljku2`C9B%PKR9~*-K#AFaOVAXCg`!<@}2a(fdE1}gJAL3)2(CPhi{OyMxcEBMW03$ zN_J|(Q9gt`mk=JRIg@tLH~MRGn-ClZ{loWhvWTK7G4WvjRpJE_%`zVH??#tR6Pbz( zfK3H`gY_Z)wf~2Lj^{-sP>`2E$!EN_D>CWh&xvJ^3-qS6iIx}kF9Gi>^`y?iPr?l2 z1NdjEVCC8_Yg)vOX0w=f@WFnFX=`ZkS`=UN3Y4w$YhYrwi8492bdwbZelSaEh>@OF zY|&6QRy`SRLrUGxnz|}ANI;;&bxyl(m)XVqipuME1kq4betlslpTw#2s(sR%w&=to z=0dgoc(+4ncJ@-4(Sl`?=|nu$G$6sZmQX0%_cneTdCOi@u21?GZEm-$%EL>en|-MJ zlr00zkuA=g1$un-=tjT!@8&)(Mp(XxvSYI8+~y3{-}vyJ_uPRU-=z=p)P0uY5!HiF z`M9iNBw|k8-Z|$Big;zWOhbHirx&Id&frN2OS{a?jcwn2hINtE7OZF)p@||~!ahOD zz?T<-Z$(qh8$abp2J_+EV8}hUk>d2~Lx-+s_&Yod8ZHI;N>GSB;*C0snW^=w*3@Qd zhIv-KjboArO=v{-L7OxE3% z=}tpAi}u7m+ug+%Fq^&EZ}@Ca&+0gMLz>J+cPZXK`Bs`jxD#CtobkYxAA(QU{Y=<+ zqY;SDbB?rAza0P-wNlH9578ovaI4PHXwWK=o&0`+59~g|U9usP@=~z|wd|u9w`-O& z8`8d%D5SrUYbT^nDlF%V%}Mq7=ELfT8I_R!{glUw6#*xZ+ER% z`A?%iy7Y!RdYMcYLdup|+kf>d+5|t%1FBRnor*z8Arx@xr2*=u^j@0L#6JB5N}oJe zflkKFNxJdv1l2igYG^o;T!+@ti8Zl~yZBOnA1v{W)&{AI-s^GF>F=;L9+_G)7l?ay z_Ix~WXbCfDxtAp;oFh5#^XzIMH1L!iGY~-Rp}l_N8Obp*e=rEyp+L3rm#jUVA(DQ~ zYz*-S%J`^CEIT4*`i&&qo2urJOhH5JK?pfR%wE6CrbeGrEZ{_$VaC( za$yN#20>pcMC@cic#O-VQoBQfT5-KT$;MfuCgXgKxsl?Iw?a5fr6v^-WVb^eD-@@B zb#Z73T*k#j_0YO{;@39KoL)uEqhuntD6qqcEi$aeVpXyO*mzkE6P z%Z+59O)1=_G1aYZr6snPz}|L(Q>)!y#el|HMF_d+$+o)-<&c&W9X4+^XOiZs zCK+Pr>6isBdj0Bc8$J*AX@aNbTB9P{IF3adH4rx};HhjP`8p?mo`M)yxG>Iq!1h|N z>d196tfWS+G?aFdj3e4LavzmfQ{qBL zb8vo0tETLhgH>xPLy7K-X=8x#4Nra%-NhF%iFBi5S-xrY18E?1wxaIJC#9O&S>afGBq~z|Oee|$>9P>BP>00eKbV^9-+Sj99mg&T(aUg9c&H~xa&20V6 zcbX6Bsp~o>`Ks(9Lm3H2?!S*iDC7K#fY;%k-{pNh$7Qg;J}SAGe1wkgHV<-M(4e#` zZgFSpY7*6d0a!q%zaK83VT5p0eEnXVfL9voMAxOzJ9ng%ALimDNM$1KFpGmhT`q>j zNblzuoP!@~;nvlZ2YBvqy;n$4Q3SFCf)tC|I0e4J7GgE0+_&izWonE1rflhT?OW1~ z9d_#^Vrnw-AwIYz9R&pJlSIR#(mg|e|59==qWupX$G6jYrPy=&5B++Zmgkw$qb2r2 zv+e<8m;)wnvRE01DW)XS!@VaCLy z)X9`xJJC!2yx3&P&B!tgZlr^+!Gpk<(*F_gp zL=^=G1iR0)hzeW^M+@kC;~}zDg?N~DTTc&+p(HuKNQnd7Ijv!a=@$*Mbs@(e2JJO8 z`lA|1P2VPbx)9H*S_0n6s1F5rViYe^{$~Zgik9B(=pz&)zC0 ztnPlKTHH}cvzwnIls^jFz%MRTgzU3AmYQS|yk&hB(L7q@A zz1;Tmezs)$brC79%i66`ZC#k}6JGl2^H~b=D{281^Et(C@+ZOXD8AlwaY%`( zU*{+D*?6LQ?rjMZ9n)>0E{+4X46|ULe(_~7BcE%Rlr(%_U>)4^PuP?2JG%7@{ zET2v^C&h8@RVd&9HT;xk>u|hFzV96prhf99&i^^i#YZ_*lx5m$egO#rHx))87BA5kZJMYqxoycFTZWp zU?z6F%fw8`>M%K|zd6ULQ!nqE*_R!S?%L3o_-J1E(Z+RdMY}?Wh^vXy58r?2d4DCH zV@+}h{RPiN7;hFbn{ooiD%fn!jB`ov0vx1&qMbzH`L3Epj(kMUg3_ql>sQ0)w7s+A z6+)>-HD{6()To2O78EIzZ5jMx4HS-)+u+;SW6=Kdx7s)$dSrmRasm7Ckhk zq*9!Go>*zO(q2(Cp1Lu|E)NEqPtVF z27Wpg+-LjG%6k|Lt>0t25*=r)DSr+c7a4aTj`A~p5F~($`+b2;=w=drn3Z?^j82De z7Rp;k#K#rQC4|Gse$t4#CgrMTsUrvG9J4#U-4~Qx3nNE^VWMER>s0>BmJ^j}Y;Q1k z%&8k+XTSNeG33>=Z;$y*&?w|yv;K)uh<6K%(PzHFhG$j)pBXZi+&>E)!Ly(c4j`pg z9-cEH;j)ArQLYL-Z9FAN^YU#na1n)J`y6ir&mu4E%eK=LyS^6QW%4BCLDG^l#5irS zK)Eh)LI5f5L5bIB+5#;;NmL{!j_CT$TH6o0_Ux)g!j9n9o587aqD$^BiWkqX?kDl^ zZWxNQXP_~`NNrSA_uP!*X3!m$UO8%>PMi{=X2xeDKz0VP5@%RjJ2US~GW{}x16=)& z&B0;Rf)bUddqlA8$|&_k@zNpe?N`J#Qf7s(RFj+(%2FmaGrA}PE;}-c^)b;EAjTlh zhM*mO$j6{HE~3Mf_JfK5xVtnQ&qG~JWS$luQ1TvD2w(FN*N3wCXgCX*23L5dth9y2szRaTKsF4>% z#j)ndmH01RtY!eSpxL#~QFYFWk-jF5InP#!HOi#9vI3_5ou6J}u27lWtmyu-bC?%} zlT|%OOR<49kv6$C5z2_#+XC)4Wpw`1wU1hjw^L*pdRPvrOa6XwW{wJ))0<;4A&0!FlbQ(gVv9OQ)tP&)GpQqr(vjkW?bO5 zH&2>h346n8?eFp7+T6-k@Jb;Lm|`v@IfFI z_v8n_y!CC0BcWBZcsPNrsuT*+?Odp#j3<}y-rVp}57?~({so>&RdDB0JkHp<9hJ>j z3v=u3t`h~wT$J@qEt-B^sf989#dL^giW2*Gtn|GH%F(=8W3Ic&K8{_lVs$gcH7VS< z#Sh5G!`u-{jaD(h@urRLQkzlRMrTj`4cta*jb(k%Q=m;Ey(u&-XpB z0c5!|Vd}GtBV4Q8;Tnt-A?ayX7P;lwm zTo0W(Ho2j^H1}~3ciOsTQ$1u1lwOhAy0;&!O6|FB58d4c;vzUnl7;BMB{;DW24vH; zz!oDCcYi!X+e?=Uo%CdhS!LVzpLRqHbQ~Psy;O|~azTx@jB>*e4TnH5>_%|;?nPJ4 z*Koy^iseEL)>}+gF0+PUGlwKNL^v_Ar!i;^u9qnv!yJwEsm|Q!6l>_d+`nOjKGYkJ zBUUXQCB95n7I>8HKy@!Mc#6{aYw<)c=;gBUoo){N+8W) zZ#7hWUs6=I|A-V*-{X=J@#s2*tRZ}V zuBZ>?{#fA9Asd|hbwkXDMV=pq>_J?p9s5ja!BHH!P@3lTznr-TL`GsCM zIQ2@=HWIB)|`{Oh1p4 zsG4AdSpdx;s)fMxAf};i{4Os)+N(#m^;P#PAq>~_uy$DqGo*Bz3a^}Hly17@ShhF4 zREe}zEkP~Mt8F2AUML?73qC7rSp(5<-}js~&(250t>EFwxjwiaUhPL38JtB~9OuxA z4G+F>X)`uSUuEN+68ziUklLq?(9cn#E)4!pRiZI(+WFAhXuOQYGtg2526HAYBeoV< z^xm|o62+hR3KO&Ft`{~+cS`)OmTh4OVeI@#vvw}T9J0(7qxgf{7YKo}-R4vSY=r7p{q?;vWG!~Ajld9P>Eg(!j0n>yhanX$U$f<0|S zSp@&@X*Fy!$6Ux@!aefR8tYtk9SN}L0&DL$leE$~ar9J}+klYduld@aqvxNogr4gi z*u^wu_g^ugEj;@>f1ObRS;&*$@1ikQCq-IbEDq z$G_GPkNPc=H}s6AS>!d=nhhY6Ua^Xb?u}uv!}^r7IP{tb{{&5C&`X+g)k3_jnyaYS z<&1^5u4E)mQO(3Wx3Gh44&Ur3Gg_-o)ku7H#QJHm3w_*c0*B1f^c?!(wki}=^ouCi zZTSI}_47)@0P7EMbf%K~m_zd$y?}^#we^BQPms2)cPp|*UDk-R)pVMdOpt4zq4P*7 z?!lM{=^Yv$1N}usCV=Gisj)Fxrqw-F%`9HSF1R3MjWR0MLDe;hASHLc7HKPI zPpw00XM7pRRffXa|BoxspXI8h~dbFIX6!jW*l z5p*=&zd%@@S5?ET8$)=G^IBkW%NBm0!Y^LZ_UrIuO^mD*mihXl^Hb$-BWx^z54+6n zYnwt;=(t|@H_4akI^||rRE@3^et6v)U@eCq7l=DF$Xb!3$6*pvOeR;MDFXNbRXEKXQCSZ?so%_+EK;fMF39T|?tR2<}42V{w(i zhYSJz9TgozDCn~b>KS*I>Fy5#Oml6GA%B>X|%FTk44 zd?-~zx*HA=ztMHT01etsGXIKTp+ySGgbSYtK$`5)$2r_e(TlA@(9xx1wI5i5Z;02N z-!!{gM2!uQz&-E^?cRS?+EDY5n;o7G>>wMTG+pN9BlGD{v0=1{Ogv}sBR{WYgoc9f zIu6x%EUA>a;vlM%Eoy^R5RQy1F?TjndcaQEzNGAbgjC|%NU zSUQ9IMNwnIj0?O2LU@HC(vMp!U#RAINE$5T{p_}3CM$-Wb&Nb#_m8rdz|)0 z)qi{eoeYM*F-Hv6RS|Wkfu)?Z{=Vd8RBYWHjUc{u_&in^`NVbp2FMml3b(0n%)hEU zRjJ8_F;D8M`Pgzx;OYLta3_-Vc?!`dg32{DAg|AHl*MYs|%d^EtWu(3~! zjcpAE@y>cmQ5A`GisFEN_A$xiz%)4#85`3Z6oKi14*qz>G(vPjNKp|H%x z(v}X1kJm__rEf!;QeH8%qc-P(6LMawW?|BVC^B($hs61Xb;H-eZ-VNfYQi2M8w~Xn z)^%bLDT`ea;hui&Umroc;*?zP0M%=BaMMOuq zpYp)V&W8*9SmU(cLO%;8*NaMsqw7Cntii-7!UVGVoe+8wOJ^Q9hn~&`2MWTLT^|}r z{g~agU8UnLBjnI@B(&h7P_{`gufVT5+o7nz^ixr1~( zcT?glY{r%Hxq9j5siY5Yd@d-P$Cct15g*4E`_0?HO|!ss8Jzz(z{6H(pglcLq?1I# z=%f7jQ~0{zaehrCC2XuHO;x~dkVGl~uxsWZ`LyFjEv(o9~Us$v?w z=ykGyZ{#Su;a|@tUBeBH*j|SdW3j(LgJVRW!0Xp~2}5Ja8h?$gp10JyF7mPlR;;5( zP@z>C(8LVIB;gbJYVt?Hnc|AW^$`UdB8`2yGgrLP{WMl!GVXvW!)-ir1Lm&BiB{sK zEiU}I$NFQhC6%M}AU(HhcKLNR;Kh=!g0qJK4U#)gdX`dEU1a;t`)LlIA14qD_y)v> z{A7~|k2`QMg3^WL&}W>_Hzrj-xJxTxfC~-h;2jwJ(Y&j3DkB53oTBGJNHLi;Ma={4G4>w+g9?kk#(ZYmNPU9gaznl5&p7BeHZJToi7 zVH{~CLZLmvzsKTH)z`)=T}sqH;VAmcbnNZj8YYuDCHxY2ZnLw(8mgq3Q{8VUFYBky zLZ?LRrrPCCyZPZ!m(k^?pHE-QseJDGxo{hnucyIG><;fol07w!2nij8AA_gmwsoh+ zRw(J(evu2qYUr`d5};ojfaQ5ETOZc5?r{=r#invaGKGn^D&IF?0&yOPoBHTW&FE5k z6SSMg;lydS8(iE%_&O-FRgy}+VxoS4v&eW{G-4l&Ux2c;FaT0+aVX#~=ly$gTNT8KYT(BtS+1*%vjmGZ z0O9`>JERNP$=F>(NL4Z!>qAZGi%mn+YCc8HjHSdxiX^;rr@`Jhmvq!c-SR29zA?))Il%kacu+hMe(aU7)tM6=7hN{OMqs|U_B(~xVzt&(zI8p) zbcG$Bqdc2lgdpex-b4eUJ^-a7&>ZE)8pedS?g&pLgiL!z_Ud+oHLG7B=5`Sfn^q(v zM8(caph0jra5=t|#rRWuShI{CwR!t*JY}`VFF;x8rue;C^O}ttiq zX)LEK7cS=b3!g)>>AA9N7d2B$=Uqn!MX1k%`IEZh6hjfxwEC@Oq4k1{9WEaS(KNze zs}&BG7~Hptn$iUePx4&}8s`hc;FwoJ+8-a$sR^i<>DOA`8uW+x6!+p8)R=p0=?Koa z=Y{!DKh_(deO&w1RczeUacW=cH8tlRnYw^a+rV$n_B1u$^j!RAOPjrMS!8?b?~wl} zcM8$oR8yl#1#(+zSGuA=?RsG-68K%uPkWC`Vgoaq3&wM!vtrm=W)UCNaS`!r_lM0s z^N9~Xm@qvVCH~jKM-f&PUp9T-3++rI8LPRizP6TfPOZRxgrI~xO82Utkmp^5`L0w6 z`|)SNE(f58N^1Oz-1^KX@YP9-xzW$z5(2kV<1?~-ltLH5)v&u3aEKZr{Lt6!eRNY9 zd%5Larw-@9Gy$|SP#}H6m>E0NEq(mxTQFU4x`pF+#RLs>grdbMg|#N3=?RUeX8fK6 zUTYwKR*Hw6sC57@9^*2`dewQ;;3$viuIOoAtr!+FLSB#U42_lMY51^_{DUf-R@?O+ zJ~E$-{!&xi`X?O&mKD#ELGdz1k`R}_$VQSFY z#Pf*4_KBgkzP66oq(y9MH{Es58^p08h={eVYp!TRChiYsPY;eu89IFpz>R%d+2&>s zIiHh`3&JH1v!kW$oT$x}Svo$`G-|?U-K{eclef)4m9Fbb;bGw%E)3(s!`_J&3Qu9O zyLS{*rH4e53FV>mMm!u0bM(*IMSY+}ECz=^z2`<`v!g>W)9Xajpw zeFFSvli|=u)3vHOUKz zq#&5`&&1<_oO$0=OJr%VX*@pZu!kJ93Rp5&{m7E9sedhBi*VU>TAeOuU?jvKpr}Pi zOu#1WPB(2ofdm(1k)5mCg%*$vgE@=KJ{*KX-e=l=d}+;oqh^c9Ilvo(&dR8K6lba> zZz6wfBH6N*VOSZmb;n9AQrnm5RwH@oHyER7^pA%bSL~hFhR|<3A~T`JBf~N35Q3z_SWE(|;&wLKB{d7owE zuhEzEBqjZZS zWwx^pFD9@Li$a=W@tlC-QR8dvFf-ea@;J(HeB7Qn-36$!bRAumGfX0S)=-G(`-g*g z22zI4f>+hhZ&)-hMeDpF7VHaKsAjzUaJt3=GRAE9**U)xys!rS zz?sSwLyQUY+EUzaz}bOA)5Eq>G0Z)ub*g!r;DFA1!o!W(h$E`-V?|m7!KdMGNyz%- z7SH`Eigw|rs~?E87%HN7l3+EzgjVUkjSZhUA-P%7E=mZ#Sd?TAgWU8mz1=+J&4dbTZ39gSM4J8B=6U7_@CNP42C zN<3j0ZXfoK%Zq?>DFUQ^!_`kBlYQ!olV|3>K&)IKvn&1(sB>ITcIir&mBLbl{efR0 zh5(=*);SXtW_8Jww@HG>nOxTNl&BziJK(Qg0Ea9djeqeYlJwdqxzCqQr~y%(@xhNO zw}G;hba=0p&Cug5?2b<_dV>WYzteQ_MZ1kS9%4R^En(OM8YxC#K|wbfgKCA{_aoDC zMf~&~uhr4-j4NoOZz)^b*IR@j0o#k2YY`#IqOsMmsGv%>ZrRIy)D~W(GoF#(a&me4 zU88`0t)Rw_!x1g|CL<<{Clr#w`+OKpHD(5dU--s$S$`N7mtJ+RLh-C2Bt5d)x8j*n zEpI99wedf2PcqoF`FP;ollR!&~b~r-@)FeTk?VoK1z)>2}Ev#ljH# z_QAnRJc^1UkDu#4E~-7r@w>F3UNJk-m|(E|{DwduU>LWVCqXU4I|m{K*$WArZvuu{ zZ42gvzk3-|+x!3c7sesfTe44{pKfX}^+X^q(Me5`kNIi|4EWN7Iwe}Ccg;q`XpsD@ z3`6hD;IK2oQdRND>zUjoaS}=cqTKu^hyK>0;OhP-hSsoEW3|aem>_$&#U609Bv=V# z<{KEPw>_opaYp35^M%mVT?LHMZK4m@;tR~vJbrX7&C7CXaWqv)wDC~5#-kOZ4Ao2VL3a59flrLl37bZx;baI5xHfD`?JL>f zvBoF|-3;E;pR=!>4V6K&mC7575Q5?^PV4;&2WOwEg_9ltX*M?3Wr-iW5XixI&lD%| zdBv80-i5b>dTe$g>s~B@kcJy^1C*6Qerq;Wx0%TN9M=Bg$RxHPDX0f!+uk0w^1#$; zZ(JE(w8LBHu@;<+>6e5GsWm>R80N49ZqX<)or3WTS=(9O7#a;Ex7H`nIKcdDL)df(|5}>!%eC6$VMC%nttpa zzy5(yJyZO76{Qj$x;%AXDBd7eXQ&DpM2Gebg$_S`hnabVtXM zZW&#lvI}=ib2t6-B)QFYwIFfzF^Vs7g>~VTJ0nIjFq@VG2UIH{l2{+Z^64Q00x(lghY(IyXO3YDE_Vqr{bK#7jRPg620gyd@hAfH7~HGXuf*U@hT@6PyLf;+5=< zn><9N4^>?(yUxgLgzA&ug}%j>^?VgZWjV1`8*PUzvrE&$`R4OuH-k5iqK zu`=1v_3(%yKerEg3HJ~ItQfFpe<$*|mg>7Foi==+jx8UMI0(k~_2Gaq&}2C=%FF=E zib}T*BFjRxc#X%#s_HXLGU-lP;sM3F!=_wbm}WsI{3Ox$!`o#fjms+kG=fvC3SM@ZfO`23kU(A(} zfZFVF{;TRC0;u^I>eWc)ddSDGQnWD7mrd~q5XriT&4Ti7if z`<^OZ%B+PASJ-GVy6CKotRv7)N}L&>Tz~i`>6DH#oxDG$9=COSt9?8D8i0TFOS#V5 z4vb0>#^ifzfFXSfy^|70GC>!kl#@F6WVxv6q)d@I&93-{t>QOXs-YGf^2@ktr`A0P z2eHY%rK6Uid_IFlLC6#F4ab*~Zx>f}Gr;o47Ms-^4HAv3;s=!Xyu_e+W=pX2wwsx1YjE5_N=U zHJ~R1RTj$RC}rO!tAB4nvuQGOB4*D75=t46cxKnkKt-L9g%GZOTeak}rIgu;5YeQEswKR`~&qXr$3!#r6_8?sR9wtyVe#zeaL_Vo5 zc}@MOf|};GU43KJw9+bH%^kZ-_IV05Bws{OB!WB2Rr1WtSRP&hF(*$xwpd?n5y7x3 z1mS1)a-UrZ1^1H(0h{JaPd2|v#P*F*R6Z^V!oETpWZ1XORX}V848Vd=g>N6Qtvy|a zuW+&Y_&vqP#xzbfW~$RGQledQpYIeq6FE`nb~sdWOD|_gX1d8aoN~OG#mA*|X+&Jk zC!@_hO=XWuQi=9=9#ltT9E3wD=2{H_HrTjW%iz}9!otkJ?j$h$Xm+28I64C+wwGz^ z+#x~;H)Ifr|D4mS`U_MP{a5 zwI8JUUowN%r!3rF3)wES}B!7945ZCtoclyc)K&!?EakyzJ1)@@#62XjzZ$alocinglGoM?m^I+DBA9`}e@&eFO0oTw$W zOqe6Seww1OrFEm`CPiW=IKoh-l(_IXA%vhNon*+O3`(stvH6onl*N$f97Jg*&ae003XfGjW6Vy{0cdc)(V3W+O;`L9WgoPU?B{g6 zq6Mh)YTWbWmRuEL6BAIHL=$fexcqwO3JwaLqI{Qr1eVKrWf>J=NguFbZ5xb9h*WxT z8^8yi!n=Ay2#^|o8KL<37Ahkc$uCOMBXbCPDF3Nx-s6`nc0*0{&9ZWQn_AcCGv_6@ z7UfP34>sx(t!1xQ0n2qw;GqSgNLo9@;UCdr(TrPJo32BG@*ErE6|Pd0e=2w>If(K%ZnMggI# zV~d>NFZ`8)Utd$Zs-tPog(SKT&|CJ9UGHvxHFhVmKrR2=iPofaggRY?o`T`O{Kx;O~(hW#B9sw~RgADoOA(+X*RUmqMVj;Ui-0~Ud zN4d2iD#(1kE}#v&Foalv#PiG0Wd!<(~H}*XjUN#ZSH8_(K z-Ki!6e)%GP&Ttjfx3U$(VcIfJ+%J_@&&7y$=`w@oTan#a4>QH_rQjK-*MRK~+UOcl z{CFy2^>K;{3lIFr6F&RpA}lpB<+2K|$=X4lB^ZLEoofDGt_`Adg&g~s5HGOLQB+cJ zrw1`kF{C=4c#}?Z8tOK#K5_=&TMs{N9*#KcWoztPCVyaNRJ5=^3 z7pj2nP{-JWJThF-8rdB2I!5*CLQ?(qPJyxFZj<<>=h8<*bH~;;>7NXzs+aBFmqS4G zC+!d#3ilQQ+QNI1lkOluIi@$c|og3fHbh}3gSD)J2vD6-mCMb_=UybYr*a8;ytFy9(qHLJixqP{&m1!sC zQ+XjlMQ>uy=zm$5<&-8LFy1ND-oQ%VB@raTgcuco~NLenGQ zfg_<(0{KA)VQA*BIC^l#ZFTfyE-o(<%Jst;)HmMHYUR4GjrXrzzcVV0d#dW32Y!|r z&EjkIebqL0$E1#bov`ekuFYF8o-U2Ap0Uf>x6D;rjvz;SKnTS2)!b4_bui&AvB_b2 zWA6Sw=D-q8MG~J#Pn^CecnVX*c9lKJDvXaSf5y<;`jz7m4=tO_Eg9H6SDm4uoF_CR z1konC%!0?2Gc;;0Z-FwO^WEwA1`Ejo?9p-AZQpYyE7Kc+-3NQmv5I&wD{#Mt7%MkY zfoIcdTdnsbn#Q@5}^Rgl_Z~2(Ki(xu8lZRny!%v1(iRl2}y!>@wl;IEPCmF|h;c zR}rx9IId09@grpz)!4n|;?KiMK7%_G%=2KkZUz- z&FFz+E-^%ovCX*c=bPPdSHWiwwzoOZo_Jr__$vnpI@UfiT^-ntxssOQiof}Rl<1rtzQi%Zdyp1dBv0Qo1AD7S z6?sOAEdU|E9M3lAviB(3j`-|>wdt<;BKa@()H9=xWxv7U7;rG=1)4mWZs)@N@esRM zJx70O&DEc2XV_V#O1gP`dlMboM$NoOLh)L;TjqZDRuO&d_Nth+ITJlSNfC8W8sKLk zr7ehCHTKRTvr~}AQnbp)uyvO9cAqvJYtp;!loU4>#i-PDy9+_NE%c7iVW9_q5z$&S z^0Fd4*UwOp%pzGRS;@9WQ2d?LXBJrxcmtyD#(e*(S*3#oUfj1QPivmu!Vo)B#Z*L7 zu+Q8g>`UT_aA@e#E`%7+AZ%{owou9ixiPPxJNud`0e8j3%o!ZJlJoiL#F7zD^t(dUx!G%#TN!)+aDD1#OI z4*St86SR95R&i!VC--ZProJhA;)R!Ymv>OD$wK^)lGchAF>@(|$OGP6P zdwpehZVVKY_9ID!fRRQJZBFP{NyF%8)3iXb^sqhoejEOsJGp6aVKw2ZM@x}mL1k}} z&xf;q)h*M$X#Rk+R!iWr3fxJZ1ThlhRmGTkOql1q*ylX9{zGLgdXh(oRm6lzdl37h z5(ip%b!sX)@A_fWCF~T%{6j5;puT+3$NbXk{rUF19p)_HeuPZ>3)~(^l|cNhB6CNM zXRpX?N#o>l3|rU=1??eTBDX$wM|0vkD^s5I;IbwSpxGJiRbjQIP;x~s-3)((x5E{v zKfE}5-LVGB#=eFR7a&{h9ZL}hiwTdj*H1;{GdIBg$SsFU#!y^_-xjPjl8v@!!CpZc zV9zzbv-aRk^X>TT_5(Wh50<2g zy1V~DtXlslJ4dA=Ytwag{G4AN;C7JMTW~VxQE#5C?1*m6AmicKhzn?ARK7L#?jT0Z zEN+D4HOG|*Jy z?|9)OxR~cOfc(jgavrY~Q*WerRT?A=6VdOpG^yJPit&iK=WWQY|O zi?TqZubHJ~&2!fACa+C3Ewc5nMJAHkO_Y`>qh?;`@s`In>H}P>3N$%F^4OtA zalp{kX?TDBw0rIdtFxEVtsK3`pz$64HsW+ulbQ zeD=Ky8j`-%EB@F{W>ju6M(iPN*|NVT8i5Z9jwlwKBs>Pjfe)50(O)Lf) zyd`ZKGqlyov*(vI1pjlobnY1Q3xjlb+H#(FHz=UaNA0&Co^GF`#PkVQa&f3QSTjH z!u{4DHTpSyUY@!X#@VA|QWG(3L8>B2An3O-Wlu@O*9D(pHDUP#|HHA6%`aX}bsQ(A z5>NR94^+w8{Mr1EdZ;dyM%PftY~`z^ZGn*$84j6w+gpPiwj)1GS_{rXJm#}?sVlB~ zAw2$}$M{WTt{DJ=$CwLQrpwH7UV`ncY2H-fuUj%6NR>eChf###7avy&HR087Sy@2N z&{b7fT;iv|ZUl-18Q5n=IdD1D;1cA>m|g%KbZ^EPs*c1!h8a&-Y}9e0lM3|frz9|4 z1J6%Ux|}tL^+*uPw7NReVjjMGRJ3{2vJ=OqEe+jk_~ZSb-^{AEJ=9xlA!DCS=f=xs zhUsr6hI|PHd7Z;ZDV%!S)O}69G92|hrucZet8*^$PZ9cR%+;REnc^Bu|JZ*?vKXB^ zJ8hVy_wy(jqq62bBMuH+6>olQnT84HEtI(|QM9N>F^hu}%O$2?aS%WgrX&=%HlGbQ zkf0~B;4&p{iPt)y#2%HAmu2(dm z(i1<_ncS2LBGf77woZk=3E1ABcZQ1%oi=bJs}mqEWE!d}2$e>*Jdg8HjqR|>X}@H9 zUBu`6_xwN(LnauiWHC4bCZ{b4$BXmW0qe?s4lFf@5CO{G!ec{5IZi|hs!^Z)B;2-1 zsJAz+tqgR|r)#6#&qnBGn9v_DLMf{$Vf%W$7*L3Z z?0utLqkgmBErG_wT1b~8zo9U0=_Q3xsYNokLUVpKs~7+kWCyvHDsYoUMqX)pmOURC z#w!SAn>NJNb_;PQ+ubr}46@B=rh!rpKlwAgovcU`Pn1%e)MyfGf?GZvh6Me;Hm<2T z6Nb^%_EXz>YTLGLcdMd-L6$zmUl!nam^{w$B)`YDBJN)x6z{ zYW=#^(jbnYFMc0)v51CV4l&7+)`_;~WSMvE$mhpy-2==C#YT?=fA~+XLypuBmNAKylnnci^N+HnFdI?WjvA>3uCX@ zcW?f4`XQ_skv=%WVFVzUSK?RIBPM(-qxFm7ID0vI4hSxeK>FlPOI}zTRx60{wK${; zgmf0nY1Uttmu{mXskdFq$_*c|sfS1?_4o`+(3_8^Tyla>(BqFTkG4)+n=WX3J}c}> zcHDmLi;-Qqv0?hHPC6VzRKp0Ye|a59R?m6EJjMnS^XMo!(C0-&ZIK`1D30w2>D6wm zN*;ACoIpFLuT(!V3AhQ3CisMXY6~s%=bdF>$?FjAZUb1G?_38R;pHbr92Fp%xBqhu`*@jSEJS(d%qi4qGttlo{K zGmQO;3xd&`2?#C8UjmxG{L#qK_;WipFTcaHoKuj<6YnQN;hDK0G|{nZa~Eh0-0+ox z3l91Gu8Qza_S)*)L=aX2(OLV95i&g0#!v`rOrtLR-oUv36rt-(##3lnA}r9zbCDIRIc z{Yx_r41gh-+V(KSu`vZ|`guO|9?sD29mZ{alP6R2w=voenvG$~;$Kvn0QRj$CQN7b z=_3k60G|}Y3mXalTndD7##UIgHh|j$LdelY4kQ|n9}-8$kpZxj_M_Q28$y>g+ow*v z2xmo?O-MRyW>^()8M3<78B#%xbu?%-$=|xTvbI0#aVhaE_&GW_ck?jRC|gftl4i2? z*?O&m6f>0H$8}W1f~7%XP?aW(gipTh;dk97W4atP<3x3d!l7+ZO9x9k|9QhjmHted z5%)^T5VLQeC_aM!3=5||PAm$a>0Aq=w+OSN?eEcRt_xzE>hfT`ds7s`Wy^$R{kFGX z@`Ljnu|;UBD3yWaR5s$qlWqpV;^$SGL$ybR z1U<94FOd6@q`vf$Ec6q!E7v6FD$B%Y2azUeD=TmJ?TrsuBBgTCyqh2|kMsVBIjNUt z%_#JpHepkXshGo!KTFoW>8OaO!cxZ3s)4CHeXc*t)6zocynu$)_v3OGKiiRIqEE*j zp^n3Wzrw`N%u2<&i?>GEnyh24)BXYLL@A)yIIY&iXBA%w|6tYK5bsCqd034{hltdc zVQo;bZttJRf2_i#L`uExOlxfVpcnIL@#fh+c0@O%o{HE;8r=znt*~dT#pkM-Q=h6J1+S z6UNtQKPr%w%gds*+Yg_fQYDFBk=Z81XAKel`4XJ@GV1S7EUi zi7g*?1bR97yt}w_tFMYo0l`6YeDG-MtI{{4%7nRnU8cO_t8O_gor3NWGkui%eWWPB zb=bDB0dRGpg<7#j(ihHnqQSha6mFuKB&$M8lg}JVgS5t`jBh?`#3pe)D7ws;#ky+| z#k+cGbIiBtDiE=>bD<5O2y-e$8IY_0a=ADPjWr%*_!csLycFm&z?3nt4#@fPg0zdp z!$e(OAIz-8KX$)Pg##LZ3Xn}gsi``27mHTho*ASCpf^<+*iF=EM7buH(pO$_LRtk? z642wCC~7qZ4t&#Jmed4mtssjoB!voR%N*1|fD-!dMUfLeglX@mI z&0=mC0m1ZEar_#t4oJb;^4*x0@VsfxbVYx@h*_`!3!%lyLG;NyC(8=7XP?i@H6Ufn zMz^hW`4>wr@5;rjSy*Cx0qKII;&EIf~Z&z&2kTgs2!L8mS7CP2TtN)^NJ z0z>QcQD!uDK;MLBk$?*Yl)i1}C|U!z7@57s%>QfamFCY%THl#G?RtCkuHB4N?gmun zsS!{w-?@78ys2d#3gCGGzjnMHli#_&eZ)I4%hJ6%+FSCAlDc**8u#;! zC@-zZHk+Z#T&*)&Zk0WqvLOT!OEic0!uMJm0|bu&jZ; zTaf}g+1J|jMA<6c$&37f>~u6jI3hEiePLu{y_OWmNZWD7ttp>lrEsZW-&ePqeEeAI zK)n}aFm`6=!ud4zbtF^qdPa#}?jr-zRmjz-Y5Us*$b${zF`npy3qCm2tb+vWG4Kg= zc0yt{>AFD@XxZ7{dk~`gIBtxLE(+Z>2U#Rk%!8hMw1+7Uj4bY6-7d3lqp1)CaA~yl zeM{-d?wrHD7+}`F7)Qn;Qz}Au<)Pby`H+BR(Mdh)TG_cxR93Zk5&wqj{&c2Uw0tW| z(Cz;O%AmUJ1aAo`)F{#71KDX=eM^^c0=3~Z-xx52@f)Ts4Otom31!MXsJ@t4;nYm? zpgu?sc1+x9(mRJ|oXM${0{pulCmQEy%*xl;NhqDC12hvFbHT5P#^qr$f}7aSp=DKZ zzP0<;!%-)Mm+AdbZ^*ZG2`a4d3>m$*L9=ohQ$^s}z(TCVjAI+xNs0zvg-h7UEoRa< z0ZQwey3SVy;3KT(pcTLgrmG}I$tR}c_K2T{5;>R$kA5K zJB-~!aAsY!2H@CsI<{@wcD~rQI!?#7Z5tiiwr$(a?K}8qcW`HWRh_{(gI#s@uC?B0 zQ3Ea_0hxG2Yq8s7O2XYn`V2^DMqv4_)zwzsgjwsfYfRRzgLv=F4Sk3;e9gjXHIhd1 z`)@l_S^V!B6rIJ_(OiLiV1~Oy(el|r370nItA_FuquByVrWTI8is}lqYxR{hjaL}nBS&G z*I{NJ;-}LX7$+yg_+sGgA*aX4Jv*RYY?3e8MU`|ZhzAN{isL{g5SvzuQ5A3BQHxE` z;``lsid;*zztNdR@gY)?XH$Ovk_r%_dYt+5`DFwra_S0&&JJnyp5A_>m%w@&y7)Pn ziy%c#geMSaB6BMu++x*j7KS$Vs9f5|_`NS1%>Nw19;AEDVZ zo8_2ZQ(LN!8VW~rntru#k{%1lcD%)R*uK_Rx8D-*KFS8^-($_!vlyHki&&5wZWZlR zs~5FSoQ+lKf&)szlwm?Ld~W|N@(w>evZRgfSzy}Oc9P(OX1^`OY^a6e5`A~uEqEX? zKd*sGAt6b7&`XD<@?QkxmALv2?RlIDKiNMs1kxl&c4Sz~QF|Z{Pl9N9ikC=^7{1h4 z1XO;zZ65Syepnfhci~k@yt`@%iAcGapxj~}W6ai@^lX`N7_^L1J{;+Qqk3-cH1dqc zsk{4tQ>Ey%x9C{L0k)sdx@h25xdC0-{pm_LD4GrXe{lh@6CVUL_L6kUF?z2{R-||O zr88%8b^KmDc>X780ne_~1u8M_-ke!tVs@}bRfZp&PC6~n8s$fBLyu>8)hn0ZB&%P* z5oK^jA+$c_jGDT_Ru@Qp%Y3EgS>-`~AGhH6Wqv0>ZQ{P%+Ud$&?>kl92ezMWQ4n&x zq+s6|*X?Lrfj~rkTCvgi-8*+zK}k8g(j5i_dAwf<(aR~31`B_StkKLEskUJgY9biV zV^GKzqj26-vQX;5gT_c0Hd(v`jSxAS1p_iUeva4jIlPCoB9X69Epfr4k!ZXUWnF3U zwf*f9E{8eJI0aaKrI8Nn9RcEb99}~pu?@Z>etM6_4M<3mSMxB$&3_dfL2B~8`6uXm zL4Mg)Z&pYdCC9~y)w<2VPdAG?_Bt?N3gSd5N?aj@>p2%-edT{=sN2X)sEk$4&>)dX zIRQC{-Kh1cB7z)-x8is9s^&Z0fuKXBh9bQMp}ajLha^-v$5&Cl8LQ{CQ0){U2QXRN z9*icW`fP`do*Jo6w+3l;`@%IwVP$+Wo2uRMD@_sRvKSplXft{&p0;%a@cgD{(GMQ; z`J0mUBLbex1_}m#cmB%AdY4G(=@38i(z9x6b>Cl}4_Zx>I3;mTjSq1T&TSc&0}=&~ z$fOPzYiq&po*hGCN&WT$0F>RK>7GfOE52x{=xsadw{{)kE*lkTNT#&Z0B>*V;9geh zC0F;=4`czmoxa#C7PPnU&^ULx&5FvJoW+@Ak4rEopl*N7kVVdMS;0ETEvR&pOKNEk zG|NwSH2BSh-aAd^?feiw!>nxQ#%IR$TWr0+k&d=`=f^HT?uJPc0zmZmSjB>&xbgN2xRApg5NIQrKRxL3W=+>&=mByKD|aOdASVo4gBEZJ3JdJ24yp(mGPBR`J~|t^OC}8Z@M89 zmY7hzj2ccJYlf!dOj0Oydmdunma*3rYT4>a9a#$Mgu575Ru}XzwTdncuXekCR3ck7 zhn5}Cnd?%8b?AzUv`<`P{NdyB1+(mZJI9h(sc- zI9xBN8(}VL4M-EW<(!xdvlML*s`RolkE3~>AahpBlob^P%81!J)*PYj4996gHxajP zZ#^XJh<{7;^os&&!JtTBwB}BFA=$86C-y)X8e-> z80+kcZ(Cm;hKeN$e8=8yE&RY`Q}}RH2#ny=Lw~vY++I)jj{87qcoSAqHjv(7|7k*9 z(J}u$YCTf(`SUzW7huSJXDV6=o2D&vK>zo{g-2jT1N`rBx1`Bm;NzjUh08IKS5f&B zLG2L?XdBGAItL=2)>h$*XLCAl)L*Ji-7sRLl{B!4i=@rsAOMLDZH%)4#`+tgKr*Dj zwrMN)oA(Z<4_&b+-}j24q{Mbv1f?tZCoHN6^w@!zr(U1mN6a59e?7vd=Y~SWa7v#C z)#>=_F6OgR)kD;XvE&UEi0v)si!wKIZ#$!;Ddm~VwD@jhK zRjI}}AduaEgAz1uTll>bkkKkgnKG|d6wOpMFyg-II;5vK%`#QhUy^c!l|ifB}q6QFb;x-+w$Z7xL{j{=UsW&-*jZE66!ILD`eBsSRMy^`w`Ozlh&KwZ{glE%Hg9@i zD~-w7UzS!628tdM=p4x+mO~VMFA4~E{2#9KrzB=6^g!`$pcJ6U>F{gpg1Qe9Zr^f8 z@(Nq|I)Yg)4-5&w(s`o@qxF>G<{o!UK8{1jx02K1eDWt(>jbvUWyVWOY`CG?p8{+A z_;$Bg5eu}=hSI>{N0^lV3Zu85NIgN($dSh`^OGG*w?RFIdUnE2urw_H6yQ@k{v3X3 z-*-*GZVIH>c38T0U2xl4);6+-kV1pS!3B|>^WSm6iI!`0emjzs<}=)sB36Ivqi!X` z=UEFj7#}S^t}xXE3f0xJgqSb2d)3?be1AzUsNf9M=rS`V7#Lh=n}_%+!2=xvn7*N@Fq%X(2<}BH3e~j6e>qp77W|3G#(RW>#QC^t$?0qf-_ zwV2MDHa&K3>HsM2ug}BIHAU9sK+}Www}e4}hXka;l&5LSg8`7TbA0QK%+z70&`W2G zD;rlom|8V4Dmw*rvU<9fzL_U-ytr}(f<;73$j<4bQhEGo{FEwBmVv|c+Kw28X&-|~ zjMuoG5_P>jJZkhJ67KmAA}^%p-D|@px9hei;^u6L;#TMLR7<~aX2KGBl@j@Y*3T8< zO7x{tx^SFv&SKMg(v>+h^92^i&=(26NK*`WF1NCGwzYO8X4=NlZ92_>iUOPpt_H3! zzJUwEr0VQpZ50k9@c~lOzCw3}mph{X?QjaW8+$gtkeb2ndT!(1YU~4DBR(#O;4X(g zIao3)1eaTGlVWqv=<&sIQ&T49roah-A;HqujYD`Ut$HWj1gQ+|?)_XVJNcVWJkK1a zAr|MN9Hoe0sveM!4SrkALpOZ6u}Y)ZunBG=^R!4`PmVr2X9vYi1Sf@7NXh;#46-8P zLJ_Y5s(Y?Si#tk8x|V%=Th_wpgXzTbxf68F=0iDBol$+z^7`GKC76U1_|#V*!)fO-xiqqo#NPzWT@lQ*&$$qTC|Ib2p3It z9#31(+vIdV$<3!&<`E#(J^0f87PKB_6&TMN!wU(*{!xNTGJxi{a$(_By&Lp!wldGL zpS6)Ko-9zdk^+rpaD$Iw0=9lJmc4-vv^EH>np3O0ryOwK#?sf9dEko-tgf6VRntKQ+ptey|#HjXN~c-mX9$y%}V zVk*%CqoRAj>z@LHALvrwM}}cS^8>>Em}R*YLb%7`gQ~biKZO_jPlkv3bmpZ4N{R6T z_~TX*n|YF#6k+%XOJJV8OY?pZq@I)o7x2-*U&VbG=2k49EUGZ z8`EWNo6qa zb{jqIq!M}=(m}krHiks#HX9=(ucD9X=We8c3#BhlCFaxO0;x+ki5Oa=iZVY$P110< zU;@(KN&t%TaQnOolvo@W|H7<@2UL)6BnwhZw2RD* z>01ynR6DQNs$83YT2au$SMSxY+6kC?<`PG+JcaL?AXFv1;J6XV z?ls#XxQARWcpQ#d0e4?p`Z?QLqp+TD@26sTS2Fidp#XpKX=sPzwdWn7%wpB>b>25{ z^;;iE`jql0`x8pxQb@xa^Ll9EpOSH2QR{5}zF`ez>d3Ll{&JE+7ac&YwTC~P*i?ce zDvh!!`o)#dkz^61bGKBuyAg$`LSl|ZpopStICD(bisB?~k1xP_9Z5TD0NKds&ZwiO z)51#F(Q2k$TgOp4{oJKu#GP$R`V`orUY`nJ$n)3>><$s}aNI&s>$;T-&ePJ5vp{I_GE?W3>kO(}(<+{#kdnG1tgil#@i_*;BiS(Fh3%PA0Sd$} zJygy4HCD9H>w{f0Xa{JSY?vGUt{X6lr)AGJ<)_?M1U$>OuUK(A(6UHk!J3N>DvB;I zu#}yLUAj382vUak__GjewORM<5C+E^9(i11y8qJh5e;r41N7R&a1;w(kjZ!M%H&_7 zrial43n6<&BTmpt_N*dZ)#AJgD6+3U#UDaUlu5W4_}Dd^f!3E-6NA@UduorWen+%% znu~24l@@LKpAq1#sUsplw6al$Wey1B-Lpd#SREp0q^2m22YoF~F9MbCy=6;yU2Kq99b2 zV(-DaS#YWWo;ZOH{VMXS{=LfmNUs&al5CbN0nufj(Fkkxap;x$@IY^mqBGwB^hOu& z-PZtIHTWEx1l*f%7e6;Vws#mrDnwJs@8cj1DI9;RvZ(otO9u0F*X+q>b#+2Zt#Lge zByl)#-BN?}1Tucwvn_IG8m)Rv6yn%F_JG-1u+}AQBR87&^mm(P;3-HXM3W5sx#qEt z43T+szXRu-nbI)lI86C<^&VF3oft?UV~`ka5MgePQvsqy*1M#``kpf~-TaZo+2_J* zyV|y2DXOAvF$IAZ*`O5!?kQC=7@0-}f^$FR z;c@ekf_^{eYDTWYiZm<5=NqQ!}iDNXgOa9vXv1L4h1PJbnK_a(yE*Zz&E1RKD$Li0NHmGJZII_ZJ-_?LNIgX8H)jGu^ZLBF3}%i^yRqw4AMQ^z zv=}2rCed(m4GVB>fL@dTMAd6AgG3`{r&47oZ9H^w7}Bw;bP6ZbE=!!uY&l^7-pa(P z?Kw0u>C(WZ6TtDStO_}+v2BcF@0PwBTxH8=)C0X*ehfD$Fo7AKMw&uG0l%B$(D3s` ze%TpGtJe?K_St~wHfAfg9q>AB-cL$}Vo1_s5V8?!42g|JJTJ7!DSWW_5=s*j^D@r~ zW!2ba9LP1BYW6O%9o-B#j%SxhO5pWMJS}d*q-Z%}S)=+|4^)|G*+J=(AYH~S^GfB^ zA>2PD7crKz@}gMY#F%TEIgK8Mpm0t4`{=oTg<^q|pk-LCH$TCy7S?bEkb^`xBTO;Dyd7LQNK>A=1b8(x&9+zXb zPk!@wrdkjF*9&SznAW@--wD4T61+Qyhp1jk$>QV5J zlE4=&TQNMW1Oaq+Q$}BpgC|q@;AOu?c~-74;o4_i}0GL@DMMVcnU+0=a6n ze?IgJse*;?D?NG`Jv2|QC7N~`B{2m;=WDJzH zT?OiBG;L)xKV>i$x2s?6k=$f$HUCzistA~M{Al~!0*hze!oe?3XKf4of3#H2R%^`{ z3hFtoFyG|>)7Cj%T@AsV;_`lojx#m)Q(ZgU?kiSN7rUDT_Ak60Fsjb0q=U;tE2Gn8UgM0=e!<>6xB+yNYbR zx$n5iBid+L&yimBqzP(I*myfEjNP_Qk|>0N;122l;0 z)X1$K6X{$t!QSQ>?sfFYIAN#vQY)qH`A{wVa4Ol1$K@yfx%inRiQXrLm^dksgt=nq zg5DM(@I(iTA~xP<#EpwVF4PNX#ce$gqIQLSJ~5(^cB+JmA^M2mA@N8l%KLA@y1upH z3^01wg?>9PTaI9AinsW_Q>yN%S%cAygBHxJl2VWl> zQ6^#0q_4BeFbW-rbWhTjc_5LwkyUU@%hEeq=k9eylt0;ZG zy3r$e5$~&kBG5M z39Q)Lo17?<5w)g$*h?m?Z15GGuu>{>q<6xi6Tz@d?!ueUA;dx`Xrs3X9*%Lcp|>@n zfE}nSO_UvOCR1XNJ>!6|*?`p#mJMbKM(kD{i7x8$C1Z`)YHu1;iaj46w*A}TzBJ=i zU;_f%dHq|Sk9b5TU zE8aT~D-Rm&*Bh6J-Ch#R?#{~H*b~k!Dl;DAM%Qo_pK{1o@unj0qR4>NHa3BVr}rdY zKa#BhkF0iO>9s%FoA2U2KT5wN&!d%L2L)Q@^x4jc03RXvHkh#|YI%#RtcXxCRz-n0 zG9p$@F9u^6Ha|hT%3o-dy_GczmI-C$Lur1|EJyb2 zV+4_cIr{u69y6Yn-B8ORlj0nfHGy_eo?dp<#`;SkJ--jcxtNl*VE052QgRmm8`q;K zp=}gef}%9n)hU;XW3g6+^DCoFCJB-MPD%7V8?e144#kV$@U&-?f*Fo&tP6tcn8^uM z==NM&HwDE$E!zB*w_WRy@pFl=)Uv;I80&31LyX0P_eP4Z=wG23%$ZoXmT@2*$xz#o zMQW_uqS*bH%Z(@_Z=W`khuAq6F<6!umCPn8`r$ql2~0ZZs02qT@~~RWP^^AvD&;Zn zG}Y3kLgDOJ6stxM-gwjy@4|?*z{c*r*9GDjIiqet@Gy`#YVUU|(Y1!XncY=5#Oi^v zJmiKYcA<0Q%Pjd6!bZsgIBZdaAdaw{qL|ZWN%e4>O%zu&TE=mtUpw%3o>ri2t-Zz0 z!irGl}k>QnN%Q`-R|M@*B6q9$Amqhr6dccoGRt5y^&R9i_jG!_C| zqX?3G&X&B;SaYjQx~r`mTBe#m?DS^TIAzR)w8%Sxw3DM@U*<}g-vHq84Ki=&E-W97 zCorQpw1j(!I+f9lxgtUZ0v_!`hhp;A6kEcx87t^~xLN*+8YbY%U&Y#}8^4k3qLV3^ zGN|T&yct^exJQP&c9F(LwfcwerFzhW{f;o0A%LaiZ?HBcN25;)McwSluKcL-7Kp%X zT{WrTp|ZL8n;2~@^;28cw%RKaNx~ur+(SM)?pTcdQ}S4G!sFsQp!{V_PL~Jk&sDGP z+oO7bZ>A#oubZe=!DEAS47TBM)AxYM>G^vP`Fmtw(>nRuBmLclcUd0q43q%-3gigO zXF`xY4Xzzd0?;INwW&FGc&(}jCbjVKbce`Q7|N?O1Oa+m?9AeY7f_|gk_9)RXmaynz{0Uc$Zl3`0;##tCEn>v`CLEjo0L=Gk0fp` zfxDJeB^(^ZW2OpGlObv5KYn`+;5h%6arY0cBeXZNg5l-;kFjGSWaeby`mg$D+;K56 zG5uHmd;Gs8Aqyi1EA#)`xN}uavR&bqrIO^3jB)v$$}0IgaB-G#aCR$AN#J{myZ{1+Wpn8*sht2PBS{n9m;a%h_rwx{{%uFMiLrSSOP(LJ$w^L zBU3|F;0&G(EH04MG)+xTBr2*QTz_!`nYip$WUNuhT?lO;G`U_RjWBRnSO#J;K^O~2 zmmo?x;Nfc^55iT+sV)3bm^`L;_#{Dj194*#im+c6=605lMZv9M{+C;LbW?P_Jw|mb z%-<1@6WU48gvKUD@J_A`&0tt-=^!R)hv`5tgc@P9D1x93pje=EQ8tr6ge-r4DZ=K} zQ0EuG#3?JOYA6?*27sx%Hn%`>eJjuzRal)X!vQ%WgR?;cDFy-)7S~ifUzGluMNsbH z0u>a3FZfA@G z^b3}8H77QGZD}caY;z5I63mI!yrJbyH#Z}=7_}Gu&;tI?ryJNhkRR%SjX6v{stxd` z!XJGR;88#Z&{fu-o-9(KAEkBSvLH^O!(Bg^KqTOA^o3)AV;~B`TYXE~s4U-)aVn}Y zV4G;#t6o7K5+2krqE)ENOEAVyxOs4LWvkqXFLMt2Kv+djjkZ7gU}GM$qU5J&JF}?B1Lv7J0#fL99NNzP-PWVqOn`qFhgc$-Ds3wpgB+%^C zV8EM3`_9I_%;dWaTz=oi0=@|%BTIuLh^KZ2Fi{T@Uv`wvAE3HImf4L5`=K6WVj7Nr zz#SMIz-81>=o9ZNI~yCS_k)0`DB(x#YX)ZalfSGfPQ?nQq0tdC4P*)_9bM31RCxCD z$9ejjCbg(BIyxYpF7CL8>dT&oL|X>u#SieE8ccqxQOycND4|V~`7;mTmeOhmmP@AX zBgg0ge8#@wtwJ@t6T2O=3y#YAMlSkgljDr83*+;p^yKIOiL29J|I7=q&kwF6oF0Ph z?tfK-2y4F9dJ--ERABVd(vdL~QcM5%sUNqb2W3N#F3wNm_70DMGdj7jI!T!LUjpM$ zQ1m9EH_Vp^w(LZL7??GH`V-Lud70O7^uis6y;`T~WC5AQ>lgeG(gQV~5)8r{V0=J2 zHUg!Q{Sc}HH7*hiA{h9-Kso}YnSK*WqP+=(VfI$NBJTSSs=fyjG9~{IvI8}a6M&87 zy+aBymwgGvRj_>vb;fy%{}8(2LpA&jy*#hw`xt@Pw?8y7va~chv)H%!h|LPTO2vh9 zX>w`!Him;X{3qK*u(}1&QX|=bvV#7^H~x_P%#8mO{&BInN8AqrV*y?hY~Ih!!tEh# zZuYY>GxeV}ddCbZ0{adJI>UIah12PIM3@$5_iGP91I2ESj=$1ZBJ4{43J0lYY;<{} zxny7)UAtp|3=4nDB}M9btL?ygZGkRwixkKfbQ|m6+6J+BNd*@*d&3Muvwy-2njC*; zfFe3kK-EFQu<^x<7x08i_H!MC`6r}DprTA5I5mCGi?{=Sl_TuKy{G<~kN+ZIBTef< zKHPs>QRUM7k$AsJZxC@3ayx%fdyS=9u}>#EojK$rgj?U>{8<8~5#7Hn9nc@eK7IV4 zx>K-;(HBNK6lVS&0Kcd`{r8hiAC!!4^tB?WN#yb)HSz`vtoxk-Nin!NHh-lM94DS- z6O~2#4Ff#(NC8X{1XLGHa$76rj|A=p{&fTtzV~UqMa1RTqsW>52lvMehgmzdhtT9# zjUOQnY1xK8Qo_;~15|p_NNxsEJnx^FpYq+E8QEg}TDTs2krV;MxgU?z_h_}g7((m3 zl47buzIz5#50cS**9B959n&f#uEPtzpZOmRka2;QTm9{V0zwW2aRex}s7s{h)-`}% zHh})duPx*Ar26=U4#s2khvEB48W;#<>koNYqY5GFH(}-AdK@u9c-GuLW>TjtWO1vo z7IVEr<5=NT(CdD>wMlPF+xL?%m1-LymnFYXE|_13H{CcPZf0q5h=M5zX32Q}g*g8` ze^40;F(~#g*>hm3e^SU$wMkP4Gxpj#_&*Fex;~l|=*gdtY5TZ&L$Z0#JgRZV#B(Sb z7QmqMKn}R5!?R`FGMk0gf-)D^&g+|LS)D@`&n9kkK@C|WY6WFxxZ+u#bv;FGTxxn= z=Sw_Ska?FP7ofdxAS`KsJ@i4B*WePifm} zOjCVQfnUmUiiWA*i>8LIh)JsjUbM5_)eaKjtK?{g6T|aW_gcR6ECk61&BA(T)mK|b z+5T`Mefdpo-c%f{>G3z!!7+^Q1Ommx8@-R>9pMs4N7yk?FSe)$)h90>3V)}Vcl zR8IL+1p~SQwtn$wy&}}w-Z;~YH=*SOJX9|n>2CKv2x-LHQPxWgwjO`HS?_jFEw!l-y`3 zWp+4mMX7BHP$?AQDHZ)x-wCq-1xpXbrA9;h*S2cAh_RXl+84dp9>0bfQAj&pZ|of= zw&se_U$90fRz505J_vLsQn)i4M1qOG6_hM)^#BGsK8V zr;@#=TJ*mLt4**_`pRgEjW>H?NcNij{%8b~OOKbn%sQ&%mMo#JD$1k0@lO;d3R95b zqBMCT1kS4|zRh0;%Hy#CBYT#71r5rzYSGPAwnZvDGs41)@O3WDo4>DdG39{?+8C<~730wYbe}2Avf|3=J#deS zQC%R)SLKDHCW0pab!{w)RsC-gd)f!S6Bs;n&4KTDH0_R9X=*>|hVl!!&1Jq|dy>EV zjr7OS23_fBGMM5cxW*K#u#Y;2uKaTR;!_r9`KGiH*v{MpZhOkMM1W_A zog3e6S2Ac<#-i4H&%7W2&30F<6U1@q6DDA}vbO@uXW2Ve6{Ts0(P@zfeI*#p`eBAK zy9i{9lqLtYWJuf>2YC}QP{OO3Aj8NW{6+Oa_qjfOBE=j8vuML19gD0cwptrA(e<^r z8U}rOEb_sn9Oa|5yiJ?*e!!+E>DOG{O4;l*ythMhHui_O*YB;tNCQIEmV85ME^u@D z@4Uf`^`$v;iM233v2=!Ynu3%MJ^8)u4BAYz`2T^ z$Zf~M-_Iju&b}D&c{s&iop?OB`#)q;G)6f7qjmVj!5o%P*XpUI6CWmml{=1n=67)t z{Zn+RGAwt#;%cj3)_weU`%=;>u7{~J{CqPyZOXaYRw;Axf#{;e^Erw!pRT$wT1=tV zSVnME?!e0~kp(F^IUyi35io0OT4-xCw79_eU%J2TYJBuLyy$gH_>)z@2Anc5k{{=r zwQz-~*2*i3^rw^_EomEfW2|!jc9wR*@2wh4=#k;+axXoiE%OBTGhr$z9k!gRcAlVN zAP!+4rm9`gx&kw7<_!2838i~p8O9ecbt;ui7bT*liOzrrZi$>rT{R$iWG_|Ksd|`) z^$3e&k-n=_&krd$6|2|Adn!AmvR&5(7Y8 z5@L-|;b7yvcS(lMSOx_=>)R;LnE~mK$*w(9|iTdRjL5fZ!QieHT|JpBUP-X=`MI~kt%26 zurr9f_Op(`a7-PbV8sqq)!5J}8XYzYFwl>EjfYTEKGgRF?aH&U%2nlUr2AZy8wx0j z&&a1V@?E5xm|U3zqH{@+p8cK%&Xynogr!Gz_YJJ&u#=LQsD%U1U#$T5*2DG)hWKdb z4dpXl37*0Rg=E})1~d}_g_Yn%nYt$lB)!IQdd<<_q0 zko$Z4Xs>a3t0V`86#YpW*E0fC01B~ob66XtWnOu33oz$qJ(azhr}oT zW>Kr5`OhFyXk6$F&m;HpxWb{vV&KU<&{4iInzrwzcEng5JFzO<&vj!qwKP)>5KG{B zHF@o~Fo|m_oQc|rf>f7qTRdigbi!>Lus$qggL}nF6`j!svOnk={sO%+yeDepmeVa* z((LA-$jh5QSK=FgQ*m9F+tGmp&SM&{%simbXdJ+(MWnHd##qEPCF$pDZ;Wr;WAq8(xFrbW~+^XH6lr=l`QS&pZ zKCu+;8kEYv!Ike}a- zn=UMTv)k?XnOA69b;OJkZn!|wbPOqVmFq}fh~ZX0(EH}EsQPlR%QTKs2eM+v$sKGH z+_IA{e*>0m zb@};zbig&4Ynd5ry{2FKx+a{xQfZoSs>R&5Udn0EAK8Jo7#G8}$$S+A6=R5*-1=Za z!PjY;)4);F0a>5c>TaQ10&88*V~WpeL&+M$d+NL}0QCX&-c)>@G{89i=_CX{H(kTF z+NC2J4QERJKp%r#rIy7i#&wZ}W?W|K>H?+nXI}hJN&jiUBx^BFbrDm8~5A#pmb;_x{^bU%wnx-gzRH%7ML9 zSp!qdB71ht_}A5>Tj3g_6$y5i>`hn7Q&ZO?9&XK7w|n%B;dya-MEus&qV0z$VjhLO zsISj+jKJ=|N3AZmFUNTagr<{DGGbui-}dFj-4L?93{1JVT!(d1M`Mx8GuqRzI=va{ zEB0?renu-_d}V`U*Xy;8AGpWSUJv;9Dr)(vAF)7tYSfd+lCz_`EK%7E=|qY@ui&tz z{ExaEf#lksc8%3d7dFf_!;0B*Acb?>>Ua&`JRANqZRGX9fSBomT!M2rH$%{e(8=`e z>-TJX6S%t3zRHyW+J3JX;K)V(QWL%8(;XDpaUYtDsHc$_2!!ckYrbDbncKd`!l3UV(NkW>MLGKTnfLl z40=IB8DPX9mp3r+6R)Qggxt;oYt@e~P)5ldo}MvX&IW8q<(h|vWJYzTf6E_Ttc9$$ zyc{5Hw29^|c!PBMWkoNq>HjlPz+gk;EJc}KGCOA3rr+|puwzXo)N>T@y&h_Y8Oyqn zfEfKjQ8iOA1xkGPHfvzJ0&=uZ2Vl1KA1qh{8!Ip*=W$2sgPbghG>+{YmRR~i^!QK| zDmtj_8%IMMk_u-TZYSLMktAc26CERsG7XXIAeX6NzVi z*se~;@#6CYw)BoQAgI<97u4H5)RlY{b~%zK{;W!fRl_AoRFlYG;s+TY4n& zAU#?|Ioo&y`-XLZB#ikchg;y9D!>Ks!RevOF(3qwqT#zIIVCU9F34&R!x-N@aZAQgvvN7=vgWzs7rocBw)&e15X^cFGN;N**b zS`D&GVL*9FHg`^z6$lR-ZYgWazwcIkEMH01m=qDS3||P7$P35I(UOvHKbWY&NnG#f ziVC`+u>G)i-S8#B+Fgk|I8~`!cBPnZT6U)ZaII*-f5F9TFX7JocBQsWiE7H= ziO{*%#%p9Y=LarHhgi(5Tja{=4q<&VBvQi`C6{|MI%~yRiIC$2EHs$(wSZ zKHpW!TM(w!l;zvC`!_J()>#wO#egyZkZH`^loW6(zHVr5IS^3-;uvEcWS5>ufk%Su zBv_2btA=ffmgR}dt)D2C^_u?pCUPYe4E=A^V_9C1cVQKRjtsvYQX5}cqXohmN6kwA ziy~g@wr^q(_&7BCwvcFP^gTXR$LY0jXE1v^9xh@<#Z)hA@jw#;HsPm zF%gzsS;tf)?IZ%L(4IUtn-}5-;`t4Q$$|1~Txrdpy2)_F_za>?`a@3%Z zROt`H^#p{a@j*h#Zv?R7hI7U^e!I?n80c{nE7!SWYo9m5jCzm=vW;%8Ug#5<#M9HV z_j6d~e`45z5|!fA2Sk#mS$6GBfWX!PE;KRG{7zxlb#JUQ3HfoL2mbMFVvIWVw}pZ+i5-Z@~>mJdSBG?bU-r z9xXVK(Bly;US$2Ae z$zL*4BfDHq^Zbn?jt`TO_TtUcR>y{WXS6C2d*=y4 zAXXND78k))HCmZ92d58fgK@k;!4J)p@#kHH2O$KNx?`0xM;N2WH3KQ$!3C z`$aC00XetDKSDa6-n!Rfoh1Lvkh>#JH=9^reEB2Ua^*5qp8alrfR;nx7}ZhJtf~n!8CaFC920F$bU+d8Z4~5R23~5na-oJiKvl!QS^{I?V0({mH zk7M^4oeIKLt}mcfi2XSt;N|7hlY(PDpf+N%QahB`58B-k3gj;W?a&dXuATiU2g4J2 zrL0LW@+o>&_$N0m7Z}@KULz^9x-hezt=1ij=&3N=mK>~=An0ff86JH=+QHf-G1Zt# zR=0{F>>p?z->k^sa``U%(#6a|_B%7uljwpToY39Lz)*iFnbs{d2b8FXEVbFkdwm9e zBCf51x?>2&{Vb|_5l1w;9-VO+dBDQbuwn28mEhtK0nr>?xDE84Q$7-h)y5Q5YJYTw z(z0@{>`ryK*LDT!Ng1W;MY6u6b=G<9{}R6S!GN#CC7K{f976oR5c}x5s05w3$zrB)&di)MIS#>O3dbD?G9=m*wT=-3+V=nJe&_`47L}Nd)mB(2G z;=z~bk3s+JVQA6nAKo}n|ANkLtLseLxMQ89Zz0?!cT5=&Sl6oGzvH^ShOVx=7P$T+ zy6QYR(a5IGxDm%`t84X|#s5pSp4<87;DlXGn7s-5kQsCZF;6QVj(N zD=I!aKc#nAg^Y1 zV%IN!I53xee`MdS*t$q`HXEnz`=T+(RU|Z`UCdMYv@iZqF0;?kY9VyPsng(whL~qI z?$kAP(`CL}Fth3>qsuHbfLBasrp6Lk_lGTB!zL*z(j@||8*jC8HFfsDTx!4{}4HYbKRRZ_LEYH7-m( zHJ@ir9RbQ4$rNO)GoKRtNp7?jyjmZ2b6P722>|4AzTGjk5la#v;zypN9Kil{dqDdd1>b#SRS#3!YSr&t<#7>;CQykratHG?Zg_v zeYLdLOPNlaDi~nV8JK02;VnjXfe^oq_sxE#k!>Xn#A<{7pZ(aFN*q@y5nWKtYZW*6 z`A8JKWne_{h8p7e9HLQe6Sz6El(Tc07uI`H)$LR`)x9&-vus$erE=j4bdQ=SuU=0% z4(Sme`>b8?6pdTBzrAHqeOmK5N3O_?o4-_+!taBw6xtm#=$gaAd9+ICx-dF+Cd7Br z8RumC(BH_IP7L}|u3-eT1cH8WUBP%zJ&O`PY|d5AsJi&>WR*0bet*@9M1!HAiLUc`#~B@ zl=aTiHb)vc*wcp@lQo(ngic_^Q)@@=)fJ~~!dOdCyu8;XCiOlhDjOohApgt>XVQTm z>ciBAa(4}CV2Zv=@7tCvvG#dUr&9m#QO)#`>0e%6)NJ~0G;9ua$=>b5XXWotY=w`S>g7Jf-Q-_dGrmUdi1l@%DXyNer}(&41rW-x^nT?NFkI|bo=Rn@{~r$9j4n@dA>ti0(CxAy~Yo~ z5uUe-GFx*=V@AX;Hq&QYUk>Kldwj6#(NEf8;=nWaI&#(*`Tm+QB=^Zn*tSOxP3pz| znnTOLe%nk)^QG5H{Dm0edG2~kenP1QS@#7~>$I5h2pcE}|7Ff`%J8?W&$q$^$Wr>m zaE{8}&5d6~5@;#|SA;UZ)?F%aZiU%&DLX7Sx4+W%T*}=haU|UGFVq7k=DonZ9BAHD z;GI{1sy6-sN2O1^sR0 z!~c)>eO)R{3*O@5xYpn&>JTv>Pytdd4LrL-0wLo0)7{IpObngpi0v6K!^B=oREa=( zo=NR&k<;n4cUq$=EA`Iw-bL~P2mRfemDROns^bjiez5*M+r)BNR12(RZOq=(F!P*@ z2w-t~05~|kIv%Ul?}KC?>_zcd&T^*N8z>^>uM7n_$?J5AXCPnrP zYO?M_1us|MJ16?_6G~dU?v*ny4pX8zj$^|TcyFwxh|`MOyz;LSwjXJ8$a`dgciM|% zMf+)}QG!9mz7TZpDpqqXls2y#Wkhh1C*yJcrwy`CcURi5$9@VV<0$ z+?L7%DrGba2fI=ZFENwpX1FqiKa(gQ*TSh}QS_{_3P8+h2AEAS#(hKzZgk~NL zaoq2s>O5Udw;tQyyG6AEaSeheMW?QY9eWMS{6@&OUc>d%DGpiO^zfwgRxehBF^P}f zT2}L;agoj~s0|T(bnviry0G*7LSXk4wZ%+Q5UL48rRxMu^0xE{so$5WcEcXX4k0-& z`yrU{{}>>>=@3v+eAZ;at<~fvQ#qpOEBgAh^SaX%Jri-tmFg|KRr6dth#28PG2{{qPkkE6TW0(j^21jiK=q5d}am1Md^5v_IxyoSynd#WJeyku2@zoWJX& z1xdc0& zdA5&XNHZ8vz@JD&((rQP3QXmZ(QwRM7h-)7xo*|zdfO7kmtI2Pv&l#lfY#ooXd>cZ;k%ax^4no3j!GkUvyo$6C4wsNZ3__D8H|ht z`$<*LG`Z9#i(hm=4YLR}_wv_VC_dDO^IMZl1UlHr931ePXwhE7qc5k%dE;r@HQ*o$ zGw5+5_8yf4OerQC)MkeJS|0aMU8a>3*$;fGA1FO1h-wM1dRmkASXh1hh+|CGan+Y+p>^_Pmn2YQHYJ#dky@po8ydp|x0(oD za)^qNt}}#xYhh8?+>d={P|tXegvvXa#1*|ol@ZKbv8(h3jUKU&|L#P%nlYa_f#^fT z6|m$)Vq468%BQ_nYZ+tV_~>(@7`VwUjh9}TOMpkVc`iGe9qAFz!(HyiJCKL?Deyf|u~mQ|;+cSo5zqJ1i@V+mWv@Z5tp_~G#ROE0R}{@BiI zrx~biz%FS1nUIlmR4GMUrUfWP{o?WQi(IH|A*Sb0C$kzdb1eK>R6V(ep zmbID^-N|*cf;Z*8xMk#8<@k$C*DgLv-BP6=&DgkiXzd?R+u6#;vmY5h`C}iI5CvrO zT4>^4a zkVKjKu^-{K7quxdLwcvdF7QNAv@Vid34wPL+%B-~5}lg;b-@2rZKMiiX*NnQ)up(} zJQ5RSqp)0{|Fe{=|BKi@2_KwFtYEns4Cjil!TYPDYFp2)s!D$LA3P+Q(-mkV?+TLcjowO!sI(sN zqOWoF5w&xp#52f<0M=eRymT?+x)ha*c4&;zEcZrAJ+nuImH((%aIvcpxUdx@pS~~5 zamPz7&(v>P#r$?_&|CBA#VT#j3YVRRM{|~jS{rOtwCU@2DOLzECU!S{F;j6YqkX8S zl$L%n z7_=(@B(U_*0jjqnRel1p1oPZNHaW)|W4@;tj!h@nckZ>L*HeHuEBaJa)IWu3uwHxJ zTqc~V>lB-%(p0++`w^NZ+hI_cBp0a5JPC^Yn5ht%u8l58S2M3{OSSaUXDa}`vitG1 z9jK~PMbFGw(=ZZf6=fr_Wi@lNIpaNxhK93pa0gp#XLyPy`12L_QTFS)FtR)YAqz3y z02&;B4$c&WS{w5p&xq$66Y&G)7@7y`K9AyF-18Fp%m{*ecxk!!U5r0YzVfFhN)N24 zlzREK7f=f3MEia2ls$#_4YeT|V>yl6|LHKlbQ4^Y4jmX$V#V=u(GJ!v>v}9(?QZsz zvQj%myYT*N4o$Cw_}lnzT|})}$>oXux-1o9UU%iVhkrb!FcXl5SroYCp3fXHb z)O4xA@ZZ75QXrh#zxtRlJDp!j@WI6I%!SH*3oU=!1ka8*A@Paj9D1U4ulCl#*m*xB z(;(VavAf^jh&zx@qdU4U#;oDlq#iM-3gpCMo6l8LF_fj0mhdAyxM(lSG}pmKW8zJ_ z#m+stT5x=?{#XE8VY1`~ib%jkE@>)OS}%^cR(y>VZ9!PCF%`9PuWD$|H8K;F3YK(w zHo9|8V|8~JX8;uA(Pzpec-vUaD~T+@6_T!C;ua@3ak|{zf=31cD8Pe#>(r=xbpYC2 zJB(B$LwGiBGR2wXWeA&*W%FdcQgqU8PWXvY!0l5?4 zYwLGKYm;GIfQ(6n0vkL5`dFIN;D?b9&G2sDz(x0pT8^y=;z#QY_J`g_tpUg|hs>Y7 zA$O#BW~WEsv=?bk^VNGV!nx;YqH5$t_>c6gv=_VIf^c)Lc@B^>IysSr&OX0>KEHu# zbK+LsuhdT=#FJBhcTwdu+9#UPOPEO3#*{*sw*smZ zCC=JoU&5{u*ElP+x*NBW6~7ui5_hH2cnaPFb)J&x=Le$iTi=x}h{7q_B!BiuYONa( zpeDgj7%sebc~Vq3_JCJ^dh*u|Xh zqa%?#c7N;{A--lLb3PCDysy4R9h-I{p|i$h0BO1-i&k)jPv?F)(!p0L?LEpMvnwi< z=9hY^VH;G8LGuZ6!dCm{Af_5g`#M80opYz!68^-@qo3D zgcN8ucg}44P}ki^2REERKJOi&smC%VT3)(T0PNb(>le6&F)jWjcV1ApD)UVy?Q?H> z@z$kRT1_xvDTY6h^@YsPFlMglW@5qB({iL7Llm0ChT47jkI06dg=JuO;(qEXoU7#ty2dy z6`cc~XczNa9U{u>slr*K)eYFs&{J8{#i0Epu>HW1HSWOm&bQWCrd!7(shZrZbx#+d zMIU=Z1o)fUo1ailn>Em9vg}ELqk*{;0z z&AsKCH+Y6Qlb3A?nlKHak46*qeu)`Na{5!~JvQj>D`$P1taS1%DGN~abv8{Ck)u8Y!ohw$4tnP7d08STLc~TCAo4|2*uAy4}yEp=f1iUM@AGIu~rLoyNV3>vOE8R5MO} zGUS!?^YJk3UbB&;m)I8k0b48*P>gW04%{ej5-PwtoRkGzg`ZCM z%S-VGWW8Sp_UZ4T-hB%R?Yd>-~w*jniBl;8`F)cyR5=!&0b;2vsI?50fM1fB^=NCf&cvZjakE0q2hW=Xspz zp&0_Xw0s7fAEp(DJ)<>8jf9V#G&Zr;4kJZ4z|QZmC&EWZKGQ^X@h&wK(?Bo9@(EF! zJcjLshOVQ$TDfmD$4b@?wiCTHg^~t&5E(5M4=fGz_bp7OdWwWY6A~uBhkX2Ii*%M$nO!>D1E-P>{BrvJO!de zmi`b!Z)fMR!*CA7K_fkCRzrvruHxRg;$7$P~Xa#?RPZT{sY#>V0pVJBQmTv-} z*5}Y|O^6vrQzMk}P}41#v7cV1d#9x2I7*D*v0lwl*caCFl)8#g^KC?6sDKLtH)_Ls zqRP0qhR9v@NP;9@TinKUb zs7T1K_nGK3(-;x8*g&Ql)Uf`i3u1>|uE2h$BzX2N=n%29kf;i+XprvtjZYYT5{uXU zJ{@<_V+sZafnDn2k9osu;@sCgvugUZ7np9sM`Av4cw=6tyF2@{_ zWdztVfG149Z`G-`d1%Xoi|7ERqEYG#-IrV&C`jpJA7N9hY)>zbZ9`nQ%;Ob3kV^W9 z!Kr-$i}OETIEA+1TijeeI8-ZAmzgscBTnNh^^veHh$=uua!Gfx^v!K;ps)8V5%{>V zKTXXjfPiYI)<2U4PjH0LPNDJmuugs;iD+WtX3QtdiSO?!j42)jK2D}|Q$Bk8Y$ost z-!!jz`6DeSP<-Ue)c=0a&WwvE`LcxCo;F#b9E`50p}IzmPdz>-F`#o)dvGJ3%~aUZ z6?664cHOVB@pe1$yGrVs8fDfx?#7j=AUyL(+}2N+SSXy%`Ib}75cBDMIT$^B!S6w`1=64ruBEmseLdBR#!(0i!(@N z@Gf%8Sx|x*KFwC~M~%Hegb{L8J4NULlJ|0bEF{VRxa7s_4VrxmK5H}S)n4a??+hBc zs$&Fs9j{{upU0kO<;F|B=dWfd@aDAIQdAeSB!dhr;@#WAXS_Pnny&j_va?04B4lK1 znNQPg7mX>B2(jBHBs_AYy<#xv!X3RxCi8!d)19-48|d?N+W@1WZi$~eG)?CtX&(b7 z)0>l8bPppzl(8m8f(q}RhBi8J6jt9x@OZ(MP%B8WUdO)tP5x))rm$4%#b^U&Hr=?e z@LGO@2k3HBwNA$dG&_rk_T8QThC~*2cLjTAZW#Yu@ZIg1c=#RsVcw)pPRU52e~eCT z)R*P{j$*`$HBQ9gL(c-Xc26QN?WKEVl20&U#a!1$s}r#4dJD5|$lNheA0q;R%iA9g z-=1U2R(xwuX_Lf?jKLK(c{Zjq-XSJPJ@8N_{pl`qB^X<{`K?X25J10XK6tw#RH3oL zcQ_F6DOw^o>gHyEhVO07Nl)C46^zV<8!uYqZp0prC2e&Y{wvQ4hrG2|syUW4TUNnS+p!>a} z<1g^<5jLr4dtTjUi*^FTVX#=nhI`9=FN==!uD98mSIwJRM(|%63zA|E6=G*>CCT98 zrh=+p`$~gqTH@w(U@{ViV`u7kHQ#Q|fAuZ@zM*+QId&oy zOIRfWzfFoCG!=I*dl$u|*h=ogP`b1pXe6&8FZ3;UF-=agVSYGE`Zh|=&VMQDzGb3I zeOrjpac}r=xg|RgG5>Z2Bi!mhHbXoHp`VERj;ZjdV0gy( zg(nb&es5ruV0hURSC)R-Tuy)z`Z1F+=uEnKo3*>y_E>G5@PKjW)qoXHt|)kfrt#7| zCJ|QXEP-D?5mucEamzwUYNi!RpAHq%akr)5sF1+VyL1bQDU-=;pTPPV&sEIWbvB6F zgN===G*DjiD*Y>?qGt7@+f4c!^Ig~d2sr1hHcv!Ti%`e?h=2Zp(jR~3uCJ2*ov%h? zxX=$nW4^1|T|wgbgNO*G$h4Px3p=YA>6r)O?pr5}&T9|1Jtr2`{p=+*9EcA^U&a(I zus~ZurDGLm=2YT`Ry*Wojrp>e8*gUlj~JatvR;$WnF1GE#i{r+-spZ4l%{`~4PuF%5y}U&;r%KDAID&IK33)Ok?qgx$0fBG2fO+VO1ba98&66^QXH8;yg%iNCNsGa2 zr}Li|0n&(;@W{sdP~8CrWu}Fe>^BvDN8&1-=lNlf{3_e zu2`c5J_X7$cuA4x;OkY8tD>wVcNy;C&6x^h*STM+}p6QXW-9 z-xr%=nw$!NDz%?BTA6K$bH2d*q%dn1@bO*sw94ZNE4~&6OmHVAzV9|75qRhe{6HBZ z8UoY!k^B8P_r{e;(Tw3lkXR;_TqnhHOceh|Vb%pS#)C^Js?OnH&S-n92otCXI;$?P z+t91n(Q{wLJ`;z>&M2Z7<@QGvEaT~P*0JvjnRMX+MaZ6WiP1EHMU+vI`vT;JithSmW6 z!)Qz-L{e}h&{^&H{=VQS%^_28SxIb%x0|9)(j++scTs|DkCkM2*sARnB8$amx;-K! z&cIc1ZYC55Crcsn`?$(2rVF-?kjB-;POlB}w!{z8w+zkii(u9bHN=xT-yH94)nFe7 zpibc%sOr~LBcT>3+kLD@%|Ec0z0~N8&LKbiNSH?{;JgxrS+8tuT6I`ee7*FB^QEDo zGvMsq)5Yl(X##}5ujANIRiKeex2 z&dq-t<%iyVjopRm*>>r{YLMP48&(KBR=B>zA+8CO$n0mU*<}0XRMu87z+jH#&~jMh zs1Dm7B)p^*2ZghaZxDHFow4h)#v|^6$4V$8vwf_gL!c7!r(R!h?a{s;&9J|MdM)%_o#FQ(#7N5z?_6$6@0=HXM56_wHrN0ht=SQ(iAf$^j6ly)gcSKqe0l1OG1V>_W&}WkdAn zy#vnp5_DqERGH&(ZvQ8X;XJ0bHq-m0;FJyi>+=>o(pR3=sPlPU{AW ziEBZQf|*6+V-KF6|1T3Z?8$-fEKb6J5Z6_0#{%Ae-hKM6WQ6lAXr339OH#3g?fy77 z{^^bZ2kP#Upgk~bxL&NlEVysve1vY4Gzw$fa6Pisc`x*9|z!(-WIa&0Q_hGmg^2snH90b#jcj-Ip zuGV9+E6*kc(t~*z3>``QTvfmVLjeyxGfHy*jjGS=kqUu*_n(5EB}bhX9iEZZw~8 z_5_Z{o0?*sCMvk@U!sa{SU1n#yqr*%jW;$=$rIys`%Jv_U0RdipavS7%iz(sPmNrB z3S(QFQyzZSz$SK=3?{MPjZTa3hR9FOs5+G5-)gcM;3JwQHi2^A>ZbazEp+juzo}*2 z(OE3KjEF=TIs2AUfP~YzjP`h6N}H9^&Hegdve^)zEhZdq03EP&gW>{n;53#1tnR`C z1|Le2O?i?N2qQS##V|;$RY+io%kk&$oFTJCdM-U=8~j#15nS81KMoSY?t+EnExw5rp<{|$anrUSfR`{n{9O? zf{?q6)V|gY`D#Q4Prs#SY?wbxDO-RUS^P*g@0KZ$F_3z> zaLggC6FP^hcmMW@`3^b3Qtwn@K!Y+vq#h(`$m==ba-eL3T zQiJw8UtQ6}Qf*KI5yqiuK-NC}alCfg5llVgi4G28pN6Tr%~6Jqso11;;iV|tyw60= zM`o%EB^1li+#FP=y40#nI-hfNkwjFy;3|Ea;V83cOl2O){n~L+THVTZ#u}mUJ*o}mEg*ebt zt(k?7ClgR`%_cI_hAh^E?zdbPY=gR-3fHHPeL75zN_zV$laT*Ju_9`Sy0(hro&%!gBWu7gk?koZYa$64CCP0T$+W)6J*`@ioe&srXr zcAM(-of+_i9bS&d%<81ljoUsL>MRNsWwD_i)FbT@UOG_+5Az3Bw6hAVp<55234nuH zel?#71AtM)yj2`g`6j^VT~`>8=5 zvFa-A$)s~z$bV(J;6S%ZekDR0WMhBJ8?302v&Hr*9xq~ymkv|E;2Eci_Me!1mm-a>O@%|33963nljIwG8?6neFoi%)U zquzDM^p75NUx4zzAMP}a(|es(v#N^#kLiPjelHX)E~_+>?X0yF zaW#f%TnCrOkPeP&#A<6aqowFyBpyGHfnUyijt9b|C5{)?SR#MDnXchlSOtVc8b{#` z6Y0uNXl6NCenWYll%ao9Z_CnP`4 zb7U|>FnO4PS=9at)>-#mqpT_`_^+Gs-Lo%Go46AG(pEX?s8vrRrX&2FalTQ3N?V5F znJ}T+zffT%L;hausu>RsyCK^7>+urv3?{Xg=ZSXcDVP``?uf$;u@4Pgb7}%Hd@ff@ zlQ+W(!#Pf(>G{vPIRWhEYiX*}!omP{B1k7iJrwIF8pfq(a}zA#G$j~v&QFn-7SLOh ztYrDfEJa$tby3oqI|OL`PlV_>&@6}NP>PSV$>>|ZgjaE!o9|`Oia@Oq?`~3)STKB) zE;TQgi;d#T)&BNe_PV>?=@_DwKl zqljC@1-lAfoR%Kwt|XQzg#-CPh!WL78Av!N+1rpVBaKo99;9%8iz6r7{mi1#&I(=6 zg29H15YbMv`e5$W6o@Q&B@q?tNela&mS4bnkFhQt1U5~4^|C6Ua0O_gL;;?Sh?g(t zk!)$u73uqzWn_g?=DJMNRZO2m;g&e(#^kXW%w}Iph8;I%qCr3dj~;Z|435;ml+fjF zl$ot9qa%jqs!NJoem+p1>?1B(9&j-2Qx!it&)A5U*69pc)w`>B?g6eB!jgbg%wG^# zVJwg^5y-0a=1(Icm-2o2OxXy;jJtsN3Mi*^M!Nrp1dF6(23*N-WHhlRFfm{mKgzb` z4oF#oJykNa3NP$@c){rC+(j3kawWEh8&?j#1tjza@mMu7uu(XPR zIal08)7un^ln)RNO$t{-SOfcsoPbc$n<2M;6E{>}54zxiIYiD_C=<&%GN%$WI;D3g zMWq-Jj8#ae;8IE1YpDe9GJm+Xu>y3Ee2$tZlw5TFBw04VRB^$c)3VWIGBBt$w`+xX z20p?Hz8rJOX(6)XQb<=-twz(YHicnFA|B&R%VF9On(}j{2VqfOnT5cUk4$t5VF)Xt z{^`SLw`4yK^atioA95vzk5NFl3Z)ypWbq*Q2VoPLdaLk|IK3r(yvU*3F^`wdg^MB{ zvY;(|>V-eGiz_SGb*~U1|BfxIl>1m3MC*=I8uosKqT^x3^Kgvu_T=eZQ9~ z+Rx>>Hrzy(@YJ0VVd~7p-dGu`%>U`TlI6A*$6NKHP(_bHRX~yOFUIbs~P<$*_T6>ocH+)-=*E>NH(L#V4CY82zfbAKo z5R5JqEW6nY^|Q{KD?s^ItnDy$ojq_Wg)tm+K2Hdcj@kZsS?(_7DM{&-=kJkI09{9H zHGc)Bzv`~6M>nfS1|twJ)kkF_VVNoE93b*f&-1usUd%es#p*0>WR((`4GS$!#t70- zQz87N-^=%O*W}FWLD_@ZJnF+G5;#_&H0_DOEwXzm>PLz9e$CI&->m3e z>_Y^5v*cfO9_V4Z)=+w&_NM%q-mM1{T)S|%9X-`FgT8$Frez4QHx5%5hTBTBEwQ^V zQ3J0ZcSj-8GW87N0LLIV_qhFwc$)9#MENP;1pt0Au0I4Rr^_D&6yEH@C6x~|$q}CB zIK8f+NsEZ~j^6KKt`ifF(%6cog#qhx#$&q&n>`vQc&_m^chf5gQzFb{aDC#f+d?~M zucLP>OOpe!v_!wqr3w$AY5C^7oETWT2~$F-wq9}D9oaJlaAM^f`Clq$2@kKABnRu` zM^_5gImw$5dJ^>AEWOe@?Xf7G3wsPF5<6AG^dOx<0(_t5 zxnj9S)oS$H4h#BE-_l?YHpXc7L9BX4e77(|r(S72`k=p`o1qQu0R|M6JFek*d3{wE z(gt|hEPSzE*QP253*E}997Wr!J9ppw4|g;SxlqvQ8R!a|IW^_MDZlX#NLx+X>|5b* zUUWQP)^*;1p`SWs)OWFSporza?$^!RtT*FfL>TjmEzxi}?Dd@eD^q1B=R4t@(~U+9 zY=k^SKFApb$+Utn~XY%meFX7m(^ zk;7AkD@@XZ0gkm3zR^Us$N;b%T{B6x_-K^2-}L|6DhsI(Qeq4E20tw^h@2ZJjN`g> zArVZ8{hpsc5AMi9RUj7ozM?N&G2{ZU(&LU=$c4f)3|1TRuYcQyO#TGDeCCIp8jj6N zyaBo;vDsSP7TWT^O$Zw7d;TBF3M#fvC#co~ck;b=r5)uD#tGwQu`7x)F=bcQ0Z1Dv z@xUt{8vJCy-6JNmQTI^espW%kKW(^Z$(|!trl+jwLv;QUI%;PdB;pXB4Mxi`s zvfK{n3<+MVUx_Tx8+T}@tyL27pResVoU^+871n)S-hN>|-uKtE^y*hOjj{7K zWHGFd$R{94R@F1$pl1zW%hx>~8<=ItJZ&HV{PA~I2RaF>`gtrd!+OcaEx_f4ME2(D z33yxh=kUh1{vF9_-llY%btjwJ*qw3^!}R3cKLOoGI#lh@8!_IPx#S-*J&DnFxJ0Rg z2X~a|Z9(xG`i#kj*O!a@m*LCRn@c-1kw(6NPBr`^%MH3fyx1iYT(TMfHC2e^hc0k8((JLT4{I%(=Ic|yQ|nP{Qs#FrV};C`sK>+k@V@Fj z5G$Nz6J{&uGp-f*Kx}ccKvg0VIRNqM&j42BRx-#Rxn$@hr^%U1R>2wiTrzb2s^$^v z!Cx$v1&v>}EeJa_upfw!#pKAH6O}2u5;CZA?NO40sY^>-QwWXC_>HQ9BI&OpJAR;K z-^}S!y#Y#ImS>v2TpRLz7E)w}noVBCbpQ51cKvJO5D+h^)t~d&6|hCgwom(wuY_qa zHxKd0-0JeQ*$?}R;`AreInnOAtyr*>Y-@rZ&@eo~bm&;V>^IxK5rEpe?y+^|9eO9ux(Av`=y;x;Cg{=@wPm&fg)3^ZR~XmoxB-N?-N8N9PIJ%k9z3t#c2jVdc<1vODI=w zuXFp=i#Ek(&K&O>3Ku23l(0m?RptVk^GCVdA!bwwf+ooo%kg;9-x{?Ma}tiz;{X8Y zg?JhZf8~;f3P+|Ml^nIOjM}LDNIHiA*+(a~FDT&Hp~m8|^s1T>vXRv%f{JCR)6cQ4uMPr%XFAK07eYSD)yyS*F-tua`;*W;nHKFmVg-n()7BzN zBfJ!6?=QgViYu~?Su^7H=IO?@uE}k5|xAvL>lv zpopZJ-@|ozWQG|dvhy|G1h4!i&g5|`)I~VRs%2!BT*L}%e~TJsI$Cp58#&~G@1~@9 zs5LuP%Dn^gzKpevdK-bwxL5?G?+2L9zb2AFz}jc!zQ91KSg}j9*Mb!nre*=qPK3r< z_~$><>(8uly2WRKLC;A{dv{P(j=tfwt1XLrj^bfq$TW-`I4x6%w^Vi%-ZOM%S6P84aK;%E(AxgDN~h=YPfpTjN92>Mk|9h>=vf4T5* z!C%nSGlJ|?T#_~jc-AcRaVNW<^urJoCSLuL2HoA%UDNewBfo+%f)JrYj1@x~VXd1c z%?R;4<6QWEo3o$#?=-I3aFta%Dp$v~>1f$W+s?}Ld|Vkd0SYn-Mi%J4o2Tal8V$Mt zZ`qbHbpM7wq*H@qyPSRNh5|P{q}ao)$SVdG4t95YF#jf@s{>gtlX9;o-Rkf7xDFah zyA#C=Bx-%f44Jpv`q~}=xED$8Nua9wgbTPK0l}D+t<9V!n%76m=gK+kP{BY=@On+) zeFNs3`^aSoQL1CCN?YP8XLoC*xm%wd0s>Yxcw6qC>%)EHD0j$IFK$^@ygGoUEsiHf z!ub)0(CK{i`cRuPXO_e1s>^N`StCj&KsLq!dq%I7pLt_5Q&s&xhQiy2>~|A9mlBF8 z_J$emUmckr8M{tSEHWS1S&SLX6nKaqX4nHYVo+xcLB6*=-nI#x6>nunjV8j$Shwn@ z_zU0kT3nnmz`C@I>GqU&$RB|(a%tuu&6Pb-GttS86R?C33w@gF^VCL~Hy3aF%i+e$ zSfhjLuAuaq0tTqpc%*|mq^!hho%PRY4>A;LY33AIGXK`)E; zLIz^D(bF~3z7lI{*}bTwZ}}z;RID`?DJtpDln^?@Z7v>D!8e8RG|j@dZTC_daoP?> zMuwH7%6%If_SCE^89(oyHH=?QL7&ul+2g~>T*sya$%{khAbZ5(&C^)_*9TdDbPkwc{zE-Tf$*1np07J>Gba9Q@w&n*Agb_!<&kHwKVnKE z*ljf2o**f;~~G&%Iup?ot~C5OMT0Ya)vF3t|HFnm=)0W z9k%5t&cs{Fi}p?e`2;x({+noC{wJjC&)EatH^BKs`V%bmM02kS=mZeN`@^JPzB{Bv z!MlaUzv}Ievz~YUUN&Lly$`hBGYe1TW>*U0z zY#yC^?Lp`m&%(E)WuEg%xV9m7S#nK?din`tx@z~a_CgtqXlG~ywZrCfOeDI7cfzg6 z@luFamE-u)Dss%wb@>CKe(B&f1g{ckx*%c`Xx({$?S#n`Rgr5mCRR#oUBf9fN)_oz zJHs2qVf#g^>w-6?3PbJ#6!XXaR%K#7LHfwXHe@C%4e<>Dk)Jc8y>0&4yfFm+_ZQpj zc`I!1=nCFBjf=lZr!?N+jJ7QJEdO2E-1-(eLleb~pDDFTU>hASRh-$~vkS}NHobBm;$>w*uD9Mw z*-X0lzQK^A=h=h@okvRfl#sHiLEnd$^Fe}Iy@Z*7>$>(A8N5*6th>fN+XzQK#ji+$ zUQCByl!P=eR>=MU4sE8XQ4o~3(%UR@Yh&*^m^*~Wuwu=lAUcAIdxX^Eas5ZvjO^?ARL=rzKMq0%tdp1@ZzG9Q-9$}tI6LO)~y41|dHErk@HgSmJE{pA8JVu4>1PbwOn0m!_; zV6x#FZ?}}3K8=8nzjv;6bJOPYD2Rc7K%{;ljF_8s_1jFIDpF}`o^x_G^X+1_Tu7G= zAkt$P|F*Gmxb%~#`nQB305OvSWI>u?fmfGvG_?7#MAWh*$2d;pU=s;lGuw>ZKu`uy z;93GI;Exxs@P74;!HPfBG1yul09FXUxm1zRJ{a+J`ny6(xTDkGV@J-P2Y?W!Noa$~ z_8PQjUj>eSe)G^toL;gJTIGbT+7NIIR-&abgMp*3GIDzc1*=nrlYe%HFbu%l_C16;X^8FUnn^n#cG}@ zZp&nWg)V#WP+Erg>d1iTzQQy2X^yYzbb;QEEvgSg*@eg5ad-U}mm=)g(8EZ^cUaeh zfj9OB(2dr+S@RlQ(gt?w@epox+C`MQ5xNL32m`fI6gRa7kDKURs(II-`B{87D#gc zm{eRci4sFWAi@GNIGl`R!qebd*RUDIL6(mgV+^^gKnU;^iu$QJaFgS^*~!K7vAwTL zN9l)I`Lp5oLVQL`&kL{#Bs;0tBPbbZ6sQht5R0IYB543hEo?5TR|R6#443rH{f1!k zmdFe|H*iuc9&V^9<28txpXY_IB>9=Dd?pQnsP`k+uozjd{*_&^PQ=nM9zP21sU+uV zTo?aWVrM9Cl0nh+BJQU?)yRYNYRkyV8kSQke^rl(eZU;X>lh$f@HKUih55uq2w1=m zfln!@PBXXjx6}cNGVa@bi?h;P6>W|=yBb?S&q0_f0I!6ue{fhFE#c?d$PYblCKUG% zP?t_RWLDrJYkc|Lnb3}1D3N<@jN17LuceiB6{4G{OwYhv95x7D@E%-cuAj6)*@)>C z&=lrGF6zj4%X3;J|A@8&Yg!0FpolIc>bF3+*CE|B=d!+}ordPozf;!4Q}2^png;@M znYmEphCXuCPxZE_;1{b75WVr8V(}k2^wdnq#4A)KmWg;M=|%HPu1JOBgsVtbH{NAq z^onF9N>t@@JjM)O7RFZx9TeT!0a}xmB{Jx#$2bPMj;=fh7i$E!G-M-DEo8evNLNzVqD&LW+0Q|p8#(zWYJT- z(KRf{cn8hH9xWiHfZDccB&49MW$%-xo%Zo=S=WI!iwyX~d#mk@-0JM0+y_CDvbRh* z=w7i@z4=Rb{+y2K2?8!vo%Jt4ggao7sky6U(zhnyF4_@vUOo47EN}!bX*9+ zbq(xELXdviVy9Cy5*n{E|D|(Vo42SZejwMRUc115(^}7(vDz`9u1Tuw)*PAEm_W>i z2~@DIM$oS!CDkLDQ(ZM?)W+ z%>yYgy%7=0-TOs6Mgs~(-nH2ObyFgeI1f&QyC4;N-)U1m4RuoY*@2=LgHQP749PGU zr9}R$K{|p0G=iDzcSnowV;C?ABm(Oj)Qx`?>Y#QktmO+59W(!6OWXt+?`wWunZ$7! zZL3l2guH*1pE3Kp`B>{BLdGK;58tQEVe{IRo#$((!j}FH644VC0c%L|YrieF_r#2< z7`ITCx2E;CTVKw0d>yOb!#9mIc{tpiL*5lF>*+CA!=UX0UJp^$OF(5u{sxcLR!s!s zF+sKn=_%3VOj8C$l5>WljxfzSN6Lu^vF}NpA4l|&*Xt~-_|T44+DhxJ_*LzwxdFds zD+tCFgVIOt+I=cT+>x;!?02ywnZg3sgh9F2U;6y+%s%trWMxNLKO36q^<~0-Y;`fs z$Qwl|4=txzPbxd{(cA>uNfb>d*Rbc%wBSgVcCRTWLC9G_KkAZFjIOEkmNp6By6~t(UUut9fM>w zz((?|g!d3VM|LcNOpY*Ipa1a(y+dNV;UhcZH!Na5)SqWC_t-7rd6zcE-+Q>vG2T*j zcv4BmV5XZZPaf9an$8=CWfr^o45LZ`ZlP&UEKbQ9&AvgM2CYx=P=9yVKqk)Z<2UbZ zt3;h$0`Z+qe@hER&Ir)=pspO(XZ%4^z~@66p_BmAD9=>XE)im=Kkym9S<@xLBIc@} z$_@xl9%5l*=5O_taPa>5Lp{Ziw1Z4Ka$6K-Fa7aY4@h6!Qhl`e2l{K{OQQ@W?tCbk zY4Kp*zwm+9SAhcFwdJtZ)^+E+?CKW9cVbMr&_M4_9t0ZOS zEmVBZHvT&-Uz(vh-!7CF5(Fo0fsEl9GcsbZ1r@G}|7LOH6oOX(y$6P$3NOrF)Iqbk zmAA}%!<(Bk1Z-wCY0N8`vVFQeo%hmotsY@+RadVYIj+pUP(QRlX?#OdTa2(QTq#}9 z;4<{->|q;gUrLuG5IQ|IVJ9611}_iQ{WbZ?O6o#+(H*8a;6@Y{R-!_v#sChkih#hCw(f!v ztan*J&Iy@0{pJ%IPd*btRHk{u72~4fs@_Xn;_?&l!+%V(dAe@8NXO-U=8G|V7)}B1 zN2Nh=gJ4xAvj{AK4w#k;FPbb;m`9S0Zo6~RL$^+V?(*G`)sH#Q2>UR2qdPGeN?DYJ;1ZdhV_AwcJ@*+7_8Yd^iniI(18)^219KM z*>+(d*0}Rs^r@VaH|nkZ+p~i#%|c}4enwg&+d!y ziz%yVm7D8%wK?viN9ySC!iI=hJr|DZ0Jm>6jOdTG;mMem>v*LIgJwg0E_IG14Y`!X z^73Xr{mWFwPApOQrA>VNcUjiGMVczEl0US->KGwM56X6C8BuQJvJ|1Q#&uJBo>2a zzr|@@BL*Uau{Ov19rBRpXSBrBple|v3GH#*h&)kMo+d|C4eFLqMid_GKG2omvOARI z!k9Vpu1B?V|BA|gY--={jF zmb^NP_|!+ScUbV>P7vkH;x5R|bZQm|S1*XglEYpr_Un1)cuh$e<0^QBlnJ|rD}Zy@ zXc`~}%hO;hp9<1~gYrS8i)dYsDaJG>&Y8A|qHVn>*^LaexPQx$hkEu^P9 zBpugh^=6{vRY;{7PyaNgwf-zfq{m>W?GgL%Heu! zz8I}FTOObF+Q`QeB`rX~E+>csYNaZ!2iVQYNa-cWmxBd0cq~Yd2nDDB2o6esTHQ`? zjb}_Vmz)$MyGCUpWx=Q)wy3rGT zqb|V0Oj@1Fh$-%d#M{bcpai%MYe{ujUxJC_wKv$x5VV883ofwNK61AZdq?7V3#N?s zixcd>LR=Fm`FZb~*I!#RTEWg-FR3RKz~!3rPw)%!cWC{vPpoWZW5)`wyt!^RU6Ou} z8ruHx5Lg47E0U4`ifC>p6oz>{0Ozv%$+O9YKY9pvayGD{6=Qjm zJ2gmfMVw!QYwY0hhCf9V*uWmijgFH21BvGyqY?^>q|J@^i(>?8s$ zOhPZ;$X#EL974seUo@8*ei%;YT!A)Ue4WofZyN-KIswBkF=Q#w$5VTz8){q$14*$J zr}%ZI&bdz^y+#jrDHks4WWS$|#JI z{SgjAse(BPYXlDNEmBLkAvPwpaq@ubGDO4~@OsQF$r<5#n7ODLB z5EOi`;r zUx)I#!1U;o^3pa-3c7g>ir)N`F;jZ}rd*xR5d#OxC^9^Y)XU@b}D! zYS2*)-~?~XnMU6O~agNUv?eOD2=0cn0r}nAiK^A z)`J=-k*MkrSFlObY(BwTd0oh~^^7Q~iKUlhabNCB^U-C@mtjN>h_=31={~D)njWT< za9-$yGgt%|)ggHCdZm-p3P9*fP;-a(6wGPb@M`&sEYtP!#9>C4$7zP%XEHY2noTA zJYQTV9mV0II0fg(*OOTg#s9fI97WF$)tuz%nOhv%TOHY1?6yIC>MAX-UfmCqhz0@Z z4H1wf)#Njsz*sg;2{F9)zohl~f!(9)Veu>7PP1iuxMVFL4rT6MTgx+S7j$C0z!Inq zn1$p-qZxU!qIP}0JDgJmg75}gurx#$&MH@lWexIy(W|UFQ+*hnwpj-O+QiS zyLb&-^KT+j-x;Tmc;P6j1UXHTq4*Ae(fKDEu{guu4Z?CF&r0e~h{!@E&APR!=Aldx z7`a?lW@!IHKWve(qel+W3DqtrXukMJ)wJ)#<^DAbmBo4U9?JC4KZBp!{Xk*Ak9-cI ziX2p@V)9awkKK1pB)~gy6O{_hAMAh&T*jNHHbGcireS)h*3RAu3~BnDX?kXRx!PVT zgG`1O(GX%U$^LE5Ctp3wDn~wMMNzH8Jb1FPd?{hnP;3dZN6-<-t^%7oUj>E=HwH*Y zFN~(Z;e*0joeain_2y4ZoGu!OL9NN8<2>n+nSY%5!$a*l#@~5-`ix%Vo9h&lHzRm> z2Y4AANHBs>j?b^s8b%aW%>P<2+7Nen`+|Z(UkbuKm{dg(s^ z;N!kXil8_^qJNw`t7qMKJ+ROei_mO>{zX6V=r{He%roTcC>-s~E-u@e`Dg}}8u@V! zB|*7?W=@#F({rG_6z=f`{=k0;*C8uS!%BQ94o6NlTxw9FI)G_q^`qZTE}kAh<>oI( z+UMgc^M|7Rtt}OY3`Vlnf?WOu9}HO7`Hxpil&taYGAkpwQ(ZnogPUE8S%sKd063kG zFXt1r;(eQrmkA$l3}xTnSZ=N+-UwO7zd5ve%@w-t4crAvMy!-6sq-PC(^v?TS+rwE z?}hD9kjD>rq>dI;Wm~foF++db?&=F`A-8il*Bv=s#qt7P4RK3d4ayxl)%p^!#TQ}~ zo6OH`fX3*MEuuyW`>bR32_yHRlUJyTpY_a6Cl9npjn)?`$7}ovmWh~7-=h7!cYYW9 z^r=EYaSi^(nzBh!UYr9p7sY%z)G)Te4@e77jBija?$OtWuoGsVAC8Bbt5v;wje)|rRqwnR6qPMByn(_P6+u~hW&Sy;DBWw`j_N(C~6>^Aba{|`N+X5P|q6>q}!Gi>wugN@Plq~#KSTu z2ck)!=Evj9=;WM@01<}tebStIzlIik>ALx9jUc$Ov;`fd(OM4>SRIIHg)A{5F5Zq5 z-}&^|t>v*Qwo94fIo#-Bj6`@N*Dd}Ml(dnQ;R+Hp7l~&PS~M_H0EoV0mQTR%ly)tZ za93%sc6e>0wCJ&9EBW3I{Q9S^?`;MckP*Ox_v8t>;jV%-4(O4~0kP_Hf?Km@&Vu$& zPif^!h|H4Uy(NZ`<`^^p#A)aQwV43Ax*>gA8J5Of`we#+CS$yAfmGdu@70UnX?R_2 z)Bx{1RIc*-86sZj7mRaoACb*S+0sSabz0`XwUY{VY%Uy!49+#wo#HKUc)-S(-qYeA z0JLXwZG8=ED7F(qfs>FVhYq<{+^FTjDY$#T=?JcVy5f%Lu1#b3No5QsK5W4&nw6g2 z*8oI7?!aof`RP~MhWpvXbV6WPlkhEXzMhvrYIR_z{a+k0>;J_OGqL`UKg>kH$i~jV z`riie|K^ApIT$#Z|Gyk@i>U^V)GBLaSJ#q2{r>I0Yq7mc*umYsP2heXju6EC-^u`= zlld;2+1YQe48K!TTm42$RaCC9T!`Gn${q%#txX}C zRI87;L8@9fxEHzKQ=-DcN-{xc1k^-zRA7J=OF$$ms!G3J)c`mAuNh0g$4dMkejh%d z-{Pr=3aAPz%1B1WFHK;7$bB#ur`E5f7r%BzZwBBm*&E`O>51K!Ixqk#XmoUNJ20?+ z@6Xd&-5lN1i`>~0Jge`mLQ8`Sc>5-&8W6uvP5^sfKgh9#`5U7w3iMtd^yeBdIyXpD?(1kfgy=0?xY zNywQH&yPxos$%ZHr{5aGpHF_&2MGW`R3|Uv=RN+JJ9)}u`xVz+|1mc0WZV7MC;QuF zEap}_tM{8e<432Cq5Tm7TtEPLWoR&d zSU#nx{ibF7rtyXEpWW)+0n#xyIDma8M>;(LylBnm`KJ#LK#T;aC0F{c8Q7{V(f`rM?}-WN&V4cmPWUm^r{aywcz~6~2F+ zCx6P)+N)w>y8n^Hmwsd)eTHJKscgBwsBip;SpEDe6~{L@HZe9oW9An$b{Bvws?9Ep z4R6-rzf8YXN%1)yum}QU!%}nOgR@`sahrL_rhf@{;;zOX=Wd=4%+KEN_rj=Tt8e^g zX93)5`*ix_G{4|);$Yu|vHA(fDk=(SMgI16zEew0&kpbYCrdm%3di8&#Pk?!{DlC_ zjE&u&bs@Y`DiGJV3}les*5v*!0m#wb`35w7owNUQO~K9WFZdRBK|eeIVi5m^-2jMT z@*|cF0QUY%ASVV8bhsCe*`NQ#{xPon34eG9z<}``!&iy%8`BN|L-s3JU5$T!MDmS0 zGyJwN`hyO`U^8?5qzVQQ_!Dq4l z4c_Rj(&*g6`r`~Wee;9(JTUunx8j{#-}VWvT?*d{=hwwA#f9Os?aC&=oYq$(^N+B; zy8asbYLJE#Aea8^GavY9&;ZYh(|)@9z(*VV6?owvM?L>a1Ne=7PmfsQ-yf6u(L5-c z*^}Mi!{}_^`W^aaWLop)ZE>(s`KU{aqs+eQUe? z{Ra36QPs)5t_i?OEya)fh zH9j!{ns4x?$xI4)j%!`_`K4Yt)|X$A{zlk*mpl#@?)Cy(K{Am$?^oo5aME!-eh zT!7=*rPyq_2&Kv@|J-Qs&e-mgy)aa1gABPf>MusVz?dF2u)e@HGLvJ+g8Q(uJ)|i5 zT&Qckukygv;e6oigH(~$-d9qh9a)cx<;(@nR4hf^BSz^te2v3g(xyK$D}1y{*8>zQ zMY$b%$J1y;^I?=|5srYIjdbnn*FtTNJ_E-1yA$_F<%Ydwcr3SZ`O>S2`JAk`@NxqB#){zoOj8oG%3JjW$hO`^s1~+jptEq z*Hsp{Acayg=wTgqvOE`zC@nQj_z3BBYJ4}kRre4%BxQZ8A?vk3#LrT|Ij$=A0h%3W zJ<9gQaE7N#NlS~1@0Z60(hX`dIV2Yp+t@xtOu-v|;%MG^SbN=4c5gacJzlCX<+_!o zeF-O@!ImWA8|r5`>PhZFE*(CuPvU>y@;UC1NzsB+!C!Y z+)tbPy5(Y2=(Yw~038eCeFz%a65@m=8pR&WB->MV*~}ox*AoJlZ9&GN}2j9 z+upQuKp0e`EBF-7Wyv#x3CMbk(M8l)PxyuWyiFcPSgYxUP7@)lF>1sWF9iTi=Y&9= zc`X|;A&(MjCbT?nB_p=U5m8LXK%}0D_)!?e8zG25u+1)7aj-6dE zJ|QWkP|?E=RTB2q!Qa(v^3^p?gII!tNu$7drc__V5j=iub-46cceF<;70f6zzeiR; z*A2#c>jStx)eAuL3c5rO-0iA{9~$`;nP0Gs2OORZ?T<@#s|W5iY&a)VFJek5Ypvvn zFXz9e?k_U<^lU{Fq#BPIgoISSo%4C7l*!N{|DV#`DH(8ZGl*QhvU<`uDwf#vLt0kS zUg2!QziP?5c-v8c>MDx$C3b1h%Rx1x5OC5+bBA)*t?iX<+H)hD0)@&eMii-O<|!(H z#OlR5B=NF3+qYfusiACNuv*`h`H;2(^fyBLwn;OU7#2u0|B|7^j*N~a^<+G{XhCev z6O`R+xZhLLjaPyn@dbmBpdkWow3e?qjMW2ab`Sf`ob3%o3sG4FF?r-H7R!oRWSLnv z&Qu@z_Y{>i<&E<+Pu`602Cz2X=aOsxCL3L_Sf1Zxl`L*Ig#;pW9v{-wLu^nFZy{_i;b0do@v(v>`b z=uFd^aFsy5L5nJIs8J`jVOSVBVoHw9W|4+b?m<}N9<$u8a|`#Kp;;soiaCAx>yeiA&*5KFwra|2{`Mh)4n2zk7LCQ zV?yI0VBK3Zg;(dcmM_my9LwwxP38iWg(roTHY#KAoa7N#lOKpN`rB=cuA~bsB&`0N zi|^$FR;=H_c4EgO)tEp{k*C?o2=XkAmwv)s+9(6;YJO8CfdcRXXDEehWMqy|ymhi! zc`5$`Zz_VdxEdta3GaDJqhzb^tZf{OyHrA!Y~er`g(WNgVO#^y)*t8SsPDS5LyF*6 zhd&i#dJ?Yry+{DL@E{+fdGv1uvj% z|Avn5ebVhOIMTkV*)U7fHg=Y8G)Ohn6rFPW=awI+QNY|$AM6vJsP%2FyPKUR!O5b@(dTLiGulEfT$6s+tHLJOuv*I&%J-W+w3}eAWft9RNr@Qhhwb{|&+a zJarbSQq`t;MRJZt$ny=VJ;1o*(TqwcnIKU1NRX-}lz`6KYxh3#9~0DhEUrT}Sv;5US65w) zB-Ty?X%z3T(I3MSoxw6y{kv)OpIEE{2Aowx9$BM>UUxDD$hOcSM9T#0Q;Qi@J5Q+! zm%I_l*qApcP`$3foR)CM4%y#L(SM`0OE;x1acE=9prd8%V7VmK=!EV)TUYml-lXzd z@Hk$*BL|*IwGpfI>)_LH{Wn86n@rmpWd4($biZ1`udkMZ=JWpzq-3= z^C zAfH9s(NY@`Y)L)21j$;hMD8#nXgI9OJrHhW)?K z9o;!TILNmkt?ri0>xxIkl+s1wC)ESPJ=uz#ns8%f}{feXWVMBt+4vz}mKX^sptteqaQzTqD7WHy}k`shjx&z=j#Xu%kg{X}VAFzF1%{;}TJ8~~virpnpyHkdQ?9$oz(SvULN6H3q;9xdUavdaA2@u)l z>*)5SV_O7|m#=kPQfqFyncF|KaF0&@*s4b$XT^IU1&vVih;5Ql+p3A??k}6c9n{~h z2Mh?=VNq`=4}v9))3jxAVqA!xe(Xd)li9aJ&5RF75FH_+tS>PSqm2RB8GyAbmn#p~ zepB_^1)ckP@Vx>Ndi3E;(GC34-7CDh?Skvdz{koEKb9y- zzBQaYaJE4t$VhE7PTMiM#m5qrsPeynBG+7E`8DFx1*16W#|v|JDQQkmqc4)5e5gx- ziBEEuINN!PIV!6l^OK*@#xw04sDr!=z}b6G_a8sT?Wtu31;DGs`ZotUiND_wWNauf z2L*s(C_{o?_mO|{nZF&KUA{08G9)S8eaF6j={C>A&QXMWrtSqUHc8C>tvD;>#Ig$6 z9TXDcoHOcq%CxWd$p&RNTh$)>&2-jw~33fb$>1XsQ4 z>_tWFwHT&zN}W1i-QKUfrgzWF(E1H-qH2**GO@zw5Y5sIU@}fM=~Dv!l3*Q%o00Q_ z!8Kn(D)JUpx^Vs?R(5{TSDwTWP+SbjYk1dw0p-&LvaGGI9*?UYBe_p2V&)dgu3*hF z1MdlAxE6dvy@AfNWMHP1i-ziuz#!OS7zvD;CsT)XINH!6G^L-bpY|1fu!ltC!sM$e z1KqGa!!Nyv&xDt3?y+j1!*o%CaO3|6x-Bm14h?V`X7SRdbe`}ILJuO>bgN|Sa`vnQ z1T#lcI4T-O6Jc6n`c1aC2FL?&HCo0q@v71abgb_0gCBUupERH;0ir|!m*5%sPSHKLWj%jvgEH|4!f9a+cly} z$N!kkSlm^7A&Rm=0AeGSORZ?#Hsy$<#wy~49TYq@mP7a){~XyMSt*132xSm}i!2~Pss6@mTDqP)pCMT@@QPf#}lf4u| zT3CvH515A?5g4oSw{b7$YP(dvF~w(}uS zR09^Zq_VvkQiOX_mhCZws+=r>O=d114s>XXM6 zgG4wYhbLR-2}Ob=4^>_b`^K3=Si%?rZro5N2@R%bto15@#_&!7uJz zFbW*zJeEi1g%%y2Gf`hsQ6|b_SF?1Ke<=zIM*;N|ifqAT%_r2c@k%PZ2dehW_(Q8= zp))?Aj|}JOk=suU26Uj|QPA@Q4?f+<-ZAuc339lg^Qg2x&?9f_sYSO_xxIZ{DP-ym z&bWbtd3Srwr!n@A?#2vuZaxZ5eiET;10&gJ(>up~1S?dkyIk{fR<32wRR^%Lp&H)O>W{t=~ zt@_(yz5=H{aPeraVEd$6UatpPvgdRP6#PBb_Y&t1%!Kz&VCC@wXJK>8wM=IJ47z4b z6E`c)W=bVk$}}Gd3`w7uiUfZKn(C0p3=J4A`Rrwft$W*hT0nj`C#u5Vl}28Gi064F zTA97@e4ZSmhNFT@v)V1TI;FX-r;ej~erSt!SnkHKv_cA0n~A+Fank4iRL%zr zCM?sw0ELF=6?AOq$g=wWddd=XYF9aw;^;QMLdE}$EQoj}BvOaEF{(;|my`-3947#` z3rB7rk5E$Clu4@RT7R5zP1nf9mmZ*MA{Rw3h7PQ?Ux-7qY?L_n`d~4Z;S~#6amK{| zjf=8aDn>nZ#}=a*o4tP@U}Qy!f>hKE0+`m?f$QF&Ndrp5XVua^WObIkHmDuHJyQ%H z+P#a?8anv+QG;0NX(-GA0aoygO#zea(>e>M4(1cICzPOGu8&is``bDwBojRYHZps@*Duf9h8w+1at>g#Cpd{Wv8#a1#}0YEqoW$W4& zLPkO^@I;3B;zWTKp_Kh!j&&g;3ZbUCD`-QMAPe%I4@g(l$px zVo49xpgS&3ODrM0-M7dvgg@`K3TS<=QQQgcW(mF|J)#dUok>@WP(RG`bkw1gvx`*W zjM=sMr5^K-2I_g={YFAJj;-E?UuaE0_yf=&FN;+2ixkrdq_*(Q8FYqE`HVndo?|K_V_XCun~>VS&mX)q2`Q20|VN6{(03C*xg z(@#xnuN%EikU{ZKa>v6sp##KKa&GrX>~tb2S8(4HfApF(Ru z7hf5LY{zLL7FB^UD!N3!#3y_UA?1j5Z{wALfAv30%C8pX9XYByieG{$-&Um2usGS-2XiTu%sN=bueVZHkVUJb=uhS>OV5)+iwbeQ zeUU`MRPzQF2hApyPA&*0SwJ}Y@J;o1ZmToMJOok8>)E_FkhqZC!=xrqK%FBCsKDkeF0i4k(W`VT4N%gBIjML*7Cyxm2C}=UNd+)!0 zlHb)I<4-Y3n&rN;Kge-;B0o=yHK8~$Ow6Uf&B43IlFLK`L!IhYaQ+f2X|ET6chU!g zesdW#xJtLyjT|Mhopc0@x4UI_$&}DO9yQPq#OF>rP$x?Zf^|_W1TO%~Pq}+8fo!&q zSVE=To%TiVM$_B^pH`jK@K9#BljrF!Dy++igSyd(B$_Ff);`E`83BX&e*vx$HPR_+ zEG+442k9PCylhJX#tEC|wJ;@E1&R*?Ubx=GL9Nchn)3%?N%?>wq3Y%z5nVjv>je74 z>L&n$#3ps)i=a1~yepIxUT=JalQ1vp%D5r$ahj}FRN3^l+IAPW;MfGe#fXldCd}eB zZWcnOTsU0B^w81UTi2Uk-pX%9O7MlW2V3}MEOO8ME@vVB$i(vHx94m+=F#5Q1l9wl zR&GGvZ5L?8cf-S!`OER2bw39W0{VQ&z?w`^H9mBBX}(DrF(81V5y?dBr~!C7lu#zm zrXCgW(U{^9no4CUxRhA+j z2p530LL3swN=cm6EHM_}J;u~Nb5)lYYF@*XzqTE@op6h)xrs zsn9^A$tTDR;G6|ni8cqr4-!{2;QMB@6zcxs>HoCTyDL>7Y4K>m- zHyihA*8=B}&pq;?SVqH9+C)in#nY?5dQ~_n#d&>fMgjeP8bg_j@va1EEuS1*k1qp* z&Y2HAX|3xnBM~2h`#KVONjALQ=R4((0P%?#JUsOFQFUyOgPN4=gH{&7V#5OB1^_2hsp|7RxQp%SDwi;QL_B<}Mi z_33wBye=i+58QN>X~{yg>@QOLmZ`Kk$9w?|wcRyFQmH1BtY=xfZ*w!3Ml5sXCjik)s9E#3C`q*aeRVn_VOhIg- zTEwsow3GPFEUQBpLdRDR+f-iLV;7Y7L?Cr^!B{cMqHH{FqUhQDNcS4hJWS&z%v;eS@ zd`1O5P!=uwUpMy0BIlzMj7^Hou+JO2YCM_0DK48!`oCmOO(3)V4K8%S7pR%IE9e0zGu8J$|e z7^(TnSApXyhoBGW9&{#5tOef|i*wqxWfDuSfGqRUi6VM2?9d+#22Z_3e9V3ZQHN7( zNSkq5CsKO0DFVVC9<=vaze*lq{cX=O7vKTa794lXjkk7lMFA6)AlBKgQY+kj6wEmM zutP1pl0v-)Xj+Jt0X}5nhT^GM=)2O=5yC+~}FB_NKQEBJ6ZT&wKjmfU;Juq^33+raivS6*OU*thC3)HTDeWco%wYPQh5c zog^A;IKVq-nBwWXa6rbGa=^cy-?fS~{pJV%2he-WjTu}&#VAaF?I``{OgL|%A#NTabs%l!3N|7eSq~&S~ zk-m;ddGN*&y1O^#asde1AwaT$BOCL=pS@&cDo3+WBubOiyPf1dP%)R*HOaphs38Rj zBCC?#0WP`avZQh$?BZqhRj5ZVGV;nJoUI&33vcmb-gOdNw7Nouu-Mrxpz_ zkQgxqvel$YJq4?iaBHs40QW(ZCDoM;>y!>HWDv8qz)XOr8ura>Ok*mNyg%<%=uGBL zgC#T*1F6f=C)Ge?D!`xLuFseS!!5%Vg?#09gtb`s&VN;Y#xbGw;A661$SlO*M1T`^`^(Ydb&2w<>KmE_V+=ExuMV-<`tQ|C_b<+C*9ff&mRRM!c}5d%-p$dCnXbRC^X`4SIQP4W378mBIEjPF^WH5N8|kee?6s^$gK zJ|^DB?)_d~-ix!8oN`5*&<@R`v|o~yuJY)2P$s&zwe{!-9aa&QWx<+jng$5Rz{>U< zO1n&6HMnW@P(n`CoVp~KVNgL-ScEXh_jT!hX}r4T)- z3}NbcyPaBt?-YjKU_=vmw<$xV9rmet7t>z-RNYUd?$QHJH`tHw*4z`vVcvYH_M4@q zpxLBFR5?4IZ2uiz@xp=`bt~jG=mO1kJ*u}WS;W_49}*jbbl zN4MZIvuI7zHhtM8eRRb{33i0hBR0_IWDm50W_^7_9HJL7^Nk|9X2Ah#D!xuH0 z>?_=74i|GlY7uS-MF#yEr4RdCl0t<;SsHpfs3^48a^T3$uOxpu#>%{U^tkuGX6d_VZZ-| zLKoUD5i$eqe%-?=20#jQNK87j@)OCPLGc9JdEPsi4At=0-1R1%m~aN5R=d*-UDHnK;IV{_RH3?$n%>R9Uxk9VxV}MVls?`T9l!hb5Y9cQkftS{k!} znM=r^j*p!hNKiMjtAxEyao~r; z0!OLR<$)$wWEHMaZ>da_pM z6+VknL&%{v@qfc$CCwk1dCn=j+hRSvNq0ir2Xq{vU$>}WwZDs_*&$Vf)qkLzMUXh+ z!1Of>h2&;jBI3TQ&OiKySA?2fw=c&)@WvzvS-aC-ZG@%$VX++rg0nDz3rh<$idotR zLsOGL>Ls;hFqY$l;wY(ut|3LbPYFFUbb zim0S6$wm1myV&g_DdZC*NGLjbC4Ax!eG?AJ8@Bx>1_}eIR<~dSrHiY2?rE zaPB?qFf+P8wQ7sj_6u)|AG+t4iAOJX+2*o5GF*It5j@NYFai7XFda2 ztvSmV`){?EgYM_h7PPz3Opb17j*!HQ#wu^xDO80wVa2}?%UU0`r~IBy^tHj1Wz!RC zoz0s;UtEZn$ZX}T8z`(mk#2n??`3z{pq+^`C#S@_5zQQ^Sux7n#44w@Y(gT49K~#? z(@0{+JPaPN=L4gMK~eqTjcu;#6$gIze3^21t@=;%>z6L`(JHoUtqA=WuUKmZ4JGbA z$LMVOXG<71vYn+c8@4*%%4h6CsJCR^VZGjAaq}eOSO|PAOpE^geJ5E%k(x)HyrS>&oe<>{Jf%W;_pU z0|}sz7tS0LT6#ZZBjTkGum?RtHB%~~EmQ~lPCRWQUPj%CDXjEid4+WzEhOhxAS%Cu zM6s^>UX`o=s!diV1c;4UZ_?LoYCwTDxUqp}&RK@bUbLWh|H8ye;iq(4DJi77b>R3wzVrjHZ^oT)A~M zH;S^jq5>HYK2^{o~(}N9|rGuP=xqd?TXQI4iL?zWuEyrz>Q; zs7J08N{;4GdEF&1gf|-{kDnL|oT-eePgA?RrG>dpn^GbMlcBU|E3EMRX55%LW?u@! zANe`6^IgkHr?hrvP-_7}KQgL+S_Qkow)`ir1m#k=%!(s-PfN0rlLhNRN@eXo@E19I zM<*Ue-Isg!!9b%mZBXjbKuotz3JF|IP_2tF`a;F~l~JSA7` ziyT8U*%Qjn?^Nd6?Xx8!Bqtbn$X{{DhOs8kMN*mjYkI7AAXA;STL-JSb^Yzp zJ3E4Js26UH`Qbd_ka=@By~z^tUWfq*#@%HjeCJptKjdWqPX73aa3L_yV7iz{kBfq$ zG1uJOO~v&KUl#LnDjtK(eVOX|>Iks;mixxfHwf>p5#5X<@bukO7}6#OF_um$1)@7z zD)J=gn18>c-S%#~f_ zX!+PDNTV-VHda+A-(ZZ8jLX2RKD7@J^&R=Gf@he?b#LYJv45Gp{8GBIUxeORsgl97 z=cz-cMw|%6C(le>W0f>Y`N;mTgkm0Jo5PY$Av7)#()C z+CZPbaLh|VUBHJuf+YS}=e@m%mP6W3;r2(U$vC>oiakW>XCm=@IsW!D|Z z`5p*iNCL-kT^pxwz4N%NHjvCgW|yK^e~rBTMUkPQX>WYUHkL8v&Ej-ni@hSoS}mVg zd~izNi6>6FTmAz!X0=g{KXiQhn&^m-l69?~jb@e)cele)73&=`KHlQZvTy6u0v3Ti zm5^1}&Dv&@aim9uwYzNAQtPaU)*nuk@OW_Ntk%&Ja z9HbSdYyIy$K`-Ul9&^bZ#me{~pe$$LMuSN(JZCX3!R=TxtSF^|3%_o`8-3I-Bju3s zf{;z)I{TLJ0B{K^9dR06bXj{rO(;|&;;2JMfm=!y1sTsUi)c&?;3$9iI#7csR0r>ZMH4{2K?-|FM6RP#c$c>LmYkS@JD zwZEYK!#Kk$9Z}ISZe;>N_v7h7U-ww;kmRdCFW7%;7 z3vw{FcYP%jZR8YkgRgoU&Rw1Ef~lacX|F#^{I-a@QPw4gDQ?e42OG_8E-j;czlMpn zYU_Y9p2@?OqPt!=abrLqWG7x1@sx{MLnRT70q9i2Nj?HJ%%_~$2;zQAHw0I<4885Z zYj#)=J^`}fv{{`kPPCnIq2MJ8uTwZ|i_m9I5U<%j3$?R)pmoa@dZJx~x4SSO@blH?^5uc*yrISLm*JO~2pHd&O=Xud1q%n^Fs_o8vGA0GvME26gYW z>OI)97NIpnI#3Z|`lE<5O4??06RB*42pQ&2E@R3ym5tz?_sSaFp(fkMh>$g*E{rRl z+9s-M7P^Q)sYfN%4+HrZG+P11AQP7f>%}AD2m@k$U4dcg9h!gnQMO_X@TU?s-i0~A zC=qG=&=0407AodMn+bjswJleT237g%quQoI{|0MUB|bD_x|Vb{qE0S$gNA#vXLPld z!w^2nw{avtJZF}@FKQk4=C82{SM~>U`;olJBzp}MY+$g1kEJQBcQM14BH=4*5WpaZ z$p%*4yCb$p+g(!ZD{t|P%^tyERZgw^h4u0s_jCKFw_9p&sm$j88Ck!M2C7)1{%Iyu zEd}Wp4*x8-srgF)-!oyjUHC3)!WB+sNbOE>AEO^^>7j2B3GKT~Tyn>*Q=9Ys5|+8W zl#ACyNP_Lk4F<{{6IGqRfURq47^_bsT-Z5gp1^4TVnw!7n9>Y|5&>mXyBhof{Km=h z=j`z?MTt@Q4m|_Wy+z=S_6h^LKJBCVEJ}SlAM5(JCLqN|JCv)w%tUaJo))Pj64@F$ zJyYJ%ds#mr`>}l)5;vv^Vyml9W=g?OZSj6KB7FKBy+NZRXe9VP& zQOI2e8FZ6#j+?Mh`5HZ`bnPjPFw{X-T4W*D!Y&77FCeLpSs$;_b(PDb>B|Wp_DLB? zOYX1j<)Oxu4BiG?ma8$vPC(Jp^!NfTypsOhS*YJJzYNOuc|;ovOysGxg-3G__zMy*hL3G7~LSQqYDhm zefjaAv$bYdB z5vTtg-6WQrnaUo%KbncKV29PvL?m@6B$T+BBy)Yf)g?c2a>K=F`5^5Uu7MKc9%B)OsVyk(`DrgyJC^W2mgU~F(rlF)~<|z00#!k z9k%QG9{H3~{UcSkRz8B8TrW3Rm>-y?WZf-cGpnjtB$Z7!FaM#UD+kdL%9vF1Ogz5fjCZJHjqj|f z77SvYp8>a}p+dP%qZRUeVgCw;FjMI)b_^w13Oo!sdiFcF_ahI%uoF$&atSm^dH&nm6q{!%V+igq+X$_b2ZL%4HI^aLcGMcr$s5 zUQ#e3D&=KQjgU1&PU+9o!hCmsEn?u~ zyT#3^l7cw(&`7S@tWV32U%@I4eTy2AOk%398C4Yn<$4SXDWN}Ra_fmL5`!Pw1-EZB z&@RRZQl9QG-3Z&g2)s?Bg_@TQ++~b}4Zexc{n$S}SB?;GIW#XOrCteked9|sK(oyV zR=(Yk<4MA6w1nK(X~bP^K=H-mDO@7hF5@j?c%E1ckV=t3rGz&5mp-S*`E`>_<tULN5C@K(HDHP;rI_`i?A{Mu;k~|cQk3}wn zDZU+tPpHQC|54u0WolGU$WjCWKzV>x8d6 z10mR<4afBYDmUMG5iY%gjht(F``W5UU1X0%zS5gG?K_-2h;eTamO{e5UPxLFjjd5N z#NKBci$k?G`7a*G&+WR%CLaH`q@gb7=M%sE_^mM_COhUEey0Kx!6vwsdCul9M()~0 zr(FzHvkHlF8d!&ajJVPkA^v287Jfa)NB@pu<85oNy-bDX&&uG!R#|72b*oE5G8`ksG> z%0UqLL@3SwdI>W;Qi`7UmoIhNUPhj(?%&AwDxohqDgV0FE)leC?ojN-M&@C1U%gOb zkIt=S9Nv2(v1Oq9enfX3wTRQDs3zL%{L8bcuLFM@pobo~Cl5QA!&r$Oj{>W*p;+>B zaN5F*fxopKJ4!AsKci6= zI}TB>;1Kb5|NboxJuj^mhHSfTk^GCQF>!}@Lyuy6d$CUF+8>v`;9_ox;r>}zLiw>6 zt#Sk0{P9j2X1?HCE5VDjPX_8jb3+F&n6@0!Uy*VBX+n*Eiq8pYN$myjH|a~)^D1Z~ z@Z!rSEnd?vV658&#EVggPkVhDj!$X#;=~_0NeV%(tUlqlw?A;T1}cm~=}yc?pNW<& zT}Hs0zGt6OYmVMm3%kI&XYux4U!W#1eaBO@-jVQnD5EIqc2{rKfw?2>vv(kK(UMm! zi270MdWOU8&D(91^)fA;mc~n0hkOKB<8`}l&LgDEfU+-KP{|qk!!+REgmRHMxa!5#<1u^gIkKUKM5=jX4}c>uQX) zjod7)R0hr?tQ1ezcmFWsF>+lrH%4=_)q=tze%K6*g099TwRa1&_tpJz zqpTWKH#-O{aO&`E=@$3*2zr2Hel6T(wR3`!YJwzC+k|~-Sjm?Zh^lqrvI1KCT+Mh3 z>+C<^iPG;a=>|2Kp`4A2I3f3qk#1YjPt0w~){H)y7N37&bdU2;Dc+BjjHw+Z?pk!py9Xn{+@m9v z?8_$QU|;071yc+iv5k#fnc%J<(KVDr;owZ}^O@`%mA)YRF2FD7u+oP1hvKO1o%c@2 zndoUN`mvNz&R}!*6U8M``VX58ZYvmwz>U0Osv@LLPkW4BhA6)%*C`#BLKnhP+`NV= zfwSKOpV_=4D%NE@wggiK7{LV&>k z>8f8{IoDy=1b~6XJPy&ukx$cbKSHR6BD6*aB<5}8V}O&|e{rP>nvUrqD@p^eedVOh~juYPmeaPO%P!6fcPXh z-sl34KZ(u2r+;RsobZj$MCU;QzB>iTm0+Zu;lk)C&1i~JrIkO<1%zEQa#8%@r zha_)tp=E3vNoy$`_&y)(8(rrd#d0#7ak>U=t2Bb;y>1&T8B5BV#x0FEg2uYb(1Kl< z=o;o-Q7TpWceGA?p4c3pVxAX*xVlX<{p>X0#1yG`%sV~*Kr&^6NJEm_ zrst+3pC;lpFHmPbKhWw99C2M*g+b{XpJM79U+rczG)huLAX9f2dlhKX2=ycZJ`Cc@ zr7$4AHK4Hx0;bxtn++^U=`7q!{3ZDjG6By%mrQI)=o8O7I}C@&o@MlP@mLlu zedr5N9!pwLM514+UEB}$HPL4x%nsfolz+5;Tb#l$gy;L_jX914wiaI8Z7e0#rD5vz zS?;B@OJXv!w}Qc9+yuLEn>4?Iz|U>Gy3sR+W)XJAEh@+&^4GGTLwSaL)N-6ga$zOP zem8O$A{bNLDOfi|ZwRrY9`sy$ZC7=SbiBt+WOt8e_WzNLxE9#&2oBAJt&@=2U^aAC z87Nm;6HH(Ak90#QP?BCoF5tuLSQcloG)wVJ6R7{ou0BeFoaDh8G|%+BUC6!GBz_L486Nfdj! zXY9T)#?UDzyOLL9qU)zs9RBQY;;4emOZUdWwnG)N@?R!UZqa(p7XrIY=mvc&eRbdv zi-boe-`N4wNwcqGX5m-2z@=hwz(5lYMPlSsiH9Vs=QKxXb5CaIb5wTtpmDfTY042J z_3DILP&O1k!=nX?38QzWd`Br>A9$|iz(@aq>oHbSuR7Q-vEICu6FULLiXPV&Rr9Qj zn9wXyXW+K7A8F?3JvBhR8mt`4KGjG*Yq@Ne5dT!SCMg%avGn;*=CD2nYxjFslI+om zt0MZV?CoFxKjmjBskOMR5m=Dv{(L}FerwR3Q1iM^b)}i2AihoZj(Xxvun&BnT5;y= zCjuqZ@{6C}Bt-H!{neCDm}D9?VuC_8CzZkCu~GEs$e~u zY`G500)v2&HgMgx)m9)_R0` zRSW-uon3GBQSkyzg_-ef@hg6wk2@WhMDhHe+(}FVSbkU?*S{}f$P16}e()S5Q{fi; z2qN7`jX>eEth{Xd7JLG|hI|0lz^5;H^wUq3+D!N?P`|hQ_O~4VZ8k}G&A$`el&&8T zU_tD!)7_cho7d_G34i|8HkI;JHz-?~5JwE+t#jH<*-^@yZJnPtH2!`2<0BoZzJ7W5 zTXhq8rs&_OxSjWV7sO;>WU!0+`Bk|Tv+0-Xiox@*^oomu-Q$2bx`rQl?RbS}=iUqc z12;8R={XoY>?qcL_2=$>*IM@NaX`xAv2_1Ka>>**X2DH09>J^a*f`h)Sqo1Qo@hs1 z)(D>dZ#@s+GLLTWh*V5n2puN!VZ%?iF;^eNeB2ohS1wv75(Srn5xQ zQb8PU{-()Ojn8-U34Pxuoc#eNPTC+)t5n7@p=jetI=iZGOZvC~BRQ zo03?RWM*S&&ouKv!C>BGzEd6hC$A3&=S`)-;-YPK0UE<5j@@vyf$Yf9&xV=~ zN6=}SQGN$v8hW?_d%@|9O=OTdm`pZROXt+X`R*7OSRQM%9n>e>FzUKcB{Z2LsIY`- z4rrczl-hTb?s_r}d`F>Y+uK;qEx^)ajySSVvVxp~ACEq$m*Ja|@A8V0wm@jQ1+jF& zs z>hYspLVzPWuy16X;+;1S-L#2~=9H&!{32#{9(!4b3T85s60rO@$h{FuKE-&_%^G-b zpe@d%>_CS$b<3nRR}w%jI)iJwT-03{Ykm>H>It5KO6=aT>oAh(yRnK8y>v?obe&43 z3=i`cnsQoPJ^5>9x5u)q+J^Z96vaFzf2!%|SGsZ4=wrj*x^kHyK=A)VV#W6Snx z+FRnzzNpqcyclEj``XMxb+WTaN2$PPp`t*|`YnWmsf_X22`oFQ+4Q^SH-smpMBpiZ z5}}NEi!Xi~CvGxKL?R|jzQv>gb8Fp8q>46Z?!@pS5KnbNy!qk-$4zEmtx;9w6_rw& z;b?`;tmkz$HY-mLGBq~Lfhk>OIKk+VF7DC1bN>@h|CsHs1-r6h@+i&AwL-3g_F$A< zqiM}gT-CBez6dQlP6`vd{+j1IpAR`G)^V@;>e!SyesShg2*AryFTfug;!#FD!0cKZ zs=S8Kus(2a@`D z`a3=gVXg47E-ilk!s}LY3-{-(V5S>6d*99boS`8+(8k2k$pL6+{hySr5eS}@h2wu= z$x(5$0}?aI8-bLatl^pDh?xNZcqTCm2S+DjF7E%yn?uaX4B+~I$Z?4OQ)}e}bRcFD zvodr7iU5smO@QzM0`UKR6xWq=ZA-`1Cbah|eZREVqAXs@P)<9lSzO*QbWXX`(?Urb z*6c{qS&ko?4%FN+A1@wQx#UX7DN1V((o|Sb;0OkfXUkB;EW&ijta${p!8A0QBiH+B zcK$R;tQHLD&_FO62vpBNIGMwi=5Pxqbga%_8wCPl+Z(v1nZsPsnx%kf6FDwV%Yz^h z4}%Q@ooYZTPFl8735HfaG@j%>vHy0FxCg8ZwME)EJAA6+8lz)U+@0L}DXhZxwdEABtKSTVf55;!au^K|GTsc&SW z7pZ}wN;uTePld2Gva=dOcNjhKqXjUDDe1&>cVLuK1?|0oqq!+T`+KP%%Z;Hpn=;kVxBdVCsZ@yTG-zE-8~)gXvj%eo>#3m_ZW&mPVB@U6{FF`S7LJH@R$Ixw$!;Z9fEaQW zy#hzIg(`*14)V44wE_e}r~hK35&^{#@vmiCj+0Nz_jF!;d+F)Sts6igMJ8?@xB?g5 z5=z95_Y|kcz!OnG+x0UR`BsBYPS*cVor@N#%+ZAY1>uUIiu4Aa$my~-fY4`Pqt7q2 zM|o)T?NS|}35>2$CmGATJ96RTJAJ?E&+4-?$J&}ozS?$W10oXwyd{SEGMCO3!p#-i z@(ld0odWdU3h|KjFq9vXuM@;WBD?9kWR^X9QuJ-%+3uJk2z^3(Bc`3eUm=_?uV;-| zx+v%=9vB`m|QZd6s2y>{Ber>*e~C!YT^TLWjpmioFnM{>2afe8vi< zZtO#$Z~=zKuj9@nS570b6a+5IYCJ{GcvBfx@Ms=UM?eA4P3vvbFLE)7bJiO=TrQ&> z%A;9$c}H!wsoO=VtI;`vuM*b-8`(AO+6n+F*uB5ehXhFL$NGH4M=WYj{??RJId7~d zSTC<|YZ3o&!B~*6!xA|orx(uN7jl6w;22<#FKM~(LEkWivaM{}u3U%Ta7XC4$Lr`E zjfDMjU_?$sSZA3&*qa?uY!^1aQH6b1zZ^EOy`65|-9m4_Y(1##35MKOm*r=FC( z2Z(l{VSHKBy}mWtFN~3A<@J#MGE3o`$}DzF8&e@9e%yI@$1uLxb-44p6m&%~+jteW`@nOQM2{Jc^Jv5 zD5qv7K5Mg$wAF%*E(4OFkB?kkIj=gMOB7@K;Meiys{R4itMqj`SlERKXlxP*T;Nu2m>2`Z}@rz{Q%Zy&CCogLsh>>+L#Xt98A_!LIwGQKgtr zd47SvxZrA&#heXq)Bg~DohqG}-%vu<%2{UaY3;8tIEE$H?}10JVE$pqB9G5d4c(;( zVbe+gE5)zgitf{rLLO}MQHpW8PnB%05~JHvSX}z4zFjJYTC#!Q-xaL9jaL&qTh9;R z6(Vp(Zv83$qY~BajTDv0>y!`fPn~!yjwxo^i6rR@k1V~2NbUluo~~S=#*$77+Izu3 z1?618pONyho=C!|IGZ`%`32X3m8V3C4VYhv6|WP(QeECU?F`p>qy?rGQYo{~igq8} zKMSM1+Q%T$G|xS#q`8hnt*(8o7@TTnrxwk>2A{OEos<_XD4_$ASe(TS)hZX9oTA7xVDOn+O#eY zv@)RZX!M*k8Z4v{DOFGdueBADl}4be#C$=P7)sW;mSu3LpG&rk87qx>noehV*h;kw zB#EQf?h9P1|Gb|SnQ>M2C!BPO-f!jKEgL%A?(dGL$9#wc1qt*Y#Ys1Lage7-0B8Dg zsdDi!*E;pZoj{N4JX+D>9%zE%$oId#lbjro_=zu^@)0*TWnD#ZrPlJ0h)!(h$YZ@9 zM-Cb__{9kp_V3|@Qx8uWZRjk5LoFxj4WA#;f(IdQsh zSMfeui=G3+Z^4@ws@wvHm^oK8-TOJ+@*tw*R4KQ4zLgJD{FsLrA_0Naev(W7epLKB z&y^O~5X+uzX9T3Sb8vA&j=pOYU;Nv{Z@cV0uE<(Z(LgJH#_RO+H;bPjp z{oPm9*1qE$-#U4?_}yJrw#F>%-FVN`e*pTzte6Bc7X1P743R5|*Xz{A87MTO2*uIW_Z2uTRGri`^GYT=r%+ zaO@PGh(qf%(o!-b!qhpH2PzJiNa;ssTQ77s5 z&)4PvfiLO}Kx0P>H2~@z=Ut8C2Fk_acLf`lKygwO4g2m+CLTgS&1nug2o>)8Nd>zT zA;I(k(nUcdk|sRCqVq`XsvAIdLMCFXdRAXyXdNNVym3>2DpQz2G}M9qYJJVLo2 z;Nr*?>Wu2@~P>Rv(U-87lo^EEb9WWs}uZUivejT71`GV~W@mt@;o?TFf}H=Gzsv2K9#{+7?P z94fbuc`HNb({-i}nykxxG8`C=k9kW6=lyl2bj-PPl=B@e$nzXkMq}xfkbW#b!c5!E z#gM6}?woFtn+hYSqVj^@G~MK+g{2T={(#)sJ3r)N)Q)`+3oogEH;v&-6)r-UR`XA7 zIAwLJa(jHQ_U5;0=017MH)VPp*HcgHOb2-2=?k)SSt8ZiN8i0&Pj(q1S!t!1UG7X| z=S^kbF@C?fJ$DL)vQk3#o#&(Y9R5AAtDD|8<&mrrk(yaF;8n5g44q!CAM!4#>S@H1 zld$)>+-XYvzk?Ds7Uus2ln6OHncF&0(=e%6I9UO|-pbBKAfU0+SL)XnlyUm1lQC2Q zY7qana55)0|AH_M4nR|4J40hjLo*-^lY)b-iL)`#f!fZ*^h=C^nUM{^$jnK@Bn@=? zZR=p-NKFI(Up-ma+K7Ci7-DJ>9u@#ICo?mEg_)U!4Zy(w;G_ZosJ`T6ZB719A}S7s zc6LCMFGyr)KQjf6a%USPkgl_%$>!DA~x5-$z0ExdQ#la*3G_o+Xp&_=kGjuX{1R4^%{P*S@j4X^S zH2(o#{{!1`bN?^P`2WRr-2W5WadL3}4-V9?Az1&5_w@e)+C`=7#*jB61z*0Z@5KxG zhY?VfO2ESTwfOaO@9e_cGy5-q3V~*gv&2u2htBG%RB}ZHNiNN8>(RF__Go7A$&M}? z_DGDiyDIoWP*X>#kn#>XSN7wKg@I;vq*n<$q`mU_5m4U3j6k2ASY52Ape?LmBJ5_2 zCwnJ~{+PdUF|ZQLsLXscTt>+1F{RwS!{X+lpzCPzee|R~YElf$p$LDRu^npQTYYGO z4vMkgEgCahf2;YE=Xbv;bV!tASdnfX%If%;upQNMvH3ziPm%hW67a)R74S^upDJ(r zGIm4XCTab)JBVqSGZFCP!V$7j($Mru^blcb{ZRM;`Dkp0a$ID+C|E8dOt3mzgrs*Q zP7>4*CV_~IfS`^ibR`67@{n<1Fg-*#sK3AbT;CuX!JUva;a>M*6RDN<$c0#>LIht( z-bnw#!Aa_nns7^ogL|j3e%mSq25ja_gL^}{6ry#W2we+lT!lhS^O=S_p~*9b55tt0 zskrO}MBqYU?%}g1Zpq%z!oI{;ArQo3bbiRz9+mjd2a*SMNK+gnpu{f-!;!y6wRihN;itWhY{GcWNr7*{qV9qc5g- zxcZ8vis|$5Zu{-RK{w;{75T8c+Cy~H>$wP*!I^DBtoVE#`OxQT+4+&c=vliWvA8xr zjD03Z*CPV+Pi;w5W9gaEHG>*`y#{lJhCK?M+KRmtFEo0DSS{@<7mz8~3%@odsZ(Y- z!jMS(tf(%9#)J6`IG{)S3IGxzdf?U~CwZmTAqRIxE`^K=$Sl_z5{aGt0!}GESS^L1 zdQ_dcjb?xMAgnzc&Hi)tx8@MlqwLILG#l}&sCYE{qDEhQHk3nkrK`A;=JnyZ|FlTz z`Qx~eP%}oq`wePyiu$*`7sciBz;~bp%N*r~xz5OVD^<;8YxnBm*_U^$RGVzAT&a4n z>1cd3amgN!)=+_Z*hY+42+zvuw1>Z?)a#yy)JEZe?o!cOAESjBvv%0D+~0}B=HJHQ zEduj2*4uYV^H??mhNbKyW3G3q`FhLI1&)cc;+ZTp_c!^>~t4qX0l?1R&2}o7gOe&f_lY%7)#V3<$`(M zfL6khS#2RdkxLRsvdRie5rdJ@HMJU$N%_HOX)Lr;<-u@N0Ox_li0J>lre^&DkxP#M zw=4PQtkY1Q?4hgfQTbt`rWn;jfBBX7Y;oFKq`hgQ>h?nX#3l4Xc;S~5Z_ULz2}t|` zua3X*9Bld?&h|xQ(Yjr^{o$%AX!zlw2Jxoay6tqv#Y8)Zg<9CUQ}?jZaK!;}el2{u z(Exp@VONo}YNF+IkVB?@Ph8!9#q%~01d2$7iRg5hV-w2M8gTP%XO#(Vg>J{202MR{T+^+hChdDbwC2PSC)i zkgdSJ?l{MnvB53Y;e`%p>s?$;Ao%-m*k+m++SzgVQK$4eQvuiTWzqfZXq%(AdWve? zJZJE_E)vCVjqR&8JTsy(MC&b<9nmywN7=JvymxC#lE+& zMN|V>)EKKZP8foiiH1(pX5ImTI4Hzr{oNRi-0_F3);@o>;cl%vxp#Ixe|z&a#3|>a1D{Aop&0 zj)b!CUo)D1>l53*e|z13-d``)TKt#MP*=p+r-+n|QtK`078|l0wJBu$j*|P}uSRBY z&R!|@Eds{SHyNq#8{_^4tn8`!ZlzX1KbJf?1n^?sPgIaBz~lmoRf6%0_UvdMfFC|8 zV&_&f`3S{ommFZQMGxcLBl$thRDPd}{4?xj#$M5~gHF2<=km2KK5Yp~o(e zVpYgG#pr!ar${T|LkjicS~(V`>k@r_IxpUc!E_c4T@H^PD<&~=^_niwZRk6D$5b(954(seZ07NzrTCKzi}Y#SVNGmtw|liBuzSD^9Ti`Eu|EFG%tlFw=cGb#Z-KJT|+U!s-6$6L63AU|aF=y10LS z+g=X*^xJC7E&SNIns^pu^2sFfapS+7#CiC5yC^UJR*|$?&H9PV*y5Y>|EH(1{BH_| zh7!;eo=MWi1n5ev4IpM?Vbz6aQnqjh{wE2~q)x2OOw3Bm{8gxAYwPq?2>9wk=|3$@ zZNGB=QT+as6Cu{-6XIm!WCyT_u`qLfoj9{IGqZ^a|Keg1;uHb=;$|1&5Fq|Pi+qhE z1GF*wQVh8{IRER+`u{?+p-7Tdk5<>0{48)Y6ID@xJzQR$0YKPAtsSpDhEE+b$#gI`Ma2m`8HjYRx;aG*& zAeDy5_P_@g$3icWTg6|o&A`(2P{L-!nl2$)WnLl9fM*1)lk!D0^c@&*!cCD_*SIa= zY`YZ_xWKps)Ib~ut_SH-b@)2-Csq#mAmS{=&I9 z5FL=tOBfbi_J-M}T{Bpd(G#v&r!#1)dxgdFpor9-7#o2NKsp;R-C&6^UqDe5=3 zwrUI3?h7q9`0a9?7yp5QP^s1hVW3&%K8>?c}bn2uujxH$s2)L+; zCXpIt%k#G4ZZ*TtDyzWDg9D_$R%NV}i(EuBo>y(gfo0NlL|WTGG0<1Bu{=v0~Ev@&oCy2of1Z zA52DvsLzW)i>It5Q4^v#b+2SG{SzU(uG$7ECQ(_Zj=yu#l+{k`-4=ATtVzXE01FE|1%;@*82o<&(SvyJ diff --git a/docs/README.md b/docs/README.md deleted file mode 100644 index 5f1d4fa..0000000 --- a/docs/README.md +++ /dev/null @@ -1,44 +0,0 @@ -# Some Jupyter Notebooks and other material. - -All of the notebooks are also available as HTML and Markdown files (generated using nbconvert) so you can view them without running Jupyter. - -In order to run the [Jupyter Notebooks](https://jupyter.org/index.html) you need Jupyter (obviously) and you should install `Joypy`. Here's an example using `virtualenv` from the `joypy/` directory: - - virtualenv --system-site-packages - . .//bin/activate - python ./setup.py install - -Once that's done you should be able to start Jupyter Notebook server with, e.g.: - - python -n notebook - -This starts it using the `virtualenv` version of Python so `joy` will be available. Navigate to the `joypy/docs` directory and the notebooks should be able to import the `notebook_preamble.py` file. - -## Table of Contents - -- 1. Basic Use of Joy in a Notebook -- 2. Library Examples - Short examples of each word in the dictionary. Various formats. -- 3. Developing a Program - Working with the first problem from Project Euler, "Find the sum of all the multiples of 3 or 5 below 1000", several forms of the program are derived. -- 4. Replacing Functions in the Dictionary - Shows the basics of defining new "primitive" functions in Python or as definitions and adding them to the dictionary. -- Factorial Function and Paramorphisms - A basic pattern of recursive control-flow. -- Generator Programs - Using the x combinator to make generator programs which can be used to create unbounded streams of values. -- Hylo-, Ana-, Cata-morphisms - Some basic patterns of recursive control-flow structures. -- Quadratic - Not-so-annoying Quadratic Formula. -- Trees - Ordered Binary Trees in Joy and more recursion. -- Zipper - A preliminary examination of the idea of data-structure "zippers" for traversing datastructures. -- notebook_preamble.py - Imported into notebooks to simplify the preamble code. -- pe1.py pe1.txt - Set up and execute a Joy program for the first problem from Project Euler. The pe1.txt file is the trace. It's 2.8M uncompressed. Compressed with gzip it becomes just 0.12M. -- repl.py - Run this script to start a REPL. Useful for e.g. running Joy code in a debugger. - -## Notes - -One of the things that interests me about Joy is how programming becomes -less about writing code and more about sound reasoning about simple -(almost geometric) programs. Many of the notebooks in this collection -consist of several pages of discussion to arrive at a few lines of Joy -definitions. I think this is a good thing. This is "literate -programming". The "programs" resemble mathematical proofs. You aren't -implementing so much as deriving. The structure of Joy seems to force -you to think clearly about the task in a way that is reliable but -extremely flexible. It feels like a puzzle game, and the puzzles are -often simple, and the solutions build on each other.