Godel 1958: interprets Heyting-arithmetic into computable functionals of finite type T; primitive-recursive over higher types; embedded in modern proof-theory.
Godel 1958: interprets Heyting-arithmetic into computable functionals of finite type T; primitive-recursive over higher types; embedded in modern proof-theory.