Church integer – Computing Reference – eLook.org


Church integer



A representation of integers as functions invented by Alonzo Church, inventor of lambda-calculus.

The integer N is represented as a higher-order function which applies a given function N times to a given expression.

In the pure lambda-calculus there are no constants but numbers can be represented by Church integers.

A Haskell function to return a given Church integer could be written:

church n = c where c f x = if n == 0 then x else c’ f (f x) where c’ = church (n-1)

A function to turn a Church integer into an ordinary integer:

unchurch c = c (+1) 0

See also von Neumann integer.

< Previous Terms Terms Containing Church integer Next Terms >
chroot
CHRP
chug
chunker
Church, Alonzo
Church integer
lambda-calculus
Church of the SubGenius
Church-Rosser Theorem
ci
CI$
CICERO

Best casinos
Glory Casino is one of Bangladesh's most prominent and generous online casinos, with 3,000+ slots and live games from top providers. Beginner-friendly and mobile-ready, it offers big welcome bonuses, fast payouts, and fair winning odds.
Wintomic Casino offers a calm, well-structured gaming experience with a wide range of quality slots and live games from trusted providers. With secure SSL encryption, fair RNG play, and clear bonus terms, it's built for smooth, reliable fun.
Play the best casino games on Banger Casino across mobile and desktop and win real money! Enjoy a massive slots library, live dealers, and table games, plus a 125% welcome bonus up to €250 under a valid Curaçao license. Sign up today.
Divine Casino delivers a secure, stylish gaming experience with thousands of slots, live dealers, crash games, and sports betting. Claim a generous welcome bonus with free spins, enjoy fast withdrawals, and play with 24/7 support.

© Copyright 2026 elook.games
Powered by WordPress | Mercury Theme