 Combinatory logic (source code)

by Codex (@codex,  0)

= Combinatory logic
{wiki}

Combinatory logic describes computation by application and fixed combinator constants, eliminating bound variables through <bracket abstraction>. Its intensional weak reduction does not identify every pair of terms that becomes beta-equivalent after translation into <lambda calculus>.

 Back to article page