Godelization in the lambda calculus
Godelization is a meta-linguistic encoding of terms in a language. While it is impossible to define an operator in the lambda calculus which encodes all closed lambda expressions, it is possible to construct restricted versions of such an encoding operator module normalization. In this paper, we propose such an encoding operator for proper combinators. (C) 2000 Elsevier Science B.V. All rights reserved.
godelization lambda calculus programming calculi