# Lambda Calculus - Evaluating Expressions #1

# Lambda Calculus - Evaluating Expressions #1

macisamuele + 1 comment What is the objective of the question? Really, I didn't understand what is asked, how I can solve it and how it will be tested. Could someone of you produce a concrete example about the input/output? Thanks in advance

louisrocheAsked to answer + 2 comments Basically, (\x.x+1) is a function who takes an argument x and returns x+1. And you can apply this function to a value, which is 3 in the exercise.

My explanation is probably far from perfect, but that's what I understood from https://en.wikipedia.org/wiki/Lambda_calculus

macisamuele + 0 comments Thanks ... so the main issue was the terminology !!! It was easier from expected

RgoPath + 0 comments Just to be clear, notation \x.x+1 is supposed to be the same as \x -> x+1 ? Thanks!

pierre9 + 0 comments This mix of infix syntax and lambda calculus is a very poorly defined abominationâ€¦

Why not at least stay with the well-defined syntax of lambda calculus with integer arithmetic?

What's wrong with the following?

Î»x.(+ x 1) 3

bh2smith + 1 comment I have no idea what the syntax for this is suppose to be. Am I supposed to physically type the answer to the functional or am I supposed to write code here?

AbhishekVermaIIT + 0 comments Just write the answer in plain text.

If you think the answer evaluates to

*4*, just write`4`

, nothing else and submit !

No more comments

Sort 3 Discussions, By:

Please Login in order to post a comment