| Display title | Curry–Howard correspondence |
| Default sort key | Curry-Howard Correspondence |
| Page length (in bytes) | 59,331 |
| Namespace ID | 0 |
| Page ID | 236379 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Wincert |
| Date of page creation | 21:12, 6 February 2024 |
| Latest editor | imported>Wincert |
| Date of latest edit | 21:12, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In programming language theory and proof theory, the Curry–Howard correspondence (also known as the Curry–Howard isomorphism or equivalence, or the proofs-as-programs and propositions- or formulae-as-types interpretation) is the direct relationship between computer programs and mathematical proofs. |
