"phantom type" meaning in English

See phantom type in All languages combined, or Wiktionary

Noun

Forms: phantom types [plural]
Head templates: {{en-noun}} phantom type (plural phantom types)
  1. (computing theory) A parameterized type that does not depend on all of its type parameters. Categories (topical): Theory of computing

Inflected forms

Download JSON data for phantom type meaning in English (1.5kB)

{
  "forms": [
    {
      "form": "phantom types",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "phantom type (plural phantom types)",
      "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"
        }
      ],
      "examples": [
        {
          "text": "2004 July 31, Markus Mottl, \"Phantom types\" on caml-listhttps://web.archive.org/web/20200622172054/https://caml.inria.fr/pub/ml-archives/caml-list/2004/07/3a19a05047ea9332426bba1d8bc403ce.en.html\nPhantom types not only allow you to capture constraints, which are proved by the compiler, they are also perfectly cheap computationally, because you don't have to check things at runtime all the time."
        }
      ],
      "glosses": [
        "A parameterized type that does not depend on all of its type parameters."
      ],
      "id": "en-phantom_type-en-noun-Yu~TeyIY",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "parameterized",
          "parameterized"
        ],
        [
          "type",
          "type"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A parameterized type that does not depend on all of its type parameters."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "phantom type"
}
{
  "forms": [
    {
      "form": "phantom types",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "phantom type (plural phantom types)",
      "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"
      ],
      "examples": [
        {
          "text": "2004 July 31, Markus Mottl, \"Phantom types\" on caml-listhttps://web.archive.org/web/20200622172054/https://caml.inria.fr/pub/ml-archives/caml-list/2004/07/3a19a05047ea9332426bba1d8bc403ce.en.html\nPhantom types not only allow you to capture constraints, which are proved by the compiler, they are also perfectly cheap computationally, because you don't have to check things at runtime all the time."
        }
      ],
      "glosses": [
        "A parameterized type that does not depend on all of its type parameters."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "parameterized",
          "parameterized"
        ],
        [
          "type",
          "type"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A parameterized type that does not depend on all of its type parameters."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "phantom type"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-03 from the enwiktionary dump dated 2024-05-02 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.