LOOP (programming language)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For other uses, see LOOP.

LOOP is a pedagogical programming language designed by Uwe Schöning, along with GOTO and WHILE. The only operations supported in the language are assignment, addition and looping.

The key property of the LOOP language is that the functions it can compute are exactly the primitive recursive functions.[1]

Features[edit]

Each primitive recursive function is LOOP-computable and vice versa.[2]

In contrast to GOTO programs and WHILE programs, LOOP programs always terminate.[3] Therefore, the set of functions computable by LOOP-programs is a proper subset of computable functions (and thus a subset of the computable by WHILE and GOTO program functions).[4]

An example of a total computable function that is not LOOP computable is the Ackermann function.[5]

Formal definition[edit]

Syntax[edit]

LOOP-programs consist of the symbols LOOP, DO, END, :=, +, - and ; as well as any number of variables and constants. LOOP-programs have the following syntax in modified Backus-Naur Form:

\begin{array}{lrl}
 P & := & x_i := x_j + c \\
   &   | & x_i := x_j - c \\
   &   | & P;P \\
   &   | & \mathrm{LOOP} \, x_i \, \mathrm{DO} \, P \, \mathrm{END}
\end{array}

Here, Var := \{ x_0, x_1, ... \} are variable names and c \in \mathbb{N} are constants.

Semantics[edit]

If P is a LOOP program, P is equivalent to a function f: \mathbb{N}^k \rightarrow \mathbb{N}. The variables x_1 through x_k in a LOOP program correspond to the arguments of the function f, and are initialized before program execution with the appropriate values. All other variables are given the initial value zero. The variable x_0 corresponds to the value that f takes when given the argument values from x_1 through x_k.

A statement of the form

x0 := x1 + c

means the value of the constant c is added to the value of the variable x_1, and the result is set as the value of the variable x_0. c can have the value zero, which allows the value of one variable to be assigned to another variable:

x0 := x1 + 0

A statement of the form

x0 := x1 - c

means the value of the constant cis subtracted from the value of the variable x_1, and the result is set as the value of the variable x_0. Negative numbers aren't allowed, and are replaced by zeros.

Variables are allowed to be simultaneously on the left and right side of an assignment. A statement of the form:

x1: = x1 + c

for example, adds the value of the constant c to the variable x_1.

A statement of the form

P1; P2

represents the sequential execution of sub-programs P_1 and P_2, in that order.

A statement of the form

LOOP x DO P END

means the repeated execution of the partial program P a total of x times, where the value that x has at the beginning of the execution of the statement is used. Even if P changes the value of x, it won't affect how many times P is executed in the loop. If x has the value zero, then P is not executed inside the LOOP statement. This allows for branches in LOOP programs, where the conditional execution of a partial program depends on whether a variable has value zero or one.

Example Programs[edit]

Addition[edit]

In the following program, the variable x_0 is set to the sum of the variables x_1 and x_2.

x0 := x1 + 0;
LOOP x2 DO
   x0 := x0 + 1
END

x_0 is first assigned the value of x_1. Then, x_0 is incremented a total of x_2 times by the LOOP statement. This program can be used as a subroutine in other LOOP programs. The LOOP syntax can be extended with the following statement, equivalent to calling the above as a subroutine:

x0 := x1 + x2

Multiplication[edit]

The following LOOP program sets the value of the variable x_0 to the product of the variables x_1 and x_2.

LOOP x1 
  x0 := x0 + x2
END

This multiplication program uses the syntax introduced by the addition subroutine from the previous example. The multiplication is performed here by adding the value of x_2 a total of x_1 times, storing results in x_0.

See also[edit]

Notes and references[edit]

  1. ^ Herbert Enderton (2012). Computability Theory. Academic Press. 
  2. ^ Schöning, Uwe (2008). Theoretische Informatik-kurz gefasst (5 ed.). London: Oxford University Press. p. 105. ISBN 978-3-8274-1824-1. DNB 986529222. 
  3. ^ Schöning, Uwe (2008). Theoretische Informatik-kurz gefasst (5 ed.). London: Oxford University Press. p. 93. ISBN 978-3-8274-1824-1. DNB 986529222. 
  4. ^ Schöning, Uwe (2001). Theoretische Informatik-kurz gefasst (4 ed.). London: Oxford University Press. p. 122. ISBN 3-8274-1099-1. 
  5. ^ Schöning, Uwe (2008). Theoretische Informatik-kurz gefasst (5 ed.). London: Oxford University Press. p. 112. ISBN 978-3-8274-1824-1. DNB 986529222. 

External links[edit]