((wrap (vau root_env (quote) ((wrap (vau (let1) (let1 lambda (vau se (p b1) (wrap (eval (array vau p b1) se))) (let1 current-env (vau de () de) (let1 cons (lambda (h t) (concat (array h) t)) (let1 Y (lambda (f3) ((lambda (x1) (x1 x1)) (lambda (x2) (f3 (wrap (vau app_env (& y) (lapply (x2 x2) y app_env))))))) (let1 vY (lambda (f) ((lambda (x3) (x3 x3)) (lambda (x4) (f (vau de1 (& y) (vapply (x4 x4) y de1)))))) (let1 let (vY (lambda (recurse) (vau de2 (vs b) (cond (= (len vs) 0) (eval b de2) true (vapply let1 (array (idx vs 0) (idx vs 1) (array recurse (slice vs 2 -1) b)) de2))))) (let ( lcompose (lambda (g f) (lambda (& args) (lapply g (array (lapply f args))))) rec-lambda (vau se (n p b) (eval (array Y (array lambda (array n) (array lambda p b))) se)) if (vau de (con than & else) (eval (array cond con than true (cond (> (len else) 0) (idx else 0) true false)) de)) map (lambda (f5 l5) (let (helper (rec-lambda recurse (f4 l4 n4 i4) (cond (= i4 (len l4)) n4 (<= i4 (- (len l4) 4)) (recurse f4 l4 (concat n4 (array (f4 (idx l4 (+ i4 0))) (f4 (idx l4 (+ i4 1))) (f4 (idx l4 (+ i4 2))) (f4 (idx l4 (+ i4 3))) )) (+ i4 4)) true (recurse f4 l4 (concat n4 (array (f4 (idx l4 i4)))) (+ i4 1))))) (helper f5 l5 (array) 0))) map_i (lambda (f l) (let (helper (rec-lambda recurse (f l n i) (cond (= i (len l)) n (<= i (- (len l) 4)) (recurse f l (concat n (array (f (+ i 0) (idx l (+ i 0))) (f (+ i 1) (idx l (+ i 1))) (f (+ i 2) (idx l (+ i 2))) (f (+ i 3) (idx l (+ i 3))) )) (+ i 4)) true (recurse f l (concat n (array (f i (idx l i)))) (+ i 1))))) (helper f l (array) 0))) filter_i (lambda (f l) (let (helper (rec-lambda recurse (f l n i) (if (= i (len l)) n (if (f i (idx l i)) (recurse f l (concat n (array (idx l i))) (+ i 1)) (recurse f l n (+ i 1)))))) (helper f l (array) 0))) filter (lambda (f l) (filter_i (lambda (i x) (f x)) l)) ; Huge thanks to Oleg Kiselyov for his fantastic website ; http://okmij.org/ftp/Computation/fixed-point-combinators.html Y* (lambda (& l) ((lambda (u) (u u)) (lambda (p) (map (lambda (li) (lambda (& x) (lapply (lapply li (p p)) x))) l)))) vY* (lambda (& l) ((lambda (u) (u u)) (lambda (p) (map (lambda (li) (vau ide (& x) (vapply (lapply li (p p)) x ide))) l)))) let-rec (vau de (name_func body) (let (names (filter_i (lambda (i x) (= 0 (% i 2))) name_func) funcs (filter_i (lambda (i x) (= 1 (% i 2))) name_func) overwrite_name (idx name_func (- (len name_func) 2))) (eval (array let (concat (array overwrite_name (concat (array Y*) (map (lambda (f) (array lambda names f)) funcs))) (lapply concat (map_i (lambda (i n) (array n (array idx overwrite_name i))) names))) body) de))) let-vrec (vau de (name_func body) (let (names (filter_i (lambda (i x) (= 0 (% i 2))) name_func) funcs (filter_i (lambda (i x) (= 1 (% i 2))) name_func) overwrite_name (idx name_func (- (len name_func) 2))) (eval (array let (concat (array overwrite_name (concat (array vY*) (map (lambda (f) (array lambda names f)) funcs))) (lapply concat (map_i (lambda (i n) (array n (array idx overwrite_name i))) names))) body) de))) flat_map (lambda (f l) (let (helper (rec-lambda recurse (f l n i) (if (= i (len l)) n (recurse f l (concat n (f (idx l i))) (+ i 1))))) (helper f l (array) 0))) flat_map_i (lambda (f l) (let (helper (rec-lambda recurse (f l n i) (if (= i (len l)) n (recurse f l (concat n (f i (idx l i))) (+ i 1))))) (helper f l (array) 0))) ; with all this, we make a destrucutring-capable let let (let ( destructure_helper (rec-lambda recurse (vs i r) (cond (= (len vs) i) r (array? (idx vs i)) (let (bad_sym (str-to-symbol (str (idx vs i))) new_vs (flat_map_i (lambda (i x) (array x (array idx bad_sym i))) (idx vs i)) ) (recurse (concat new_vs (slice vs (+ i 2) -1)) 0 (concat r (array bad_sym (idx vs (+ i 1)))))) true (recurse vs (+ i 2) (concat r (slice vs i (+ i 2)))) ))) (vau de (vs b) (vapply let (array (destructure_helper vs 0 (array)) b) de))) nil (array) not (lambda (x) (if x false true)) or (let (macro_helper (rec-lambda recurse (bs i) (cond (= i (len bs)) false (= (+ 1 i) (len bs)) (idx bs i) true (array let (array 'tmp (idx bs i)) (array if 'tmp 'tmp (recurse bs (+ i 1))))))) (vau se (& bs) (eval (macro_helper bs 0) se))) and (let (macro_helper (rec-lambda recurse (bs i) (cond (= i (len bs)) true (= (+ 1 i) (len bs)) (idx bs i) true (array let (array 'tmp (idx bs i)) (array if 'tmp (recurse bs (+ i 1)) 'tmp))))) (vau se (& bs) (eval (macro_helper bs 0) se))) foldl (let (helper (rec-lambda recurse (f z vs i) (if (= i (len (idx vs 0))) z (recurse f (lapply f (cons z (map (lambda (x) (idx x i)) vs))) vs (+ i 1))))) (lambda (f z & vs) (helper f z vs 0))) foldr (let (helper (rec-lambda recurse (f z vs i) (if (= i (len (idx vs 0))) z (lapply f (cons (recurse f z vs (+ i 1)) (map (lambda (x) (idx x i)) vs)))))) (lambda (f z & vs) (helper f z vs 0))) reverse (lambda (x) (foldl (lambda (acc i) (cons i acc)) (array) x)) zip (lambda (& xs) (lapply foldr (concat (array (lambda (a & ys) (cons ys a)) (array)) xs))) match (let ( evaluate_case (rec-lambda evaluate_case (access c) (cond (symbol? c) (array true (lambda (b) (array let (array c access) b))) (and (array? c) (= 2 (len c)) (= 'unquote (idx c 0))) (array (array = access (idx c 1)) (lambda (b) b)) (and (array? c) (= 2 (len c)) (= 'quote (idx c 0))) (array (array = access c) (lambda (b) b)) (array? c) (let ( tests (array and (array array? access) (array = (len c) (array len access))) (tests body_func) ((rec-lambda recurse (tests body_func i) (if (= i (len c)) (array tests body_func) (let ( (inner_test inner_body_func) (evaluate_case (array idx access i) (idx c i)) ) (recurse (concat tests (array inner_test)) (lambda (b) (body_func (inner_body_func b))) (+ i 1))))) tests (lambda (b) b) 0) ) (array tests body_func)) true (array (array = access c) (lambda (b) b)) )) helper (rec-lambda helper (x_sym cases i) (cond (< i (- (len cases) 1)) (let ( (test body_func) (evaluate_case x_sym (idx cases i)) ) (concat (array test (body_func (idx cases (+ i 1)))) (helper x_sym cases (+ i 2)))) true (array true (array error "none matched")))) ) (vau de (x & cases) (eval (array let (array '___MATCH_SYM x) (concat (array cond) (helper '___MATCH_SYM cases 0))) de))) ll-nil nil ll-cons array ll-make (rec-lambda ll-make (n) (if (= 0 n) ll-nil (ll-cons n (ll-make (- n 1))))) ll-sum (rec-lambda ll-sum (l) (match l ,nil 0 (hh (h t)) (+ h hh (ll-sum t)) (h t) (+ h (ll-sum t)) )) monad (array 'write 1 (str "running tree test") (vau (written code) (array 'args (vau (args code) ;(array 'exit (log (reduce-test-tree (make-test-tree (read-string (idx args 1)) map-empty)))) (array 'exit (log (let (l (ll-make (read-string (idx args 1))) _ (log "swapping to sum") ) (ll-sum l)))) )) )) ) monad) ; end of all lets )))))) ; impl of let1 )) (vau de (s v b) (eval (array (array wrap (array vau (array s) b)) v) de))) ; impl of quote )) (vau (x5) x5))