Combinatory logic

related topics
{math, number, function}
{theory, work, human}
{work, book, publish}
{school, student, university}
{son, year, death}

Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been used in computer science as a theoretical model of computation and also as a basis for the design of functional programming languages. It is based on combinators. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments.

Contents

Full article ▸

related documents
Relational model
Linear programming
Prolog
System of linear equations
Big O notation
Laplace transform
Spinor
Quadratic reciprocity
Red-black tree
Banach–Tarski paradox
Formal power series
Fibonacci number
Lebesgue integration
Wikipedia:Free On-line Dictionary of Computing/R - S
Trigonometric functions
Lambda calculus
P-adic number
Determinant
Field (mathematics)
Linked list
Bernoulli number
Travelling salesman problem
Binary search algorithm
Computer numbering formats
Binomial coefficient
Discrete cosine transform
Grothendieck topology
Pythagorean triple
Original proof of Gödel's completeness theorem
Distribution (mathematics)