Recursion in LISP without using labels

Question

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]

Subham · Accepted Answer · 2018-03-26 20:32:54Z

5

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.

edited Mar 26, 2018 at 20:32

Subham

3674 silver badges19 bronze badges

answered Jan 26, 2012 at 16:28

Derrick Turk

4,3961 gold badge30 silver badges28 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Recursion in LISP without using labels

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related