anchor.diff:     > (zip list '(1 2 3) '(4 5 6) '(7 8 9))
      '((1 4 7) (2 5 8) (3 6 9))
      ```"
  -  (cond
  -    [(any nil? xss)
  -     '()]
  -    [true
  -      (cons (fn (unpack (cars xss)))
  -            (zip fn (unpack (cdrs xss))))]))
  -
  +  (let* [(lenghts (map # xss))
  +         (out '())]
  +    (for i 1 (min (unpack lenghts)) 1
  +      (push-cdr! out (fn (unpack (nths xss i)))))
  +    out))
   
   ;; AUTOMATICALLY GENERATED
   ;; DO NOT EDIT please.
  
positive.code:    > (reverse (range 1 10))
     '(10 9 8 7 6 5 4 3 2 1)
     ```"
    (cond
      [(! (exists? acc)) (reverse xs '())]
      [(nil? xs) acc]
      [true (reverse (cdr xs) (cons (car xs) acc))]))
  
  (defun accumulate-with (f ac z xs)
    "A composition of [[foldr]] and [[map]]
  
negative.code: (import base)
  (import lua/table)
  (import type (list? nil? assert-type! exists? falsey? eq?))
  (import lua/math (min max))
  
  (defun car (x)
    "Return the first element present in the list X. This function operates
  