Lambda Calculus, a concept created by Alonzo Church, is included in Java. 

Functional languages try to isolate the transformations of the data from the definition of the data 

Haskell is used for filtering spam in Facebook

The following code is scheme is syntactically correct: 

(\,\, map \,\, (( \,\,lambda  \,\, x) (*\,\, x \,\,x)) \,\,’(1 \,\,-3 \,\,-5 \,\,7))  

With functional programming we can use functions that take parts we know are correct and compose them into more copmplex functions 

The operation (cdr \,\, '( (\,\,(1 \,\,2) \,\,(3\,\, 4)\,\,) \,\, 5 \,\, 6) in Scheme, produces the list (5 \,\, 6) 

Which is the output of the following operation in Scheme: 

( append \,\, '(1 \,\,2) \,\, '(3 \,\,4) )    

Top-down parsers construct leftmost derivations

State diagrams of the form used for lexical analyzers are representations of a class of mathematical machines called finite automata.