Abstract

Gödelization 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call