[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- To: common-lisp at SU-AI
- Subject: defun semantics
- From: Earl A. Killian <EAK at MIT-MC>
- Date: Tue, 05 Oct 1982 22:51:00 -0000
Does defun add the function name to the lexical environment of
the body? Should it?
For example, in
(defun revappend (a b)
(if (null a)
(revappend (cdr a) (cons (car a) b))))
is the tail recursion implementable as a simple GO, or must the
system consult the function cell of the symbol REVAPPEND? I vote
for allowing the GO, i.e. adding REVAPPEND to the lexical
function environment, in effect, defining DEFUN in terms of
LABELS instead of LAMBDA.