combinatory

This article considers the relation between Joy and combinatory logic, a topic that enjoyed some interest in the Haskell community[3].

My initial approach was simplistic (to avoid combinatory explosion) but prime numbers seem obvious in hindsight!

This is what the lambda calculus [1] and combinatory logic [2] are all about.

For Combinatory Categorial Grammar (CCG), the formalism that the author Matthew and I commonly use, it's O(n^6).

As much as I like the combinatory approach, python does not make it very readable or maintainable.

On the other hand, classical Chinese, which presents a roughly similar vintage literature, is a more fluid and combinatory system for type-indistinct component thoughts...

The same could be said of lambda calculus and Combinatory Logic.

Suppose I have a binary tree, created by Combinatory Logic S, K and I primitives.

Begin with the lambda calculus, or better yet combinatory logic.

So, I went to yandex.com and looked up some of the things my web site has info on (combinatory logic, for example).

Found/biologen.pdf) has a small, but interesting section on Combinatory Logic.

New drugs are already being invented by combinatory programs.

For the lambda calculus and the combinatory logic see Hindley and Seldin's "Lambda Calculus and Combinators", published this year, I think.

To complement leethomps answer, combinatory logic is a branch of Mathematics that was started in the 1920s by a mathematician called Moses Shönfinkel which deals with "functions that do stuff and return other functions".

If you've heard of the Curry-Howard correspondence (Curry was responsible for combinatory logic), then combinators provide probably the simplest example of it, since if you give combinators types, you realise you are working with what's called a "Hilbert style" deduction system for propositional logic, which is the simplest sort of formal logical system.