;; Z Mode version 0.20 of Mon Nov 29 09:25:37 2010 for Z 2.04

;; z1>
(defun big ((<Nat> p) (<Tuple> l))
  (case l
    ((nil) Tuple/nil)
    ((cons x xs) (if (<? x p) (big p xs) (cons x (big p xs))))))
;;  => (Function/defun big (<Arity> | <Nat> <Tuple>) (p l) ((case l ((()) Tuple/nil) ((cons x xs) (if (<? x p) (big p xs) (cons x (big p xs))))))) : <Function>

;; z2>
(defun small ((<Nat> p) (<Tuple> l))
  (case l
    ((nil) Tuple/nil)
    ((cons x xs) (if (>? x p) (small p xs) (cons x (small p xs))))))
;;  => (Function/defun small (<Arity> | <Nat> <Tuple>) (p l) ((case l ((()) Tuple/nil) ((cons x xs) (if (>? x p) (small p xs) (cons x (small p xs))))))) : <Function>

;; z3>
(defun sortsub ((<Tuple> l))
  (case l
    ((nil) Tuple/nil)
    ((cons x xs)
     (let ((a (small x xs)) (b (big x xs))) (append (sortsub a) (cons x (sortsub b)))))))
;;  => (Function/defun sortsub (<Arity> | <Tuple>) (l) ((case l ((()) Tuple/nil) ((cons x xs) (let ((a (small x xs)) (b (big x xs))) (append (sortsub a) (cons x (sortsub b)))))))) : <Function>

;; z4>
(defun sort (&rest (<Nat> l)) (sortsub l))
;;  => (Function/defun sort (<Arity> | &rest <Nat>) (&rest l) ((sortsub l))) : <Function>

;; z5>
(sort 3 5 2 8)
;;  => (2 3 5 8) : <Tuple>

;; z6>
(defun :Seq:/makenil (&idx (:Seq: seq))
  (case seq
    ((nil) seq)
    ((cons x xs) (makenil xs))))
;;  => (Function/defun makenil (<Arity> | :Seq:) (seq) ((case seq ((()) seq) ((cons x xs) (makenil xs))))) : <Function>

;; z7>
(defun :Seq:/reverse (&idx (:Seq: seq))
  (case seq
    ((nil) seq)
    ((cons x xs) (append (reverse xs) (cons x (makenil xs))))))
;;  => (Function/defun reverse (<Arity> | :Seq:) (seq) ((case seq ((()) seq) ((cons x xs) (append (reverse xs) (cons x (makenil xs))))))) : <Function>

;; z8>
(reverse [1 2 3 4])
;;  => [4 3 2 1] : <List>

;; z9>
(reverse '(1 2 3 4))
;;  => (4 3 2 1) : <Tuple>