Block Copy Program

Theorem

Let $k, m, n \in \N$ be natural numbers such that:

• $k \ge 1$;
• $\size {m - n} \ge k$.

The URM program defined as:

Line		Command
$1$		$\map C {m, n}$
$2$		$\map C {m + 1, n + 1}$
$\vdots$		$\vdots$
$k$		$\map C {m + k - 1, n + k - 1}$

is called a block copy program.

It is abbreviated $\map C {m, n, k}$.

It has the effect of copying the contents of registers $R_m, R_{m + 1}, \ldots, R_{m + k - 1}$ into the registers $R_n, R_{n + 1}, \ldots, R_{n + k - 1}$ respectively.

It has length defined as $\map \lambda {\map C {m, n, k} } = k$.

Proof

Immediate.

$\blacksquare$