See Curry-Howard correspondence on Wiktionary
{
"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": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"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 eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"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"
}
Download raw JSONL data for Curry-Howard correspondence meaning in All languages combined (1.4kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-08 from the enwiktionary dump dated 2025-01-01 using wiktextract (9a96ef4 and 4ed51a5). 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.