I think the reference on the subject of lambda-calculus itself still is Barendregt's book.
Beyond that it pretty much depends on what "part" of lambda-calculus you are interested in : typing ? proof theory ? term rewriting ? functional programming ?
Each of these is a field in itself, and I don't know of any book that covers it all.