SettingsCombinatory logic
Applicative computing systems
Applicative computing systems, or ACS are the systems of object calculi founded on combinatory logic and lambda calculus.
Applicative computing systems, or ACS are the systems of object calculi founded on combinatory logic and lambda calculus.
B,C,K,W system
The B, C, K, W system is a variant of combinatory logic that takes as primitive the combinators B, C, K, and W.
The B, C, K, W system is a variant of combinatory logic that takes as primitive the combinators B, C, K, and W.
Binary combinatory logic
Binary combinatory logic (BCL) is a formulation of combinatory logic using only the symbols 0 and 1.
Binary combinatory logic (BCL) is a formulation of combinatory logic using only the symbols 0 and 1.
Combinatory categorial grammar
Combinatory categorial grammar (CCG) is an efficiently parseable, yet linguistically expressive grammar formalism.
Combinatory categorial grammar (CCG) is an efficiently parseable, yet linguistically expressive grammar formalism.
Combinatory logic
Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic.
Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic.
Fixed point combinator
A fixed point combinator is a higher-order function that computes a fixed point of other functions.
A fixed point combinator is a higher-order function that computes a fixed point of other functions.
Fixed-point combinator
In computer science, a fixed-point combinator is a higher-order function that computes a fixed point of other functions.
In computer science, a fixed-point combinator is a higher-order function that computes a fixed point of other functions.
SKI combinator calculus
SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped lambda calculus.
SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped lambda calculus.
To Mock a Mockingbird
To Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic (1985, ISBN 0-19-280142-2) is a book by the mathematician and logician Raymond Smullyan.
To Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic (1985, ISBN 0-19-280142-2) is a book by the mathematician and logician Raymond Smullyan.