We present a simple recta-level inference architecture for implementing nested contexts. Based on an explicit non ground representation of both object and control knowledge, it treats contexts as constructs embodying a thight coupling between theories and inference rules. Processing is done via an extension of the traditional "vanilla" interpreter for logic programs allowing one to hop up and down the hierarchy of control clauses representing inference rules. An iterative deepening search of the corresponding state space prevents infinite recursion and ensures successful termination whenever possible. The resulting computational system resembles very much the tower architecture defined for functional programming, whereby each level represents a recta-level operating on the p~g one.