"supercombinator" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "combinator"
      },
      "expansion": "super- + combinator",
      "name": "prefix"
    }
  ],
  "etymology_text": "super- + combinator",
  "forms": [
    {
      "form": "supercombinators",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "supercombinator (plural supercombinators)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with super-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Supercombinators are used in the implementation of functional languages.",
          "type": "example"
        }
      ],
      "glosses": [
        "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."
      ],
      "id": "en-supercombinator-en-noun-~nuFAJbE",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "mathematical",
          "mathematical"
        ],
        [
          "expression",
          "expression"
        ],
        [
          "bound",
          "bound"
        ],
        [
          "self-contained",
          "self-contained"
        ],
        [
          "constant",
          "constant"
        ],
        [
          "combinator",
          "combinator"
        ],
        [
          "subexpression",
          "subexpression"
        ]
      ],
      "raw_glosses": [
        "(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."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈsuː.pəˌkɒm.bɪˌneɪ.tə(ɹ)/",
      "tags": [
        "UK"
      ]
    },
    {
      "ipa": "/ˈsuː.pɚˌkɑm.bɪˌneɪ.tɚ/",
      "tags": [
        "US"
      ]
    },
    {
      "ipa": "[ˈsuː.pɚˌkɑm.bɪˌneɪ.ɾɚ]",
      "tags": [
        "US"
      ]
    }
  ],
  "word": "supercombinator"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "combinator"
      },
      "expansion": "super- + combinator",
      "name": "prefix"
    }
  ],
  "etymology_text": "super- + combinator",
  "forms": [
    {
      "form": "supercombinators",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "supercombinator (plural supercombinators)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English 6-syllable words",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with super-",
        "English terms with IPA pronunciation",
        "English terms with usage examples",
        "en:Computer science"
      ],
      "examples": [
        {
          "text": "Supercombinators are used in the implementation of functional languages.",
          "type": "example"
        }
      ],
      "glosses": [
        "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."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "mathematical",
          "mathematical"
        ],
        [
          "expression",
          "expression"
        ],
        [
          "bound",
          "bound"
        ],
        [
          "self-contained",
          "self-contained"
        ],
        [
          "constant",
          "constant"
        ],
        [
          "combinator",
          "combinator"
        ],
        [
          "subexpression",
          "subexpression"
        ]
      ],
      "raw_glosses": [
        "(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."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈsuː.pəˌkɒm.bɪˌneɪ.tə(ɹ)/",
      "tags": [
        "UK"
      ]
    },
    {
      "ipa": "/ˈsuː.pɚˌkɑm.bɪˌneɪ.tɚ/",
      "tags": [
        "US"
      ]
    },
    {
      "ipa": "[ˈsuː.pɚˌkɑm.bɪˌneɪ.ɾɚ]",
      "tags": [
        "US"
      ]
    }
  ],
  "word": "supercombinator"
}