"Curry-Howard correspondence" meaning in English

{
  "head_templates": [
    {
      "args": {},
      "expansion": "Curry-Howard correspondence",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Gerhard Gentzen's calculus of natural deduction is the first formalism of structural proof theory, and is the cornerstone of the Curry-Howard correspondence relating logic to functional programming.ᵂᴾ"
        }
      ],
      "glosses": [
        "A thesis which claims the existence of an analogy or correspondence between — on the one hand — constructive mathematical proofs and programs (especially functions of a typed functional programming language), and — on the other hand — between formulae (proven by the aforementioned proofs) and types (of the aforementioned functions)."
      ],
      "id": "en-Curry-Howard_correspondence-en-name-eBTFm2BX",
      "links": [
        [
          "thesis",
          "thesis"
        ],
        [
          "analogy",
          "analogy"
        ],
        [
          "correspondence",
          "correspondence"
        ],
        [
          "constructive",
          "constructive logic"
        ],
        [
          "proof",
          "proof"
        ],
        [
          "program",
          "program"
        ],
        [
          "function",
          "function"
        ],
        [
          "typed",
          "typed"
        ],
        [
          "functional programming",
          "functional programming"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "type",
          "type"
        ]
      ],
      "synonyms": [
        {
          "word": "Curry-Howard isomorphism"
        }
      ],
      "wikipedia": [
        "Curry-Howard correspondence"
      ]
    }
  ],
  "word": "Curry-Howard correspondence"
}

{
  "head_templates": [
    {
      "args": {},
      "expansion": "Curry-Howard correspondence",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "Pages with 1 entry"
      ],
      "examples": [
        {
          "text": "Gerhard Gentzen's calculus of natural deduction is the first formalism of structural proof theory, and is the cornerstone of the Curry-Howard correspondence relating logic to functional programming.ᵂᴾ"
        }
      ],
      "glosses": [
        "A thesis which claims the existence of an analogy or correspondence between — on the one hand — constructive mathematical proofs and programs (especially functions of a typed functional programming language), and — on the other hand — between formulae (proven by the aforementioned proofs) and types (of the aforementioned functions)."
      ],
      "links": [
        [
          "thesis",
          "thesis"
        ],
        [
          "analogy",
          "analogy"
        ],
        [
          "correspondence",
          "correspondence"
        ],
        [
          "constructive",
          "constructive logic"
        ],
        [
          "proof",
          "proof"
        ],
        [
          "program",
          "program"
        ],
        [
          "function",
          "function"
        ],
        [
          "typed",
          "typed"
        ],
        [
          "functional programming",
          "functional programming"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "type",
          "type"
        ]
      ],
      "wikipedia": [
        "Curry-Howard correspondence"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "Curry-Howard isomorphism"
    }
  ],
  "word": "Curry-Howard correspondence"
}