"eta conversion" meaning in All languages combined

{
  "forms": [
    {
      "form": "eta conversions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "eta conversion (countable and uncountable, plural eta conversions)",
      "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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"
        }
      ],
      "coordinate_terms": [
        {
          "word": "alpha conversion"
        },
        {
          "word": "beta reduction"
        }
      ],
      "glosses": [
        "One of the three rewrite rules of lambda calculus, which expresses a sort of tautology about function application. The rule says that a lambda abstraction of the form (λx.(fx)) may be rewritten as simply f, provided that x does not occur freely in f (considered by itself)."
      ],
      "id": "en-eta_conversion-en-noun-f-2qLrvy",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ],
        [
          "tautology",
          "tautology"
        ],
        [
          "lambda abstraction",
          "lambda abstraction"
        ]
      ],
      "raw_glosses": [
        "(computing theory) One of the three rewrite rules of lambda calculus, which expresses a sort of tautology about function application. The rule says that a lambda abstraction of the form (λx.(fx)) may be rewritten as simply f, provided that x does not occur freely in f (considered by itself)."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "eta conversion"
}

{
  "coordinate_terms": [
    {
      "word": "alpha conversion"
    },
    {
      "word": "beta reduction"
    }
  ],
  "forms": [
    {
      "form": "eta conversions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "eta conversion (countable and uncountable, plural eta conversions)",
      "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",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "One of the three rewrite rules of lambda calculus, which expresses a sort of tautology about function application. The rule says that a lambda abstraction of the form (λx.(fx)) may be rewritten as simply f, provided that x does not occur freely in f (considered by itself)."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ],
        [
          "tautology",
          "tautology"
        ],
        [
          "lambda abstraction",
          "lambda abstraction"
        ]
      ],
      "raw_glosses": [
        "(computing theory) One of the three rewrite rules of lambda calculus, which expresses a sort of tautology about function application. The rule says that a lambda abstraction of the form (λx.(fx)) may be rewritten as simply f, provided that x does not occur freely in f (considered by itself)."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "eta conversion"
}