Dictionary

Words, grammatical forms and meanings linked to the ontology.

combinator en · NOUN

Pronunciation

[ˈkɑm.bɪˌneɪ.ɾɚ] (US)
/ˈkɒm.bɪˌneɪ.tə(ɹ)/ (UK)
(US) audio
/ˈkɑm.bɪˌneɪ.tɚ/ (US)

Meanings

A lambda expression which has no free variables in it.
- M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ⁰. 1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl^([ftp://ftp.cs.ru.nl/pub/CompMath.Found/HBK.ps]), retrieved 15 Jul 2012:

Forms

Spelling	Features	Labels	Source
combinators	Number=Plur		lexicographic

Deriveds

supercombinator

Translations (2)

bg комбинатор (lambda expression with no free variables) · sh kombinator (lambda expression with no free variables)