Dr. Mayer Goldberg
Know all about my research
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 modulo normalization. In this paper, we propose such an encoding operator for proper combinators.
| Publication language | English |
| Pages | 13-16 |
| Journal | Information Processing Letters |
| Volume | 75 |
| Issue number | 1 |
| Publication status | Published - 31.07.2000 |
ASJC Scopus subject areas
Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications
