Pronunce (3)
-
/ˈsuː.pəˌkɒm.bɪˌneɪ.tə(ɹ)/
Note sulla pronuncia
- UK
-
/ˈsuː.pɚˌkɑm.bɪˌneɪ.tɚ/
Note sulla pronuncia
- US
-
[ˈsuː.pɚˌkɑm.bɪˌneɪ.ɾɚ]
Note sulla pronuncia
- US
Sostantivo
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.
- Esempi
-
Supercombinators are used in the implementation of functional languages.