"value restriction" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "value restriction (uncountable)",
      "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": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2004, Jacques Garrigue, Relaxing the Value Restriction:",
          "text": "A typical example is an expression returning always the empty list. It should be given the polymorphic type α list, but this is not possible under the value restriction if the expression has to be evaluated.",
          "type": "quote"
        },
        {
          "ref": "2007, Geoffrey Smith, Notes on SML97's Value Restriction:",
          "text": "It has been found empirically that eta expansion usually suffices for dealing with the value restriction.",
          "type": "quote"
        }
      ],
      "glosses": [
        "In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to ensure that a program is type-safe."
      ],
      "id": "en-value_restriction-en-noun-4V01urI-",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "inference",
          "type inference"
        ],
        [
          "polymorphic",
          "polymorphic"
        ],
        [
          "type-safe",
          "type-safe"
        ]
      ],
      "qualifier": "type theory",
      "raw_glosses": [
        "(computer science, type theory) In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to ensure that a program is type-safe."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "value restriction"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "value restriction (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "Quotation templates to be cleaned",
        "en:Computer science"
      ],
      "examples": [
        {
          "ref": "2004, Jacques Garrigue, Relaxing the Value Restriction:",
          "text": "A typical example is an expression returning always the empty list. It should be given the polymorphic type α list, but this is not possible under the value restriction if the expression has to be evaluated.",
          "type": "quote"
        },
        {
          "ref": "2007, Geoffrey Smith, Notes on SML97's Value Restriction:",
          "text": "It has been found empirically that eta expansion usually suffices for dealing with the value restriction.",
          "type": "quote"
        }
      ],
      "glosses": [
        "In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to ensure that a program is type-safe."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "inference",
          "type inference"
        ],
        [
          "polymorphic",
          "polymorphic"
        ],
        [
          "type-safe",
          "type-safe"
        ]
      ],
      "qualifier": "type theory",
      "raw_glosses": [
        "(computer science, type theory) In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to ensure that a program is type-safe."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "value restriction"
}