# Church encoding

In mathematics, Church encoding is a means of representing data and operators in the lambda calculus. The data and operators form a mathematical structure which is embedded 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.

The Church encoding is not intended as a practical implementation of primitive data types. Its use is to show that other primitives data types are not required to represent any calculation. The completeness is representational. Additional functions are needed to translate the representation into common data types, for display to people. It is not possible in general to decide if two functions are extensionally equal due to the undecidability of equivalence from Church's theorem. The translation may apply the function in some way to retrieve the value it represents, or look up its value as a literal lambda term.

Lambda calculus is usually interpreted as using intensional equality. There are potential problems with the interpretation of results because of the difference between the intensional and extensional definition of equality.

## Church numerals

Church numerals are the representations of natural numbers under Church encoding. The higher-order function that represents natural number $n$ is a function that maps any function $f$ to its n-fold composition. In simpler terms, the "value" of the numeral is equivalent to the number of times the function encapsulates its argument.

$f^{n}=\underbrace {f\circ f\circ \cdots \circ f} _{n{\text{ times}}}.\,$ All Church numerals are functions that take two parameters. Church numerals 0, 1, 2, ..., are defined as follows in the lambda calculus.

Starting with zero not applying the function at all, proceed with one applying the function once, ...:

The Church numeral 3 represents the action of applying any given function three times to a value. The supplied function is first applied to a supplied parameter and then successively to its own result. The end result is not the numeral 3 (unless the supplied parameter happens to be 0 and the function is a successor function). The function itself, and not its end result, is the Church numeral 3. The Church numeral 3 means simply to do anything three times. It is an ostensive demonstration of what is meant by "three times".

### Calculation with Church numerals

Arithmetic operations on numbers may be represented by functions on Church numerals. These functions may be defined in lambda calculus, or implemented in most functional programming languages (see converting lambda expressions to functions).

$\operatorname {plus} \equiv \lambda m.\lambda n.\lambda f.\lambda x.m\ f\ (n\ f\ x)$ $\operatorname {succ} \equiv \lambda n.\lambda f.\lambda x.f\ (n\ f\ x)$ $\operatorname {mult} \equiv \lambda m.\lambda n.\lambda f.m\ (n\ f)$ $\operatorname {exp} \ m\ n=m^{n}=n\ m$ which gives the lambda expression,

$\operatorname {exp} \equiv \lambda m.\lambda n.n\ m$ $\operatorname {pred} \equiv \lambda n.\lambda f.\lambda x.n\ (\lambda g.\lambda h.h\ (g\ f))\ (\lambda u.x)\ (\lambda u.u)$ A Church numeral applies a function n times. The predecessor function must return a function that applies its parameter n - 1 times. This is achieved by building a container around f and x, which is initialized in a way that omits the application of the function the first time. See predecessor for a more detailed explanation.

The subtraction function can be written based on the predecessor function.

$\operatorname {minus} \equiv \lambda m.\lambda n.(n\operatorname {pred} )\ m$ ### Table of functions on Church numerals

* Note that in the Church encoding,

### Translation with other representations

Most real-world languages have support for machine-native integers; the church and unchurch functions convert between nonnegative integers and their corresponding Church numerals. The functions are given here in Haskell, where the \ corresponds to the λ of Lambda calculus. Implementations in other languages are similar.

type Church a = (a -> a) -> a -> a

church :: Integer -> Church Integer
church 0 = \f -> \x -> x
church n = \f -> \x -> f (church (n-1) f x)

unchurch :: Church Integer -> Integer
unchurch cn = cn (+ 1) 0


## Church Booleans

Church Booleans are the Church encoding of the Boolean values true and false. Some programming languages use these as an implementation model for Boolean arithmetic; examples are Smalltalk and Pico.

Boolean logic may be considered as a choice. The Church encoding of true and false are functions of two parameters;

• true chooses the first parameter.
• false chooses the second parameter.

The two definitions are known as Church Booleans;

