successor function

views updated

successor function
1. The function SUCC that occurs in programming languages such as Ada or Pascal and produces the next element of an enumeration type. Typically SUCC(4) produces 5 SUCC(`A') produces `B'

2. The function S : NN for which S(n) = n + 1

where N is the nonnegative integers. S plays a crucial role in recursive function theory, particularly in the definition of primitive recursive functions.