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 : N → N 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.
"successor function." A Dictionary of Computing. . Encyclopedia.com. (August 17, 2018). http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/successor-function
"successor function." A Dictionary of Computing. . Retrieved August 17, 2018 from Encyclopedia.com: http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/successor-function