$\operatorname {true} \equiv \lambda a.\lambda b.a$ $\operatorname {false} \equiv \lambda a.\lambda b.b$ This definition allows predicates (i.e. functions returning logical values) to directly act as if-clauses. A function returning a Boolean, which is then applied to two parameters, returns either the first or the second parameter;

$\operatorname {predicate} \ x\ \operatorname {then-clause} \ \operatorname {else-clause}$ evaluates to then-clause if predicate x evaluates to true, and to else-clause if predicate x evaluates to false.

Because true and false choose the first or second parameter they may be combined to provide logic operators,

$\operatorname {and} =\lambda p.\lambda q.p\ q\ p$ $\operatorname {or} =\lambda p.\lambda q.p\ p\ q$ $\operatorname {not} _{1}=\lambda p.\lambda a.\lambda b.p\ b\ a$ - This is only a correct implementation if the evaluation strategy is applicative order.
$\operatorname {not} _{2}=\lambda p.p\ (\lambda a.\lambda b.b)\ (\lambda a.\lambda b.a)=\lambda p.p\operatorname {false} \operatorname {true}$ - This is only a correct implementation if the evaluation strategy is normal order.
$\operatorname {xor} =\lambda a.\lambda b.a\ (\operatorname {not} \ b)\ b$ $\operatorname {if} =\lambda p.\lambda a.\lambda b.p\ a\ b$ Some examples:

$\operatorname {and} \operatorname {true} \operatorname {false} =(\lambda p.\lambda q.p\ q\ p)\ \operatorname {true} \ \operatorname {false} =\operatorname {true} \operatorname {false} \operatorname {true} =(\lambda a.\lambda b.a)\operatorname {false} \operatorname {true} =\operatorname {false}$ $\operatorname {or} \operatorname {true} \operatorname {false} =(\lambda p.\lambda q.p\ p\ q)\ (\lambda a.\lambda b.a)\ (\lambda a.\lambda b.b)=(\lambda a.\lambda b.a)\ (\lambda a.\lambda b.a)\ (\lambda a.\lambda b.b)=(\lambda a.\lambda b.a)=\operatorname {true}$ $\operatorname {not} _{1}\ \operatorname {true} =(\lambda p.\lambda a.\lambda b.p\ b\ a)(\lambda a.\lambda b.a)=\lambda a.\lambda b.(\lambda a.\lambda b.a)\ b\ a=\lambda a.\lambda b.(\lambda x.b)\ a=\lambda a.\lambda b.b=\operatorname {false}$ $\operatorname {not} _{2}\ \operatorname {true} =(\lambda p.p\ (\lambda a.\lambda b.b)(\lambda a.\lambda b.a))(\lambda a.\lambda b.a)=(\lambda a.\lambda b.a)(\lambda a.\lambda b.b)(\lambda a.\lambda b.a)=(\lambda b.(\lambda a.\lambda b.b))\ (\lambda a.\lambda b.a)=\lambda a.\lambda b.b=\operatorname {false}$ ## Predicates

A predicate is a function that returns a Boolean value. The most fundamental predicate is $\operatorname {IsZero}$ , which returns $\operatorname {true}$ if its argument is the Church numeral $0$ , and $\operatorname {false}$ if its argument is any other Church numeral:

$\operatorname {IsZero} =\lambda n.n\ (\lambda x.\operatorname {false} )\ \operatorname {true}$ The following predicate tests whether the first argument is less-than-or-equal-to the second:

$\operatorname {LEQ} =\lambda m.\lambda n.\operatorname {IsZero} \ (\operatorname {minus} \ m\ n)$ ,

Because of the identity,

$x=y\equiv (x<=y\land y<=x)$ The test for equality may be implemented as,

$\operatorname {EQ} =\lambda m.\lambda n.\operatorname {and} \ (\operatorname {LEQ} \ m\ n)\ (\operatorname {LEQ} \ n\ m)$ ## Church pairs

