. . . "In mathematical logic and computer science, the lambda calculus, also written as the ??-calculus, is a formal system for studying computable recursive functions, a la computability theory, and related phenomena such as variable binding and substitution." .