Difference between revisions of "Combinatory logic"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "'''Combinatory logic''' is a notation to eliminate the need for quantified variables in mathematical logic. == Description == It was introduced by...") |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 30: | Line 30: | ||
| − | |||
[[Category:Logic]] | [[Category:Logic]] | ||
Latest revision as of 07:13, 15 September 2016
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic.
Description
It was introduced by Moses Schönfinkel and Haskell Curry, and 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.
See also
- Applicative computing systems
- B, C, K, W system
- Combinatory categorial grammar
- Categorical abstract machine
- Explicit substitution
- Fixed point combinator
- Graph reduction machine
- Lambda calculus
- Lambda calculus and Cylindric algebra, other approaches to modelling quantification and eliminating variables
- Quantifier (logic)
- SKI combinator calculus
- Supercombinator
- To Mock a Mockingbird
External links
- Combinatory logic @ Wikipedia
