supercombinator
Jump to navigation
Jump to search
English
[edit]Etymology
[edit]super- + combinator
Pronunciation
[edit]- (UK) IPA(key): /ˈsuː.pəˌkɒm.bɪˌneɪ.tə(ɹ)/
- (US) IPA(key): /ˈsuː.pɚˌkɑm.bɪˌneɪ.tɚ/, [ˈsuː.pɚˌkɑm.bɪˌneɪ.ɾɚ]
Noun
[edit]supercombinator (plural supercombinators)
- (computer science) 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.
Translations
[edit]mathematical expression which is fully bound and self-contained
Further reading
[edit]supercombinator on Wikipedia.Wikipedia