Godelization in the lambda calculus

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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

Original languageEnglish
Pages (from-to)13-16
Number of pages4
JournalInformation Processing Letters
Issue number1
StatePublished - 31 Jul 2000

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Godelization in the lambda calculus'. Together they form a unique fingerprint.

Cite this