With the predicates defined in previous part, operators can be defined in _Numeral class

A is a function that returns a Boolean value. In Church encoding of lambda calculus, a predicate is a lambda expression that return

Another benefits of introducing (cheating with) into lambda calculus is - it provides a place to define

In , the Decrease function was a Func<Numeral<Func<Func<T, T>, T>>, Numeral<T>>:

The previous part defined Church numerals in and implemented 0, 1, 2, 3 in 2 different ways. By observing the definition and code, there are some pat

Previous parts showed that , , and [if logic](/posts/l

The if logic is already built in .

After defining Boolean values True and False with functions, now the Boolean logics can be encoded, by functions too.

After clarifying the concepts and terms, a lot of implementation coding starts from this part.

It may not be the best place to discuss function composition in the lambda calculus series. However, function composition will be used a lot in later articles, so here is a brief introduction.