The AI-powered English dictionary
plural combinators
(computer science) A lambda expression which has no free variables in it. quotations examples
M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ0.
1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl, retrieved 2012-07-15