### Recursion in lambda-calculus

Verfasst:

**6. Mär 2014 16:52**Hi,

in the full (untyped) lambda-calculus it seems to be possible to write recursive functions like a recursive implementation of a factorial function. For instance in the Pierce book they were able to evaluate the result of \(factorial\:3\) by using a fix-point combinator (page 67).

Do we have discussed the full lambda-calculus in the lecture? Are there any restrictions in our (untyped) lambda-calculus?

As far as I remember, we were not able to type recursive terms. Does the problem occurs when typing such a term or before?

Thank you for an answer,

kind regards

Timo Bähr

in the full (untyped) lambda-calculus it seems to be possible to write recursive functions like a recursive implementation of a factorial function. For instance in the Pierce book they were able to evaluate the result of \(factorial\:3\) by using a fix-point combinator (page 67).

Do we have discussed the full lambda-calculus in the lecture? Are there any restrictions in our (untyped) lambda-calculus?

As far as I remember, we were not able to type recursive terms. Does the problem occurs when typing such a term or before?

Thank you for an answer,

kind regards

Timo Bähr