We explore the theoretical limits of statically typed embedding by studying typed lambda calculi which allow to embed themself including their own type-system. In fact, we propose the Fω* calculus as a possible base for host languages because it allows such a metacircular embedding. We believe that metacircular embedding plays a similar role for statically typed languages as metacircular interpretation for untyped languages.