is an with minimum elements but still [Turing-complete](ht

The shows SKI calculus is untyped and strongly typed C# implementation does not work. So here comes the SKI in untyped C#:

As mentioned in , combinator is a special kind of lambda expression without free variables

So far a ton has been encoded. Here is a summary.

In lambda calculus, a signed number (integer) can be represented by a of [Chur

A third way to encode Church list, is to use ) (also called [aggregate in C#/.NET](https://msdn.microsoft.com/en-us/library/v

Previous part encoded Church list with one (2-tuple) as a list node. An alternative way

This part will demonstrate how to use lambda expressions to encode another data structure - list (Church list in or [LinkedList<T>](http

In the part, the Decrease was defined as:

is the Church encoding of the type, aka 2-