"beta reduction" meaning in English

See beta reduction in All languages combined, or Wiktionary

Noun

Forms: beta reductions [plural]
Head templates: {{en-noun}} beta reduction (plural beta reductions)
  1. The act of beta reducing, an instance of replacing a function call by the result of calling a function. Coordinate_terms: alpha conversion, eta conversion
    Sense id: en-beta_reduction-en-noun-H5ZEKj1F Categories (other): English entries with incorrect language header Disambiguation of English entries with incorrect language header: 51 49
  2. (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. Categories (topical): Theory of computing
    Sense id: en-beta_reduction-en-noun-OpYVytSb Categories (other): English entries with incorrect language header Disambiguation of English entries with incorrect language header: 51 49 Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences

Inflected forms

Download JSON data for beta reduction meaning in English (2.4kB)

{
  "forms": [
    {
      "form": "beta reductions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "beta reduction (plural beta reductions)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "_dis": "51 49",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "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"
        ]
      ]
    },
    {
      "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": "51 49",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "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": "quotation"
        }
      ],
      "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."
      ],
      "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"
  ],
  "coordinate_terms": [
    {
      "word": "alpha conversion"
    },
    {
      "word": "eta conversion"
    }
  ],
  "forms": [
    {
      "form": "beta reductions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "beta reduction (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"
        ]
      ]
    },
    {
      "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": "quotation"
        }
      ],
      "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."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "beta reduction"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.