fact: Definition codeFreeVarTermTerms : nat -> nat := evalStrongRec 0 (fun t recs : nat => cPair (switchPR (car t) (cdr (codeNth (t - S (cdr t)) recs)) (S (cPair (cdr t) 0))) (switchPR t (codeApp (car (codeNth (t - S (car (pred t))) recs)) (cdr (codeNth (t - S (cdr (pred t))) recs))) 0)).
imports: hydras.Ackermann(primRec cPair) Coq(List Arith) hydras.Ackermann(ListExt) hydras(folProp code Compat815)