mua/in0

make "a [
  [b]
  [
    make "c 1
    make "d [
      []
      [
        make "e 2
        make "f [
          []
          [
            make "g 3
            make "h [
              []
              [
                return thing :b
              ]
            ]
            return h
          ]
        ]
        return f
      ]
    ]
    return d
  ]
]

print a "c
print a "e
print a "g

make "i [
  []
  [
    make "j 4
    make "k [
      []
      [
        make "l 5
        make "m [
          []
          [
            make "n 6
            make "o [
              [p]
              [
                return thing :p
              ]
            ]
            return :o
          ]
        ]
        return :m
      ]
    ]
    return :k
  ]
]

make "q i
make "r q
make "s r
print s "j
print s "l
print s "n

make "fact_base [
  [rec x]
  [
    if eq :x 0
    [return 1]
    [return mul :x rec :rec sub :x 1]
  ]
]

make "fact_simple [
  [x]
  [return fact_base :fact_base :x]
]

print fact_simple 5

make "fact_nice [
  [rec]
  [
    make "g [
      [x]
      [
        if eq :x 0
        [return 1]
        [
          make "tmp rec :rec
          return mul :x tmp sub :x 1
        ]
      ]
    ]
    return :g
  ]
]

make "fact_curry fact_nice :fact_nice
print fact_curry 5

make "fact_nicer [
  [rec]
  [
    make "g [
      [x]
      [
        if eq :x 0
        [return 1]
        [return mul :x rec sub :x 1]
      ]
    ]
    return :g
  ]
]

make "z_comb [
  [g]
  [
    make "t [
      [r]
      [
        make "y [
          [yy]
          [
            make "tmp r :r
            return tmp :yy
          ]
        ]
        return g :y
      ]
    ]
    return t :t
  ]
]

make "fact_z z_comb :fact_nicer
print fact_z 5

make "rev_func [
  [f]
  [
    [
      [a b]
      [f :b :a]
    ]
  ]
]
make "rev_sub rev_func [[x y] [sub :x :y]]
print rev_sub 2 5
print rev_sub 26.5 10.3
make "rev_ge rev_func [[x y] [or gt :x :y eq :x :y]]
print rev_ge 3 7
print rev_ge "abc "aBc
print rev_ge 8 8
make "rev_imply rev_func [[x y] [or not :x :y]]
print rev_imply false false
print rev_imply false true
print rev_imply true false
print rev_imply true true

print "abcd12
make "a 16
print :a
make "b "a
print thing :b
make "c mul add :a 13 :a
print sub :c "6
print div 12 5
print mod 12 5
make "d read
1234dd
make "e print :d
print :e

make "l []
make "q join :l "[
print :q[0]
print eq "] "\]

make "t print [ \[1\]\\\] [1]]
print islist :t[0]
print islist :t[1]
make "x "t
make "y "x
print :::y

make "arr [ [ a b ] c ]
print :arr[0]
print :arr[1]
print :arr[0][0]
print :arr[0][1]
make "arr[0][1] "d
print :arr[0]
print :arr[0][1]
make "arr[1] [ add :a :d ]
print :arr
print arr 2 3
make "arr[0][1] [ e [ f ] ]
make "arr join :arr [ g [ h i ] ]
print :arr[0][1]
print :arr[0][1][0]
print :arr[0][1][1][0]
make "x 1
print :arr[x:]

print word "hello "world
print word "hello true
print word "hello -134.5

print sentence 483 "dba
print sentence sentence [ [ a b ] c ] [ d [ e f ] ] "g

print list 483 "dba
print list list [ [ a b ] c ] [ d [ e f ] ] "g

print join [ 483 ] "dba
print join join [ [ a b ] c ] [ d [ e f ] ] "g

print first "hello
print first butlast list list [ [ a b ] c ] [ d [ e f ] ] "g

make "pow [[a b] [
  if lt :b 1 [
    return 1
  ] [
    make "r pow :a div sub :b mod :b 2 2
    make "r mul :r :r
    if mod :b 2 [
      return mul :r :a
    ] [
      return :r
    ]
    print :r
  ]
]]

print pow 2 18

print make "ts readlist
[1 ] c 1 \\\\[2 3\\]
print islist :ts[1]

make "reverse_list [
  [list]
  [if isempty :list [] [join reverse_list butfirst :list first :list]]
]
print reverse_list []
print reverse_list [x y z]
print reverse_list [12 345 6 78 9 0]
print reverse_list [a b c d [e f] g]
print reverse_list [h [i [j k]] l m n]

make "fib_wrap [
  [x]
  [
    make "fib [
      [x]
      [
        if lt :x 2 [return 1] []
        add fib sub :x 1 fib sub :x 2
      ]
    ]
    fib :x
  ]
]

print fib_wrap 0
print fib_wrap 1
print fib_wrap 2
print fib_wrap 3
print fib_wrap 4
print fib_wrap 5
print fib_wrap 6
print fib_wrap 7
print fib_wrap 8
print fib_wrap 23

make "f [[x] [
  make "g [[y] [return add :x :y]]
  return g 42
]]
print f 233

make "f1 [[x] [
    make "g1 [[y] [return add :x :y]]
    return :g1
  ]
]
make "c1 f1 42
make "c2 f1 24
print c1 1
print c2 2

make "curry_two [[f x] [
  return [[y] [return f :x :y]]
]]
make "f2 [[x y] [
  return add :x :y
]]
make "f2p curry_two :f2 42
print f2p 233

make "fun [
  [x]
  [[[y] [make "x add :x :y]]]
]
make "adder fun 5
print adder 1
print adder 2
print adder 3

make "prt [
  [a]
  [
    make "b [
      []
      [print :a]
    ]
    return :b
  ]
]
make "c prt "hello
c

make "x 2
print :x
make "test [
  []
  [
    make "x 1
    export "x
    print :x
  ]
]
test
print :x

print poall

make "fun1 [
  [x]
  [add :x 10]
]
print fun1 5
make "fun2 [
  []
  [
    print fun1 5
    make "fun1 [
      [x]
      [add :x 100]
    ]
    print fun1 5
    export "fun1
    make "fun1 [
      [x]
      [add :x 1000]
    ]
    print fun1 5
    if eq fun1 5 1005 [return 0] []
    make "fun1 [
      [x]
      [add :x 10000]
    ]
    export "fun1
    print fun1 5
    return 1
  ]
]
print fun2
print fun1 5

make "merge_sort [
  [a]
  [
    if isempty :a [
      return []
    ] []
    if isempty butfirst :a [
      return :a
    ] []
    make "split [
      [l]
      [
        if isempty :l [
          return [[] []]
        ] []
        if isempty butfirst :l [
          return list :l []
        ] []
        make "tmp split butlast butfirst :l
        return list sentence join [] first :l first :tmp join last :tmp last :l
      ]
    ]
    make "merge [
      [l r]
      [
        if or isempty :l isempty :r [
          return sentence :l :r
        ] []
        if lt first :l first :r [
          return sentence join [] first :l merge butfirst :l :r
        ] [
          return sentence join [] first :r merge :l butfirst :r
        ]
      ]
    ]
    make "tmp split :a
    return merge merge_sort first :tmp merge_sort last :tmp
  ]
]

print merge_sort [4 6 1 8 3 0 7 9 5 2]