The theory of numberings studies uniform computations for classes of mathematical objects. A large body of literature is devoted to investigations of computable numberings, i.e. uniform enumerations for families of computably enumerable sets, and the reducibility among these numberings. This reducibility, induced by Turing computable functions, aims to classify the algorithmic complexity of numberings. The paper is inspired by the recent advances in the area of punctual algebraic structures. We recast the classical studies of numberings in the punctual setting—we study punctual numberings, i.e. uniform computations for families of primitive recursive functions. The reducibility between punctual numberings is induced by primitive recursive functions. This approach gives rise to upper semilattices of degrees, which are called Rogers pr-semilattices. We prove that any infinite Rogers pr-semilattice is dense and does not have minimal elements. Furthermore, we give an example of infinite Rogers pr-semilattice, which is a lattice. These results exhibit interesting phenomena, which do not occur in the classical case of computable numberings and their semilattices.