anchor.diff:  ;;; it's not used. Thus, I decided to save them to this file.
   (defmacro in (obj &rest choices)
     (with-gensyms (insym)
  -                `(let ((,insym ,obj))
  -                   (or ,@(mapcar (lambda (c) `(eql ,insym ,c)) choices)))))
  +    `(let ((,insym ,obj))
  +       (or ,@(mapcar (lambda (c) `(eql ,insym ,c)) choices)))))
   
   (defmacro inq (obj &rest choices)
     `(in ,obj ,@(mapcar (lambda (c) `',c) choices)))
   
   (defmacro in-if (fn &rest choices)
     (with-gensyms (fn-var)
  -                `(let ((,fn-var ,fn))
  -                   (or ,@(mapcar (lambda (c) `(funcall ,fn-var ,c)) choices)))))
  +    `(let ((,fn-var ,fn))
  +       (or ,@(mapcar (lambda (c) `(funcall ,fn-var ,c)) choices)))))
   
   (defmacro curry (fn)
     " curry fn => function;{{{
  
positive.code: (defun ITOA (num)
    (format nil "~a" num))
  
  ;;; TAKEwHILE function
  ;;; I took this function from Haskell.
  ;;; How can I give the implementation for sequence?
  ;;; Jan. 06th 2014, chiku
  
negative.code:     (rest (rec seq (list -1)))))
  
  ;;; POSITINO-IF-LIST function;{{{
  ;;; This function makes the list constructs from the position of
  ;;; elements in "lst" which satisfies "pred".
  ;;; 16th Nov, 2010
  ;;; This function must be implemented based on POSITION-IF.  Thus I
  ;;; change the order of "pred" and "lst". (I've already been familiar
  ;;; with this order, in any way);}}}
  (defun position-if-list (pred seq &key (key #'identity))
    (if (eql (type-of seq) 'cons)
      (let ((dummy (gensym)))
  