sforman/Thun
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

for-each

Browse Source
This commit is contained in:
sforman
2023-08-12 14:09:44 -07:00
parent 596a7a21eb
commit 48e443c5c7
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Thun.md
+1 -1
View File
@@ -134,7 +134,7 @@ and run them in various ways. These combinators reify specific
control-flow patterns (such as `ifte` which is like `if.. then.. else..` control-flow patterns (such as `ifte` which is like `if.. then.. else..`
in other languages.) Combinators receive the current expession in in other languages.) Combinators receive the current expession in
addition to the stack and return the next expression. They work by addition to the stack and return the next expression. They work by
changing the pending expression the interpreter is about to execute. changing the pending expression the interpreter is about to execute.
### Basis Functions ### Basis Functions
implementations/scheme-chicken/joy.scm
+1 -1
View File
@@ -176,7 +176,7 @@
(load-defs (make-hash-table string=? string-hash))) (load-defs (make-hash-table string=? string-hash)))
(define (load-defs dict) (define (load-defs dict)
(map (lambda (def) (add-def def dict)) (defs)) ;defs is defined in defs.scm (for-each (lambda (def) (add-def def dict)) (defs)) ;defs is defined in defs.scm
dict) dict)
(define (add-def def dict) (define (add-def def dict)