"combinator" meaning in English

{
  "forms": [
    {
      "form": "combinators",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "combinator (plural combinators)",
      "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": "Terms with Serbo-Croatian translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "derived": [
        {
          "word": "supercombinator"
        }
      ],
      "examples": [
        {
          "ref": "1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl, retrieved 2012-07-15",
          "text": "M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ⁰.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A lambda expression which has no free variables in it."
      ],
      "id": "en-combinator-en-noun-mvNSL047",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "lambda expression",
          "lambda expression"
        ],
        [
          "free variable",
          "free variable"
        ]
      ],
      "raw_glosses": [
        "(computer science) A lambda expression which has no free variables in it."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "translations": [
        {
          "code": "sh",
          "lang": "Serbo-Croatian",
          "sense": "lambda expression with no free variables",
          "tags": [
            "masculine"
          ],
          "word": "kombinator"
        }
      ],
      "wikipedia": [
        "combinator"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈkɒm.bɪˌneɪ.tə(ɹ)/",
      "tags": [
        "UK"
      ]
    },
    {
      "ipa": "/ˈkɑm.bɪˌneɪ.tɚ/",
      "tags": [
        "US"
      ]
    },
    {
      "ipa": "[ˈkɑm.bɪˌneɪ.ɾɚ]",
      "tags": [
        "US"
      ]
    },
    {
      "audio": "en-us-combinator.ogg",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/40/En-us-combinator.ogg/En-us-combinator.ogg.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/4/40/En-us-combinator.ogg"
    }
  ],
  "word": "combinator"
}

{
  "derived": [
    {
      "word": "supercombinator"
    }
  ],
  "forms": [
    {
      "form": "combinators",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "combinator (plural combinators)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English 4-syllable words",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with IPA pronunciation",
        "English terms with audio links",
        "English terms with quotations",
        "Terms with Serbo-Croatian translations",
        "en:Computer science"
      ],
      "examples": [
        {
          "ref": "1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl, retrieved 2012-07-15",
          "text": "M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ⁰.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A lambda expression which has no free variables in it."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "lambda expression",
          "lambda expression"
        ],
        [
          "free variable",
          "free variable"
        ]
      ],
      "raw_glosses": [
        "(computer science) A lambda expression which has no free variables in it."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "combinator"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈkɒm.bɪˌneɪ.tə(ɹ)/",
      "tags": [
        "UK"
      ]
    },
    {
      "ipa": "/ˈkɑm.bɪˌneɪ.tɚ/",
      "tags": [
        "US"
      ]
    },
    {
      "ipa": "[ˈkɑm.bɪˌneɪ.ɾɚ]",
      "tags": [
        "US"
      ]
    },
    {
      "audio": "en-us-combinator.ogg",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/40/En-us-combinator.ogg/En-us-combinator.ogg.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/4/40/En-us-combinator.ogg"
    }
  ],
  "translations": [
    {
      "code": "sh",
      "lang": "Serbo-Croatian",
      "sense": "lambda expression with no free variables",
      "tags": [
        "masculine"
      ],
      "word": "kombinator"
    }
  ],
  "word": "combinator"
}