The B, C, K, W system is a variant of combinatory logic that takes the combinators B, C, K and W as primitive, discovered by the mathematician Haskell Curry in his doctoral research and published in 1930. The B combinator composes two functions, C reverses the order of a function's arguments, K constructs functions that ignore their later arguments, and W duplicates a function's second argument so that two required inputs are supplied from one. The system has the same computational power as the more familiar SKI combinator calculus built from S, K and I, so the two systems can be used interchangeably. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Origin Yeardiscovered by Haskell Curry in his doctoral thesis, results set out in Curry (1930) Connections
Attributed To
Source B, C, K, W System (Wikipedia)
In Branch
Source B, C, K, W System (Wikipedia)
Sources
1. B, C, K, W System (Wikipedia)
Lead section
The B, C, K, W system is a variant of combinatory logic that takes as primitive the combinators B, C, K, and W. This system was discovered by Haskell Curry in his doctoral thesis Grundlagen der kombinatorischen Logik, whose results are set out in Curry (1930).
Attributed To: Haskell Curry, Lead sentence, attribution
discovered by Haskell Curry
In Branch: Logic and Foundations, Lead paragraph
The B, C, K, W system is a variant of combinatory logic that takes as primitive the combinators B, C, K, and W.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.