Combinatory Logic and Lambda Calculus |
|
Article by Katalin Bimbó presented at the 20th World Congress of Philosophy. Investigates the addition of identity combinators, in the formulae-as-types sense, to combinatory logic.
Online article by John Tromp. Kolmogorov complexity is a recursion theoretic characterisation of randomness.
An online introduction to the lambda calculus by Lloyd Allison, complete with a web form that will evaluate lambda expressions.
Explains why this computer program is well suited to apply to functional application.
|