In order for combinatory logic to have as a model:

Combinatory logic is the foundation for one style of functional programming language.

Combinatory logic, a more essential way to eliminate variable names.

In the 1930s, some formulations of combinatory logic were found to be inconsistent.

Combinatory logic can be given a variety of interpretations.

The focus of Curry's work were attempts to show that combinatory logic could provide a foundation for mathematics.

This is the well-known encoding of the identity function in combinatory logic.

Despite its simplicity, combinatory logic captures many essential features of computation.

Satisfactory axiomatic formulations of combinatory logic were slow in coming.

The common usage of "type theory" is when those types are used with a combinatory logic (or a term rewrite system).

On 7 December 1920 he delivered a talk to the group where he outlined the concept of combinatory logic.

Other models include combinatory logic and Markov algorithms.

A gentle introduction to combinatory logic, presented as a series of recreational puzzles using bird watching metaphors.

Combinatory logic is a notation to eliminate the need for variables in mathematical logic.

Hence combinatory logic has been used to model some non-strict functional programming languages and hardware.

Specifically, a typed combinatory logic corresponds to a Hilbert system in proof theory.

In combinatory logic the only metaoperator is application in a sense of applying one object to other.

The start of combinatory logic.

Combinatory logic is a model of computation equivalent to the lambda calculus, but without abstraction.

The article that founded combinatory logic.

Conversely, combinatory logic and simply typed lambda calculus are not the only models of computation, either.

Closed lambda expressions are also known as combinators and are equivalent to terms in combinatory logic.

The combinatory logic analogue of Rice's theorem says that there is no complete nontrivial predicate.

Combinatory logic and lambda calculus were both originally developed to achieve a clearer approach to the foundations of mathematics.

Thanks to the correspondence, results from combinatory logic can be transferred to Hilbert-style logic and vice-versa.