For decades, software developers have been slipping jokes into their work. One of the most enduring, clever, and geekily satisfying inside jokes has been hiding in plain sight: the recursive acronym.
In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D.