Motivation Computable functions are a fundamental concept within computer science and mathematics. The lambda calculus provides simple semantics for computation which are useful for formally studying properties of computation. The lambda calculus incorporates two simplifications that make its semantics simple. The first simplification is that the lambda calculus treats functions "anonymously;" it does not give them explicit names. For example, the function can be rewritten in anonymous form as (which is read as "a tuple of and is mapped to "). Similarly, the function can be rewritten in anonymous form as where the input is simply mapped to itself.
motivation computable functions are a fundamental concept within computer science and mathematics the lambda calculus provides simple semantics for computation which are useful for formally studying properties of computation the lambda calculus incorporates two simplifications that make its semantics simple the first simplification is that the lambda calculus treats functions "anonymously;" it does not give them explicit names for example the function can be rewritten in anonymous form as (which is read as "a tuple of and is mapped to ") similarly the function can be rewritten in anonymous form as where the input is simply mapped to itself