 As described above, all functions in the lambda calculus are anonymous functions, having no names.They only accept one input variable, with currying used to implement functions with several variables.The syntax of the lambda calculus defines some expressions as valid lambda calculus expressions and some as invalid, just as some strings of characters are valid C programs and some are not.