✨ Read this trending post from Hacker News 📖 📂 Category: ✅ Key idea: de Bruijn Numerals assumptions in this post understanding of pure lambda calculus zero-based de Bruijn indices instead of named variables nnn consecutive lambdas are written as λn\lambda^nλn ⟨n⟩e\langle n\rangle_e⟨n⟩e encodes n∈N0n\in\mathbb💬_0n∈N0 as a lambda calculus term of encoding eee S(n)S(n)S(n) is the Peano successor function There are many ways to encode numbers and do arithmetic in the pure lambda calculus, for example using unary Church numerals, various nnn-ary representations, and the Scott encoding. A method that I have not seen yet is an encoding by reference…
