Anaphoric Lambda? 
Author Message
 Anaphoric Lambda?

Paul Graham's book "On Lisp" has a macro that binds the variable self to
the current function. This gives anonymous functions without recourse to
labels. A recursive anonymous function calls itself::

(lambda (x)
    (self ....args...))

This seems to be very simple. So

* Why not add this to the interpreter/compiler? The Interpreter always
knows which function it is currently applying...

* Was this ever considered back in the early days?

* Was this ever considered in the standards?


Tue, 12 Sep 2000 03:00:00 GMT  
 [ 1 post ] 

 Relevant Pages 

1. Anaphoric Lambda?

2. #'(lambda ... (lambda

3. (lambda ()) vs #'(lambda ())

4. no re-binding of nested-scope locals, no re-binding in lambda, no,,, {was Re: lambda)

5. Anaphoric macros and packages

6. anaphoric setf?

7. Anaphoric macros

8. Can global refs be freed from lambda-lifting ? ( was Is Lambda-lifting necessary ? )

9. (lambda (arg) (...)) vs (lambda args (...))

10. what diff #'(lambda...) to (lambda...)?

11. Subroutine, lambda abstraction, tacit form

12. ST equivalent of lambda functions?


Powered by phpBB® Forum Software