|
| 1 | + |
| 2 | + |
| 3 | + |
| 4 | + |
| 5 | + |
| 6 | + |
| 7 | +/* |
| 8 | +{ -> |
| 9 | + print("Hello, world!\n"); |
| 10 | + print("Hi!", "\n"); |
| 11 | + println("你好"); |
| 12 | +} |
| 13 | +*/ |
| 14 | + |
| 15 | + |
| 16 | + |
| 17 | +{_true _false _if -> |
| 18 | + _true = {(t f) -> t}; |
| 19 | + _false = {(t f) -> f}; |
| 20 | + _if = {(c t e) -> c(t, e)()}; |
| 21 | + |
| 22 | + println(_if(_true, {-> while true do {} od}, {-> "False"})) |
| 23 | +} |
| 24 | + |
| 25 | + |
| 26 | +/* |
| 27 | +{average sqr abs sqrt x -> |
| 28 | + average = {(x y) -> (x + y) / 2}; |
| 29 | + sqr = {(x) -> x * x}; |
| 30 | + abs = {(x) -> if x >= 0 then x else -x fi}; |
| 31 | + sqrt = {(x) tolerance isGoodEnough improve sqrtIter -> |
| 32 | + tolerance = 1e-30; |
| 33 | + |
| 34 | + isGoodEnough = {(guess) -> abs(sqr(guess) - x) < tolerance}; |
| 35 | + improve = {(guess) -> average(guess, x / guess)}; |
| 36 | + sqrtIter = {(guess) -> |
| 37 | + if isGoodEnough(guess) then guess else sqrtIter(improve(guess)) fi |
| 38 | + }; |
| 39 | + sqrtIter(1) |
| 40 | + }; |
| 41 | + |
| 42 | + x = 16; |
| 43 | + println("sqrt(", x, "): ", sqrt(x)); |
| 44 | +} |
| 45 | +*/ |
| 46 | + |
| 47 | + |
| 48 | + |
| 49 | + |
| 50 | +{coin change -> |
| 51 | + coin = {(index) -> |
| 52 | + if index == 0 |
| 53 | + then 500 |
| 54 | + else if index == 1 |
| 55 | + then 200 |
| 56 | + else if index == 2 |
| 57 | + then 100 |
| 58 | + else if index == 3 |
| 59 | + then 50 |
| 60 | + else if index == 4 |
| 61 | + then 20 |
| 62 | + else if index == 5 |
| 63 | + then 10 |
| 64 | + else if index == 6 |
| 65 | + then 5 |
| 66 | + fi |
| 67 | + fi |
| 68 | + fi |
| 69 | + fi |
| 70 | + fi |
| 71 | + fi |
| 72 | + fi |
| 73 | + }; |
| 74 | + |
| 75 | + change = {(amount index) -> |
| 76 | + if amount == 0 then 1 |
| 77 | + else if amount < 0 then 0 |
| 78 | + else if index >= 7 then 0 |
| 79 | + else change(amount, index + 1) + change(amount - coin(index), index) |
| 80 | + fi |
| 81 | + fi |
| 82 | + fi |
| 83 | + }; |
| 84 | + |
| 85 | + println(change(50, 0)) |
| 86 | +} |
| 87 | + |
| 88 | + |
| 89 | + |
| 90 | + |
| 91 | +/*{makeCounter myCounter yourCounter n -> |
| 92 | + |
| 93 | + makeCounter = {(balance) -> |
| 94 | + {(amount) -> balance += amount} |
| 95 | + }; |
| 96 | + |
| 97 | + myCounter = makeCounter(100); |
| 98 | + yourCounter = makeCounter(50); |
| 99 | + |
| 100 | + println("myCounter: ", myCounter(0)); |
| 101 | + println("yourCounter: ", yourCounter(0)); |
| 102 | + println(); |
| 103 | + |
| 104 | + n = 0; |
| 105 | + while n < 10 do |
| 106 | + println("myCounter[", n, "]: ", myCounter(50)); |
| 107 | + println("yourCounter[", n, "]: ", yourCounter(-10)); |
| 108 | + println(); |
| 109 | + n += 1 |
| 110 | + od |
| 111 | +} |
| 112 | +*/ |
| 113 | + |
| 114 | + |
| 115 | +/* |
| 116 | +{isOdd isEven -> |
| 117 | + isOdd = {(n) -> if n == 0 then false else isEven(n - 1) fi}; |
| 118 | + isEven = {(n) -> if n == 0 then true else isOdd(n - 1) fi}; |
| 119 | + |
| 120 | + println(isEven(1000)); |
| 121 | +} |
| 122 | +*/ |
| 123 | + |
| 124 | +/* |
| 125 | +{-> println({->} + "a")} |
| 126 | +*/ |
| 127 | + |
| 128 | +/* |
| 129 | +{a sqr x -> |
| 130 | + |
| 131 | + sqr = {(x) -> x * x}; |
| 132 | + x = {(z) -> sqr}; |
| 133 | + |
| 134 | + println(x(2)(3)); |
| 135 | + |
| 136 | + println(10 / 3); |
| 137 | + println(20 / 3); |
| 138 | + |
| 139 | + println({(x)->{() -> x}}(4)()); |
| 140 | + 7(8); |
| 141 | + |
| 142 | + a = 1024 * 1024 * 1024 * 1024 * 1024 * 1024 * 1024 * 1024 * 1024; |
| 143 | + println(a); |
| 144 | + println(1 / a); |
| 145 | + println(1 / a * a); |
| 146 | + println(1 / a * a == 1); |
| 147 | + |
| 148 | + println(3.27 % .7); |
| 149 | +} |
| 150 | +*/ |
| 151 | + |
| 152 | +/* |
| 153 | +{fib -> |
| 154 | + fib = {(n) -> |
| 155 | + if n < 2 then n else fib(n - 1) + fib(n - 2) fi |
| 156 | + }; |
| 157 | + |
| 158 | + println(fib(40)) |
| 159 | +} |
| 160 | +*/ |
| 161 | + |
| 162 | +/* |
| 163 | +{fib -> |
| 164 | + fib = {(n) fib0 fib1 fib -> |
| 165 | + fib0 = 1; |
| 166 | + fib1 = 0; |
| 167 | + while n > 0 do |
| 168 | + fib = fib0 + fib1; |
| 169 | + fib0 = fib1; |
| 170 | + fib1 = fib; |
| 171 | + n -= 1 |
| 172 | + od; |
| 173 | + fib1 |
| 174 | + }; |
| 175 | + |
| 176 | + println(fib(10000)) |
| 177 | +} |
| 178 | +*/ |
| 179 | + |
| 180 | + |
| 181 | + |
| 182 | + |
| 183 | +/* |
| 184 | +{hanoi -> |
| 185 | + hanoi = {(n from to via) -> |
| 186 | + if n > 0 then |
| 187 | + hanoi(n - 1, from, via, to); |
| 188 | + println(from, " -> ", to); |
| 189 | + hanoi(n - 1, via, to, from) |
| 190 | + fi |
| 191 | + }; |
| 192 | + hanoi(10, "left", "right", "center") |
| 193 | +} |
| 194 | +*/ |
| 195 | + |
| 196 | + |
| 197 | + |
| 198 | +/* |
| 199 | +{ pair head tail tree -> |
| 200 | + pair = {(h t) -> {(p) -> p(h, t)}}; |
| 201 | + head = {(p) -> p({(h t) -> h})}; |
| 202 | + tail = {(p) -> p({(h t) -> t})}; |
| 203 | + |
| 204 | + tree = pair(1, pair(pair("two", 42), pair(true, nil))); |
| 205 | + println(head(head(tail(tree)))); |
| 206 | +} |
| 207 | +*/ |
| 208 | + |
| 209 | +// a line comment |
| 210 | + |
0 commit comments