Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
Church integer
Jump to user comments
A representation of integers as functions invented by AlonzoChurch, 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 purelambda-calculus there are no constants but numbers can be
represented by Church integers.
A Haskell function to return a given Church integer could be
church n = c
c f x = if n == 0 then x else c' f (f x)
c' = church (n-1)