The results of the stepwise computations are saved in memory slots, for possible reuse. The extended calculus reduces unnecessary iterations of assignments, which are chains of unnecessary assignments, by copying values of terms from one memory slot to another, without any essential algorithmic changes. The primary applications of the chain-free type theory of recursion are for computational semantics of formal and natural languages, including programming languages and compilers.