Self-Interpreting Interpreter Based on a comment by George Edison to this question, write the smallest self-interpreting interpreter.


You may use the language of your choosing.
Empty languages do not count.  Your program must be at least two characters long.
The program does not need to interpret the entire language, just a Turing-complete subset of language features (that contains the interpreter).
Quines don't count. 
Do not use your language's built-in eval function or equivalent. Same goes for apply, etc.
Binary Lambda Calculus, 232 bits (29 bytes)

0101000110100000000101011000000000011110000101111110011110000101110011110000001111000010110110111001111100001111100001011110100111010010110011100001101100001011111000011111000011100110111101111100111101110110000110010001101000011010

See
  http://en.wikipedia.org/wiki/Binary_lambda_calculus#Lambda_encoding
for details