supercombinator

From Wiktionary, the free dictionary
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)

  1. (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]

Further reading[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=supercombinator&oldid=70902422"