Gentzen–Mints–Zucker duality
Mathematical Structures in Computer Science · 2026 · 36
DOI: 10.1017/s0960129526100462 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Structures in Computer Science, online erschienen am 09.03.2026. Verfasst von Daniel Murfet und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The Curry–Howard correspondence is often described as relating proofs (in intuitionistic natural deduction) to programs (terms in simply-typed lambda calculus). However, this narrative is hardly a perfect fit, due to the computational content of cut-elimination and the logical origins of the lambda calculus. We revisit Howard’s work and interpret it as an isomorphism between a category of formulas and proofs in intuitionistic sequent calculus and a category of types and terms in simply-typed lambda calculus. In our telling of the story, the fundamental duality is not between proofs and programs but between emphlocal (sequent calculus) and global (lambda calculus or natural deduction) points of view on a common logico-computational mathematical structure.
Zitieren
APA
Murfet, D., & Troiani, W. A. (2026). Gentzen–Mints–Zucker duality. Mathematical Structures in Computer Science, 36. https://doi.org/10.1017/s0960129526100462
Vancouver
Murfet D, Troiani WA. Gentzen–Mints–Zucker duality. Mathematical Structures in Computer Science. 2026;36. doi:10.1017/s0960129526100462
BibTeX
@article{Murfet2026,
author = {Murfet, Daniel and Troiani, William Anthony},
title = {Gentzen–Mints–Zucker duality},
journal = {Mathematical Structures in Computer Science},
year = {2026},
volume = {36},
doi = {10.1017/s0960129526100462}
}
EUVIMED