supercombinator
Pronunciations (3)
-
/ˈsuː.pəˌkɒm.bɪˌneɪ.tə(ɹ)/
Pronunciation notes
- UK
-
/ˈsuː.pɚˌkɑm.bɪˌneɪ.tɚ/
Pronunciation notes
- US
-
[ˈsuː.pɚˌkɑm.bɪˌneɪ.ɾɚ]
Pronunciation notes
- US
Noun
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.
- Examples
-
Supercombinators are used in the implementation of functional languages.
Word forms
supercombinators