(en.wikipedia.org) Church encoding - Wikipedia

ROAM_REFS: https://en.wikipedia.org/wiki/Church_encoding

In mathematics, Church encoding is a means of representing data and operators in the lambda calculus. The Church numerals are a representation of the natural numbers using lambda notation. The method is named for Alonzo Church, who first encoded data in the lambda calculus this way.

Terms that are usually considered primitive in other notations (such as integers, Booleans, pairs, lists, and tagged unions) are mapped to higher-order functions under Church encoding. The Church–Turing thesis asserts that any computable operator (and its operands) can be represented under Church encoding. In the untyped lambda calculus the only primitive data type is the function.

Local Graph

org-roam b62e6648-2208-48f8-9825-0f03dbd2ca5b (en.wikipedia.org) Church encoding - ... //en.wikipedia.org/wiki/Mathematics https://en.wikipedia.org/wiki/Mathematics b62e6648-2208-48f8-9825-0f03dbd2ca5b->//en.wikipedia.org/wiki/Mathematics //en.wikipedia.org/wiki/Lambda_calculus https://en.wikipedia.org/wiki/Lambda_calculus b62e6648-2208-48f8-9825-0f03dbd2ca5b->//en.wikipedia.org/wiki/Lambda_calculus //en.wikipedia.org/wiki/Alonzo_Church https://en.wikipedia.org/wiki/Alonzo_Church b62e6648-2208-48f8-9825-0f03dbd2ca5b->//en.wikipedia.org/wiki/Alonzo_Church //en.wikipedia.org/wiki/Higher-order_function https://en.wikipedia.org/wiki/Higher-order_function b62e6648-2208-48f8-9825-0f03dbd2ca5b->//en.wikipedia.org/wiki/Higher-order_function //en.wikipedia.org/wiki/Church–Turing_thesis https://en.wikipedia.org/wiki/Church–Turing_thesis b62e6648-2208-48f8-9825-0f03dbd2ca5b->//en.wikipedia.org/wiki/Church–Turing_thesis