Let listValues (f : naryFunc 2) (n : nat) : list nat.
intros.
induction n as [| n Hrecn].
exact nil.
exact (evalStrongRec _ f n :: Hrecn).
Defined.

Lemma callIsPR :
forall g : nat -> nat,
isPR 1 g -> isPR 2 (fun a recs : nat => codeNth (a - S (g a)) recs).