http://en.wikipedia.org/wiki/Lambda_calculus
One fascinating area for the use of lambda calculus is as a conceptual basis for the implementation of functional programming languages - indeed you could argue that a language is functional iff it can be mapped to the lambda calculus.
Edit: Although it is rather old (like me!) I have fond memories of "The Implementation of Functional Programming Languages" by Simon Peyton Jones:
http://research.microsoft.com/en-us/um/people/simonpj/papers... [PDF]
Another very cool thing is that you can translate expressions in the lambda calculus to SK[I] combinators - which means you can actually implement real programs (including recursion - e.g. using the Y-combinator) as two extremely simple functions - not very efficiently, mind you... :-)
Lambda calculus is a higher-order, applicative functional language. There are other kinds of functional language.
For example, kappa calculus is first-order. Joy is a pure functional programming language which is based around composition instead of application.
A physical-world analogy would be the billiard-ball model of atoms, which works well to describe the behaviour of gasses.
Edit: I don't think javajosh's question is unreasonable - not sure why it is getting downvoted.