for-each

Thun.md

@@ -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..`
 in other languages.)  Combinators receive the current expession in
 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
 

implementations/scheme-chicken/joy.scm

@@ -176,7 +176,7 @@
   (load-defs (make-hash-table string=? string-hash)))
 
 (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)
 
 (define (add-def def dict)