"beta reduction" meaning in All languages combined

{
  "forms": [
    {
      "form": "beta reductions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "beta reduction (countable and uncountable, plural beta reductions)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "_dis": "53 47",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "52 48",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "53 47",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "coordinate_terms": [
        {
          "_dis1": "100 0",
          "word": "alpha conversion"
        },
        {
          "_dis1": "100 0",
          "word": "eta conversion"
        }
      ],
      "glosses": [
        "The act of beta reducing, an instance of replacing a function call by the result of calling a function."
      ],
      "id": "en-beta_reduction-en-noun-H5ZEKj1F",
      "links": [
        [
          "act",
          "act"
        ],
        [
          "beta reducing",
          "beta reduce"
        ]
      ],
      "tags": [
        "countable",
        "uncountable"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "53 47",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "52 48",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "53 47",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "ref": "1996, Roberto DiCosmo with Vincent Danos, The Linear Logic Primer, Université de Paris VII, retrieved 2016-04-18, page 43:",
          "text": "A natural deduction tree can be put in exact correspondence with typed λ-calculus (that can be considered as just a notation for such deductions), and the cut-elimination in Natural Deduction corresponds exactly to β-reduction in λ-calculus.",
          "type": "quote"
        }
      ],
      "glosses": [
        "One of the three rewrite rules of the lambda calculus, which states that the application of a lambda abstraction (λx.t) to a term s yields an expression t[s/x], \"t with s instead of x\", where all free instances of x in t have been replaced by s."
      ],
      "id": "en-beta_reduction-en-noun-OpYVytSb",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ]
      ],
      "raw_glosses": [
        "(computing theory) One of the three rewrite rules of the lambda calculus, which states that the application of a lambda abstraction (λx.t) to a term s yields an expression t[s/x], \"t with s instead of x\", where all free instances of x in t have been replaced by s."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "beta reduction"
}

{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns",
    "English uncountable nouns",
    "Pages with 1 entry",
    "Pages with entries"
  ],
  "coordinate_terms": [
    {
      "word": "alpha conversion"
    },
    {
      "word": "eta conversion"
    }
  ],
  "forms": [
    {
      "form": "beta reductions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "beta reduction (countable and uncountable, plural beta reductions)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "glosses": [
        "The act of beta reducing, an instance of replacing a function call by the result of calling a function."
      ],
      "links": [
        [
          "act",
          "act"
        ],
        [
          "beta reducing",
          "beta reduce"
        ]
      ],
      "tags": [
        "countable",
        "uncountable"
      ]
    },
    {
      "categories": [
        "English terms with quotations",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "1996, Roberto DiCosmo with Vincent Danos, The Linear Logic Primer, Université de Paris VII, retrieved 2016-04-18, page 43:",
          "text": "A natural deduction tree can be put in exact correspondence with typed λ-calculus (that can be considered as just a notation for such deductions), and the cut-elimination in Natural Deduction corresponds exactly to β-reduction in λ-calculus.",
          "type": "quote"
        }
      ],
      "glosses": [
        "One of the three rewrite rules of the lambda calculus, which states that the application of a lambda abstraction (λx.t) to a term s yields an expression t[s/x], \"t with s instead of x\", where all free instances of x in t have been replaced by s."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ]
      ],
      "raw_glosses": [
        "(computing theory) One of the three rewrite rules of the lambda calculus, which states that the application of a lambda abstraction (λx.t) to a term s yields an expression t[s/x], \"t with s instead of x\", where all free instances of x in t have been replaced by s."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "beta reduction"
}