Combinatory logic
Logical formalism using combinators instead of variables
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. 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.
Nº Q1481571 ★
Common · Knowledge
Combinatory logic
Logical formalism using combinators instead of variables
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. 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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. 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, which were introduced by Schönfinkel in 1920 with the idea of providing an analogous way to build up functions — and to remove any mention of variables — particularly in predicate logic. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Combinational logic
Type of digital logic which is implemented by boolean circuits
Nº Q76505 ★★
Proof theory
Branch of mathematical logic
Nº Q852732 ★
Hoare logic
Formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs
Nº Q1375924 ★
Mathematical logic
Subfield of mathematics
Nº Q1166618 ★★★★
Logical consequence
Fundamental concept in logic
Nº Q374182 ★★
Logic Theorist
Computer program
Nº Q4391896 ★★