FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -Functional programming languages are based on the lambda-calculus. The lambda-calculus grew out of an attempt by Alonzo Church and Stephen Kleene in the early 1930s to formalize the notion of computability (also known as constructibility and effective calculability).

Detailed explanation-2: -Functional Programming is based on Lambda Calculus: It gives the definition of what is computable.

Detailed explanation-3: -The abstraction form lets us define functions. In lambda calculus, an abstraction (a function) takes one parameter-the x in ( x . M ) and has a body-the M . M is any possible expression in lambda calculus.

Detailed explanation-4: -Lambda calculus (also written as -calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation that can be used to simulate any Turing machine.

Detailed explanation-5: -Lambda expressions-also known as “anonymous functions”-allow us to create and use a function in a single line. They are useful when we need a short function that will be used only once. They are mostly used in conjunction with the map, filter and the sort methods, which we will see later in the article.