Category Theory via C# (1) Fundamentals
Category theory is a theoretical framework to describe abstract structures and relations in mathematics, first introduced by and [Saun
1243 words
|
6 minutes
Lambda Calculus via C# (8) Undecidability of Equivalence
All the previous parts demonstrated what can do – defining functions to model the computing, applying functions to execute the computing
1217 words
|
6 minutes
Lambda Calculus via C# (6) Combinatory Logic
In lambda calculus, the primitive is function, which can have free variables and bound variables. was introduced by [Moses Schönfink
3659 words
|
18 minutes
Lambda Calculus via C# (5) List
In lambda calculus and Church encoding, there are various ways to represent a list with anonymous functions.
2330 words
|
12 minutes
Lambda Calculus via C# (4) Tuple and Signed Numeral
Besides modeling values like Boolean and numeral, anonymous function can also model data structures. In Church encoding, Church pair is an approach to use functions to represent a tuple of 2 items.
2668 words
|
13 minutes
Lambda Calculus via C# (3) Numeral, Arithmetic and Predicate
Anonymous functions can also model numerals and their arithmetic. In Church encoding, a natural number n is represented by a function that calls a given function for n times. This representation is ca
3152 words
|
16 minutes
Lambda Calculus via C# (2) Church Encoding: Boolean and Logic
Lambda calculus is a formal system for function definition and function application, so in lambda calculus, the only primitive is anonymous function. Anonymous function is actually very powerful. With
1990 words
|
10 minutes
Lambda Calculus via C# (1) Fundamentals
Lambda calculus (aka λ-calculus) is a theoretical framework to describe function definition, function application, function recursion, and uses functions and function application to express computatio
1773 words
|
9 minutes