miloignis/kraken
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fixed the recursion! Memo has moved to just being the infinite recursion detector based on body and inner-env

Browse Source
This commit is contained in:
Nathan Braswell
2022-01-27 21:54:15 -05:00
parent 2746e1ca75
commit 90750933fc
2 changed files with 50 additions and 53 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
to_compile.kp
View File

@@ -5,14 +5,14 @@
(let1 lambda (vau se (p b1) (wrap (eval (array vau p b1) se)))
(let1 current-env (vau de () de)
;(let1 current-env (vau de () de)
(let1 cons (lambda (h t) (concat (array h) t))
(let1 lapply (lambda (f1 p) (eval (cons (unwrap f1) p) (current-env)))
;(let1 lapply (lambda (f1 p) (eval (cons (unwrap f1) p) (current-env)))
(let1 vapply (lambda (f2 p ede) (eval (cons f2 p) ede))
(let1 Y (lambda (f3)
((lambda (x1) (x1 x1))
(lambda (x2) (f3 (lambda (& y) (lapply (x2 x2) y))))))
;(let1 Y (lambda (f3)
; ((lambda (x1) (x1 x1))
; (lambda (x2) (f3 (lambda (& y) (lapply (x2 x2) y))))))
(let1 vY (lambda (f)
((lambda (x3) (x3 x3))
@@ -20,18 +20,26 @@
(let1 let (vY (lambda (recurse) (vau de (vs b) (cond (= (len vs) 0) (eval b de)
true (vapply let1 (array (idx vs 0) (idx vs 1) (array recurse (slice vs 2 -1) b)) de)))))
(let (a 1337)
(let (
;lcompose (lambda (g f) (lambda (& args) (lapply g (array (lapply f args)))))
;monad (array 'write 1 "test_self_out3" (vau (written code) 1))
a 3
b 4
(array 'open 3 "test_self_out" (lambda (fd code)
(array 'write fd "wabcdefghijk" (lambda (written code)
(array 'exit (+ a written))))))
;a 123
monad (array 'open 3 "test_self_out" (lambda (fd code)
(array 'write fd "wabcdefghijk" (lambda (written code)
(array 'exit (+ a b written))))))
)
;(+ b a)
monad
;(array 'write 1 "test_self_out2" (vau (written code) 1))
)
;(array 'write 1 "test_self_out2" (vau (written code) 1))
; end of all lets
)))))))
))));)))
)
; impl of let1
@@ -42,4 +50,3 @@
;(array 'write 1 "test_self_out2" (vau (written code) 1))