is the Church encoding of the type, aka 2-

With the predicates defined in , operators can be defined in [ Numeral class](/posts/lambda-calculus-via-c-sharp-9-wrapping

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 .