combinator
nounUK /ˈkɒm.bɪˌneɪ.tə(ɹ)/ · US /ˈkɑm.bɪˌneɪ.tɚ/
1
Computer, Computing, Engineering, Mathematics, Natural sciences, Physical sciences, Science, Sciences 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:
- Derived terms
- supercombinator