Re: [Haskell-cafe] about the Godel Numbering for untyped lambda calculus

2009-03-31 Thread John Tromp
> I am reading the book "The lambda calculus: Its syntax and Semantics" in the > chapter about Godel Numbering but I am confused in some points. > > We know for Church Numerals, we have Cn = \fx.f^n(x) for some n>=0, > i.e. C0= \fx.x and C > 1 = \fx.fx. > > >From the above definition, I could guess

Re: [Haskell-cafe] about the Godel Numbering for untyped lambda calculus

2009-03-31 Thread wren ng thornton
John Tromp wrote: I am reading the book "The lambda calculus: Its syntax and Semantics" in the chapter about Godel Numbering but I am confused in some points. We know for Church Numerals, we have Cn = \fx.f^n(x) for some n>=0, i.e. C0= \fx.x and C 1 = \fx.fx. >From the above definition, I could