New posts in lambda-calculus

What breaks the Turing Completeness of simply typed lambda calculus?

Is $S(K (S I I))(S(S (K S)(S(K K)I)))(K (S I I))$ really a fixed-point combinator or is this a typo?

General notation for $\lambda x_1 … x_n.x_i$? Can it be called $\pi^n_i$?

Lambda Calculus functions that are fixed-points of themselves

How helpful is knowing lambda calculus? [closed]

The Power of Lambda Calculi

In $\lambda$-calculus, is there a way to undo an application $(AB)$ to get back just $A$ or just $B$?

Fixed points in computability and logic

lambda calculus and category theory

Opposite Direction of Church-Rosser Theorem

Convertibility of Two Lambda Expressions Equivalent to Existence of a Common Reduct

What does this typed lambda-calculus notation mean?

Chained substitutions of an application in $\lambda$-calculus, e.g. $AB[C/x][D/y]$

Lambda Calculus Beta reductions

How to Prove a Lemma in Lambda Calculus about Contexts

The "functions" of untyped lambda calculus are not (set theoretic) functions so what are they?

Why can't we formalize the lambda calculus in first order logic?

Why are λ-calculus optimal evaluators able to compute big modular exponentiations without formulas?

What is the cardinality of the set of untyped $\lambda$-calculus functions? I know it’s an infinity, but is it countable or uncountable?

Why is $\lambda x.\lambda y.xy$ not reducible to $\lambda x.x$?