diff options
| -rw-r--r-- | benchmark.bruijn | 66 | ||||
| -rw-r--r-- | samples/fun/gen.bruijn | 12 | ||||
| -rw-r--r-- | samples/fun/thue-morse.bruijn | 10 |
3 files changed, 22 insertions, 66 deletions
diff --git a/benchmark.bruijn b/benchmark.bruijn deleted file mode 100644 index e870b29..0000000 --- a/benchmark.bruijn +++ /dev/null @@ -1,66 +0,0 @@ -# ================== -# Lennart -# From Lambda-n-ways -# ================== - -fix [[1 (0 0)] [1 (0 0)]] - -zero [[1]] - -succ [[[0 2]]] - -add fix [[[1 0 [succ (3 0 1)]]]] - -sumto fix [[0 zero [add 1 (2 0)]]] - -mul fix [[[1 zero [add 1 (3 0 1)]]]] - -one succ zero - -two succ one - -three succ two - -n6 add three three - -n703 sumto n37 - n37 succ (mul n6 n6) - -n17 add n6 (add n6 n5) - n5 add two three - -true [[0]] - -false [[1]] - -const [[1]] - -eqnat fix [[[1 (0 true (const false)) [1 false [4 1 0]]]]] - -n720 fac n6 - if [[[2 0 1]]] - pair [[[0 2 1]]] - fst [[1 0 [[1]]]] - snd [[1 0 [[0]]]] - fac fix [[0 one [mul 1 (2 0)]]] - -# this can take some time.. -# - should return true -:print eqnat n720 (add n703 n17) - -# ========= -# Ackermann -# From AIT -# ========= - -# ackerlike [0 ackify omega 0] -# two [[1 (1 0)]] -# omega [0 0] -# ackify [[0 1 0]] - -# this can take a VERY long while -# maybe even too long for benchmarking -# - should return exponential tower with 256 levels -# :print ackerlike two - -main [0] diff --git a/samples/fun/gen.bruijn b/samples/fun/gen.bruijn new file mode 100644 index 0000000..1333baa --- /dev/null +++ b/samples/fun/gen.bruijn @@ -0,0 +1,12 @@ +# generates long expressions from short ones + +# TODO: This should be linear time according to RKNL paper +# possible reasons: box/map copying, GC + +:import std/Math . + +seed (+23u) + +dup [0 0] + +main [seed dup 0] ⧗ Unary → Woah diff --git a/samples/fun/thue-morse.bruijn b/samples/fun/thue-morse.bruijn new file mode 100644 index 0000000..3f40e01 --- /dev/null +++ b/samples/fun/thue-morse.bruijn @@ -0,0 +1,10 @@ +# printf 10 | bruijn thue-morse.bruijn +# using tromp's solution, prints thue morse sequence + +:import std/Combinator . +:import std/Logic . +:import std/String . + +main [take (number! 0) tm] + xpd z [[[[0 2 [0 [[5 0 1]] (2 4)]]]]] + tm z [xpd true (0 false)] |