Reification without evaluation

Constructing self-referential systems, e.g. Brian Smith''s 3-Lisp language, is actually more straightforward than you think. Anyone can build an infinite tower of processors (where each processor implements the processor at the next level below) by employing some common sense and one simple trick. This paper presents a simple programming language interpreter that illustrates how this can be done. Given this basically straightforward technique, processor towers might be easily constructed for a wide variety of systems to enable them to manipulate and reason about themselves.