supercombinator
UK /ˈsuː.pəˌkɒm.bɪˌneɪ.tə(ɹ)/US /ˈsuː.pɚˌkɑm.bɪˌneɪ.tɚ/
noun1
- A mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where all the subexpressions are supercombinators.
- Supercombinators are used in the implementation of functional languages.
forms
supercombinators