Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I started learning LISP and I heard that there is some kind of a trick to do recursion without using lables (only using : quote,atom,eq,car,cdr,cons,cond).
I gave it some thought but I can’t think of a way doing this since the function I defined has no name.
I’m guessing its done using cond by I don’t really see how…
[the question is how to implement recursion with the limitations as stated above]
For anonymous recursion, you’re going to need a fixed-point combinator, the most famous of which is known as the Y combinator. Richard Gabriel’s “Why of Y” is a good article which derives and justifies Y in Scheme.