diff options
| -rw-r--r-- | bruijn.cabal | 3 | ||||
| -rw-r--r-- | package.yaml | 1 | ||||
| -rw-r--r-- | samples/fun/jottary.bruijn | 25 | ||||
| -rw-r--r-- | std/List.bruijn | 14 | ||||
| -rw-r--r-- | std/Monad.bruijn | 19 |
5 files changed, 57 insertions, 5 deletions
diff --git a/bruijn.cabal b/bruijn.cabal index 44d3b5e..bb29aee 100644 --- a/bruijn.cabal +++ b/bruijn.cabal @@ -32,6 +32,7 @@ data-files: std/Result.bruijn std/Set.bruijn std/String.bruijn + std/AIT/Beavers.bruijn std/Number/Binary.bruijn std/Number/Ternary.bruijn std/Number/Unary.bruijn @@ -55,7 +56,7 @@ library src default-extensions: LambdaCase - ghc-options: -O3 -optc-O3 -funfolding-use-threshold=16 -fllvm -Wall -Wextra -Wincomplete-uni-patterns -Wincomplete-record-updates -Widentities -Wredundant-constraints + ghc-options: -O3 -optc-O3 -funfolding-use-threshold=16 -Wall -Wextra -Wincomplete-uni-patterns -Wincomplete-record-updates -Widentities -Wredundant-constraints build-depends: array , base >=4.7 && <5 diff --git a/package.yaml b/package.yaml index dc09b62..93cedc8 100644 --- a/package.yaml +++ b/package.yaml @@ -49,7 +49,6 @@ library: - -O3 - -optc-O3 - -funfolding-use-threshold=16 - - -fllvm - -Wall - -Wextra - -Wincomplete-uni-patterns diff --git a/samples/fun/jottary.bruijn b/samples/fun/jottary.bruijn new file mode 100644 index 0000000..61ad048 --- /dev/null +++ b/samples/fun/jottary.bruijn @@ -0,0 +1,25 @@ +# a small Jottary (unary Jot) interpreter +# also serves as example usage of monadic list operations +# run with "printf 1...1 | bruijn jottary.bruijn" + +:import std/Combinator . +:import std/List . +:import std/Monad . +:import std/Number . + +go [eval-r (<~>((concat huh) !! 0) ; i)] + huh (\replicate-m (l : {}r)) <$> (iterate ++‣ (+0)) + l [(0 s) k] + r [s (k 0)] + +:test (go (+0)) (i) +:test (go (+1)) ((i s) k) +:test (go (+2)) (s (k i)) +:test (go (+3)) (i s k s k) +:test (go (+4)) (s (k (i s k))) +:test (go (+5)) (((s (k i)) s) k) +:test (go (+6)) (s (k (s (k i)))) +:test (go (+59)) (k) +:test (go (+503)) (s) + +main go ∘ length diff --git a/std/List.bruijn b/std/List.bruijn index 1f3d8f7..19fac6b 100644 --- a/std/List.bruijn +++ b/std/List.bruijn @@ -58,7 +58,7 @@ length z [[[rec]]] (+0) ⧗ (List a) → Number :test (∀((+1) : {}(+2))) ((+2)) :test (∀empty) ((+0)) -# applies each element of a list to a function +# applies each element of a list to a function (left-associative) apply z [[[rec]]] ⧗ (a* → b) → (List a) → b rec 0 [[[case-app]]] case-end case-app 5 (4 2) 1 @@ -68,13 +68,23 @@ apply z [[[rec]]] ⧗ (a* → b) → (List a) → b :test (…+… <! ((+1) : {}(+2))) ((+3)) -# applies each element of the tail to the head +# applies each element of the tail to the head (left-associative) eval [0 apply] ⧗ (Pair (a → b) (List a)) → b !‣ eval :test (!(…+… : ((+1) : {}(+2)))) ((+3)) +# applies each element of the tail to the head (right-associative) +eval-r z [[rec]] + rec 0 [[[case-app]]] case-end + case-app ∅?1 2 (2 (4 1)) + case-end 1 + +~!‣ eval-r + +:test (~!(inc : (inc : {}(+1)))) ((+3)) + # returns the element at index in list index z [[[rec]]] ⧗ (List a) → Number → a rec 0 [[[case-index]]] case-end diff --git a/std/Monad.bruijn b/std/Monad.bruijn index e015efa..97291eb 100644 --- a/std/Monad.bruijn +++ b/std/Monad.bruijn @@ -2,7 +2,7 @@ # monadic interface for anything based on lists (e.g. IO, strings) # afaik originally proposed by John Tromp and inspired by Haskell -:import std/Pair . +:import std/List . :import std/Combinator . read [0] ⧗ a → (M a) @@ -25,3 +25,20 @@ pure return ⧗ a → (M a) …>>… [[1 >>= [1]]] ⧗ (M a) → (M b) → (M b) :test ((read >> (return 'a')) "hah") ("aah") + +# monadifies a list +lift-m map ⧗ (a → b) → (M a) → (M b) + +# monadifies a list with two monadic arguments +lift-m2 [[[concat ([[4 1 0] <$> 1] <$> 1)]]] ⧗ (a → b → c) → (M a) → (M b) → (M c) + +# evaluates monadic actions +sequence foldr (lift-m2 cons) {}empty ⧗ (List (M a)) → (M (List a)) + +>‣ [sequence ∘∘ 0] + +# performs action n times +replicate-m >replicate ⧗ Number → (M a) → (M (List a)) + +# maps elements to a monadic action +map-m >map ⧗ (a → (M b)) → (List a) → (M (List b)) |