# Tag Info

### What is the "question" that programming language theory is trying to answer?

The overall purpose of PLT is to make industrial software engineering (in a general sense) cheaper (also in a general sense), through optimising the most important tool (programming languages) and ...
• 10.3k

### Incomplete basis of combinators

[Expanding the comment into an answer.] First, just a clarification about counting bound variables in a combinator (= closed term) $t$. I interpret the question as asking about  \text{the total ...
• 4,319
Accepted

### Upper bound on Chaitin's constant for lambda calculus and SKI combinatory logic

You probably want to look at David et al's paper, Asymptotically Almost All λ-terms are Strongly Normalizing: We present a quantitative analysis of various (syntactic and behavioral) properties of ...
• 31.6k

### Smallest possible universal combinator

It should be noted that finding combinators with certain reduction properties is always difficult, and finding the smallest such combinator may easily be undecidable (for trivial reasons, as it may be ...
• 13.2k
Accepted

• 10.3k