"lambda abstraction" meaning in All languages combined

See lambda abstraction on Wiktionary

Noun [English]

Forms: lambda abstractions [plural]
Head templates: {{en-noun}} lambda abstraction (plural lambda abstractions)
  1. (computing theory) A lambda term of the form (λx.t) where x is a variable and t another lambda term. Any free instance of x within t (considered by itself) then becomes bound by the λx. prefix. It is meant to represent an anonymous function. Categories (topical): Theory of computing
    Sense id: en-lambda_abstraction-en-noun-0iovFU8u Categories (other): English entries with incorrect language header Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences

Inflected forms

Download JSON data for lambda abstraction meaning in All languages combined (1.4kB)

{
  "forms": [
    {
      "form": "lambda abstractions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "lambda abstraction (plural lambda abstractions)",
      "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": "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 lambda term of the form (λx.t) where x is a variable and t another lambda term. Any free instance of x within t (considered by itself) then becomes bound by the λx. prefix. It is meant to represent an anonymous function."
      ],
      "id": "en-lambda_abstraction-en-noun-0iovFU8u",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "lambda term",
          "lambda term"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A lambda term of the form (λx.t) where x is a variable and t another lambda term. Any free instance of x within t (considered by itself) then becomes bound by the λx. prefix. It is meant to represent an anonymous function."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "lambda abstraction"
}
{
  "forms": [
    {
      "form": "lambda abstractions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "lambda abstraction (plural lambda abstractions)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "A lambda term of the form (λx.t) where x is a variable and t another lambda term. Any free instance of x within t (considered by itself) then becomes bound by the λx. prefix. It is meant to represent an anonymous function."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "lambda term",
          "lambda term"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A lambda term of the form (λx.t) where x is a variable and t another lambda term. Any free instance of x within t (considered by itself) then becomes bound by the λx. prefix. It is meant to represent an anonymous function."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "lambda abstraction"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-15 from the enwiktionary dump dated 2024-05-02 using wiktextract (8203a16 and 304864d). 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.