Gödelisation in the $\lambda$-Calculus

Mayer Goldberg

July 1995


Gödelisation 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. In this paper, we propose such an encoding operator for proper combinators.

Please refer to the revised version BRICS-RS-96-6


Last modified: 2003-06-09 by webmaster.