"Hindley-Milner type system" meaning in English

{
  "etymology_text": "First described by J. Roger Hindley and later rediscovered by Robin Milner.",
  "forms": [
    {
      "form": "Hindley-Milner type systems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "Hindley-Milner type system"
      },
      "expansion": "Hindley-Milner type system (plural Hindley-Milner type systems)",
      "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"
        }
      ],
      "derived": [
        {
          "word": "HM"
        }
      ],
      "glosses": [
        "A classical type system for the lambda calculus with parametric polymorphism, notable for its completeness and its ability to infer the most general type of a given program without programmer-supplied type annotations or other hints."
      ],
      "id": "en-Hindley-Milner_type_system-en-noun-njhy1tre",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "type system",
          "type system"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ],
        [
          "parametric polymorphism",
          "parametric polymorphism"
        ],
        [
          "completeness",
          "completeness"
        ],
        [
          "infer",
          "infer"
        ],
        [
          "program",
          "program"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A classical type system for the lambda calculus with parametric polymorphism, notable for its completeness and its ability to infer the most general type of a given program without programmer-supplied type annotations or other hints."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Hindley-Milner type system"
}

{
  "derived": [
    {
      "word": "HM"
    }
  ],
  "etymology_text": "First described by J. Roger Hindley and later rediscovered by Robin Milner.",
  "forms": [
    {
      "form": "Hindley-Milner type systems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "Hindley-Milner type system"
      },
      "expansion": "Hindley-Milner type system (plural Hindley-Milner type systems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "A classical type system for the lambda calculus with parametric polymorphism, notable for its completeness and its ability to infer the most general type of a given program without programmer-supplied type annotations or other hints."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "type system",
          "type system"
        ],
        [
          "lambda calculus",
          "lambda calculus"
        ],
        [
          "parametric polymorphism",
          "parametric polymorphism"
        ],
        [
          "completeness",
          "completeness"
        ],
        [
          "infer",
          "infer"
        ],
        [
          "program",
          "program"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A classical type system for the lambda calculus with parametric polymorphism, notable for its completeness and its ability to infer the most general type of a given program without programmer-supplied type annotations or other hints."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Hindley-Milner type system"
}