LispForum

(defparameter *y* '()) (defun make-point (list) (let ((x (cons (first list) (second list)))) (setf *y* (push x *y*)) (if (cddr list) (make-point (cddr list)) (progn (print (reverse *y*)) (setf *y* '()))))) This isn't a lispy-way to do this. Essentially you are collecting the result of the recursion...

Is there a reason you don't want to use apply?

* (defun select (l)
(apply #'min l))
SELECT
* (SELECT '(1 2 3))
1
* (select '(3 1 2))
1

-r