{{#invoke:see also|seealso}} Church pairs are the Church encoding of the pair (two-tuple) type. The pair is represented as a function that takes a function argument. When given its argument it will apply the argument to the two components of the pair. The definition in lambda calculus is,

$\operatorname {pair} \equiv \lambda x.\lambda y.\lambda z.z\ x\ y$ $\operatorname {first} \equiv \lambda p.p\ (\lambda x.\lambda y.x)$ $\operatorname {second} \equiv \lambda p.p\ (\lambda x.\lambda y.y)$ For example,

$\operatorname {first} \ (\operatorname {pair} \ a\ b)$ $=(\lambda p.p\ (\lambda x.\lambda y.x))\ ((\lambda x.\lambda y.\lambda z.z\ x\ y)\ a\ b)$ $=(\lambda p.p\ (\lambda x.\lambda y.x))\ (\lambda z.z\ a\ b)$ $=(\lambda z.z\ a\ b)\ (\lambda x.\lambda y.x)$ $=(\lambda x.\lambda y.x)\ a\ b=a$ ## List encodings

An (immutable) list is constructed from list nodes. The basic operations on the list are;

Function Description
nil Construct an empty list.
isnil Test if list is empty.
cons Prepend a given value to a (possibly empty) list.
head Get the first element of the list.
tail Get the rest of the list.

Three different representations of lists are given.

• Build each list node from two pairs (to allow for empty lists).
• Build each list node from one pair.
• Represent the list using the right fold function.

### Two pairs as a list node

A nonempty list can implemented by a Church pair;

• Second contains the tail.

However this does not give a representation of the empty list, because there is no "null" pointer. To represent null, the pair may be wrapped in another pair, giving free values,

• First - Is the null pointer (empty list).
• Second.Second contains the tail.

Using this idea the basic list operations can be defined like this:

In a nil node second is never accessed, provided that head and tail are only applied to nonempty lists.

### One pair as a list node

Alternatively, define

$\operatorname {cons} \equiv \operatorname {pair}$ $\operatorname {head} \equiv \operatorname {first}$ $\operatorname {tail} \equiv \operatorname {second}$ $\operatorname {nil} \equiv \operatorname {false}$ $\operatorname {isnil} \equiv \lambda l.l(\lambda h.\lambda t.\lambda d.\operatorname {false} )\operatorname {true}$ where the last definition is a special case of the general

$\operatorname {process-list} \equiv \lambda l.l(\lambda h.\lambda t.\lambda d.\operatorname {head-and-tail-clause} )\operatorname {nil-clause}$ ### Represent the list using right fold

As an alternative to the encoding using Church pairs, a list can be encoded by identifying it with its right fold function. For example, a list of three elements x, y and z can be encoded by a higher-order function which when applied to a combinator c and a value n returns c x (c y (c z n)).

$\operatorname {nil} \equiv \lambda c.\lambda n.n$ $\operatorname {isnil} \equiv \lambda l.l\ (\lambda h.\lambda t.\operatorname {false} )\ \operatorname {true}$ $\operatorname {cons} \equiv \lambda h.\lambda t.\lambda c.\lambda n.c\ h\ (t\ c\ n)$ $\operatorname {head} \equiv \lambda l.l\ (\lambda h.\lambda t.h)\ \operatorname {false}$ $\operatorname {tail} \equiv \lambda l.\lambda c.\lambda n.l\ (\lambda h.\lambda t.\lambda g.g\ h\ (t\ c))\ (\lambda t.n)\ (\lambda h.\lambda t.t)$ ## Derivation of predecessor function

The predecessor function used in the Church Encoding is,

To build the predecessor we need a way of applying the function 1 less time. A numeral n applies the function f n times to x. The predecessor function must use the numeral n to apply the function n-1 times.

Before implementing the predecessor function, here is a scheme that wraps the value in a container function. We will define new functions to use in place of f and x, called inc and init. The container function is called value. The left hand side of the table shows a numeral n applied to inc and init.

The general recurrence rule is,

$\operatorname {inc} \ (\operatorname {value} \ v)=\operatorname {value} \ (f\ v)$ If there is also a function to retrieve the value from the container (called extract),

$\operatorname {extract} \ (\operatorname {value} \ v)=v$ Then extract may be used to define the samenum function as,

$\operatorname {samenum} =\lambda n.\lambda f.\lambda x.\operatorname {extract} \ (n\operatorname {inc} \operatorname {init} )=\lambda n.\lambda f.\lambda x.\operatorname {extract} \ (\operatorname {value} \ (n\ f\ x))=\lambda n.\lambda f.\lambda x.n\ f\ x=\lambda n.n$ The samenum function is not intrinsically useful. However, as inc delegates calling of f to its container argument, we can arrange that on the first application inc receives a special container that ignores its argument allowing to skip the first application of f. Call this new initial container const. The right hand side of the above table shows the expansions of n inc const. Then by replacing init with const in the expression for the same function we get the predecessor function,

$\operatorname {pred} =\lambda n.\lambda f.\lambda x.\operatorname {extract} \ (n\operatorname {inc} \operatorname {const} )=\lambda n.\lambda f.\lambda x.\operatorname {extract} \ (\operatorname {value} \ ((n-1)\ f\ x))=\lambda n.\lambda f.\lambda x.(n-1)\ f\ x=\lambda n.(n-1)$ As explained below the functions inc, init, const, value and extract may be defined as,

Which gives the lambda expression for pred as,

$\operatorname {pred} =\lambda n.\lambda f.\lambda x.n\ (\lambda g.\lambda h.h\ (g\ f))\ (\lambda u.x)\ (\lambda u.u)$ ## Division

Division of natural numbers may be implemented by,

$n/m=\operatorname {if} \ n>=m\ \operatorname {then} \ 1+(n-m)/m\ \operatorname {else} \ 0$ Calculating $n-m$ takes many beta reductions. Unless doing the reduction by hand, this doesn't matter that much, but it is preferable to not have to do this calculation twice. The simplest predicate for testing numbers is IsZero so consider the condition.

$\operatorname {IsZero} \ (\operatorname {minus} \ n\ m)$ But this condition is equivalent to $n>m$ , not $n>=m$ . If this expression is used then the mathematical definition of division given above is translated into function on Church numerals as,

$\operatorname {divide1} \ n\ m\ f\ x=(\lambda d.\operatorname {IsZero} \ d\ (0\ f\ x)\ (f\ (\operatorname {divide1} \ d\ m\ f\ x)))\ (\operatorname {minus} \ n\ m)$ As desired, this definition has a single call to $\operatorname {minus} \ n\ m$ . However the result is that this formula gives the value of $(n-1)/m$ .

This problem may be corrected by adding 1 to n before calling divide.The definition of divide is then,

$\operatorname {divide} \ n=\operatorname {divide1} \ (\operatorname {succ} \ n)$ divide1 is a recursive definition. The Y combinator may be used to implement the recursion. Create a new function called div by;

to get,

$\operatorname {div} =\lambda c.\lambda n.\lambda m.\lambda f.\lambda x.(\lambda d.\operatorname {IsZero} \ d\ (0\ f\ x)\ (f\ (c\ d\ m\ f\ x)))\ (\operatorname {minus} \ n\ m)$ Then,

$\operatorname {divide} =\lambda n.\operatorname {divide1} \ (\operatorname {succ} \ n)$ where,

$\operatorname {divide1} =Y\ \operatorname {div}$ $\operatorname {succ} =\lambda n.\lambda f.\lambda x.f\ (n\ f\ x)$ $Y=\lambda f.(\lambda x.x\ x)\ (\lambda x.f\ (x\ x))$ $0=\lambda f.\lambda x.x$ $\operatorname {IsZero} =\lambda n.n\ (\lambda x.\operatorname {false} )\ \operatorname {true}$ $\operatorname {true} \equiv \lambda a.\lambda b.a$ $\operatorname {false} \equiv \lambda a.\lambda b.b$ $\operatorname {minus} =\lambda m.\lambda n.n\operatorname {pred} m$ $\operatorname {pred} =\lambda n.\lambda f.\lambda x.n\ (\lambda g.\lambda h.h\ (g\ f))\ (\lambda u.x)\ (\lambda u.u)$ Gives,

$\lambda$