fact: Definition denoteTerm (phi : nat -> term) :rTerm->term := fix denoteTerm s := match s with | rVar n => var n | rApp s t=> app (denoteTerm s) (denoteTerm t) | rLam s => lam (denoteTerm s) | rConst n => phi n | rRho s => rho (denoteTerm s) end.
imports: Undecidability.L.Tactics(LClos) ZArith FunInd