[Haskell-cafe] Lambda abstraction analogous to imperative pseudo-code?

The Wikipedia article on lambda abstractions (http://en.wikipedia.org/wiki/Lambda_abstraction) has a statement that does not resonate with me: A lambda abstraction is to a functional programming <http://en.wikipedia.org/wiki/Functional_programming> language such as Scheme <http://en.wikipedia.org/wiki/Scheme_programming_language> what pseudo-code <http://en.wikipedia.org/wiki/Pseudo-code> is to an imperative programming <http://en.wikipedia.org/wiki/Imperative_programming> language. Does anyone else find this to be a peculiar statement? If you think it is accurate, could you provide an alternate explanation and/or example to the one in the article?