"Church-Rosser theorem" meaning in English

{
  "etymology_text": "Introduced by Alonzo Church and J. Barkley-Rosser in a 1936 paper.",
  "forms": [
    {
      "form": "the Church-Rosser theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Church-Rosser theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result."
      ],
      "id": "en-Church-Rosser_theorem-en-name-nP7aUOwB",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "reduction",
          "reduction"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "term",
          "term"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ],
        [
          "ordering",
          "ordering"
        ],
        [
          "difference",
          "difference"
        ],
        [
          "eventual",
          "eventual"
        ],
        [
          "result",
          "result"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Church-Rosser theorem"
      ]
    }
  ],
  "word": "Church-Rosser theorem"
}

{
  "etymology_text": "Introduced by Alonzo Church and J. Barkley-Rosser in a 1936 paper.",
  "forms": [
    {
      "form": "the Church-Rosser theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Church-Rosser theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics",
        "en:Theory of computing"
      ],
      "glosses": [
        "A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "reduction",
          "reduction"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "term",
          "term"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ],
        [
          "ordering",
          "ordering"
        ],
        [
          "difference",
          "difference"
        ],
        [
          "eventual",
          "eventual"
        ],
        [
          "result",
          "result"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Church-Rosser theorem"
      ]
    }
  ],
  "word": "Church-Rosser theorem"
}