Most existing reflective languages do not attack the problem of efficiency in behavioral reflection. We have seen that if 3-Lisp possesses a compiled implementation, this implementation is based on several hard constraints put on the design of its processor. To go further in this direction, we need to answer the following question: what does it mean to compile a behaviorally reflective language? To answer this question, we look at reflection from the point of view of binding times. We then derive the notion of static behavioral reflection related to compilation.