Gentzen-Mints-Zucker duality

08/23/2020
by   Daniel Murfet, et al.
0

The Curry-Howard correspondence is often described as relating proofs (in intutionistic 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 lambda calculus. We revisit Howard's work and interpret it as an isomorphism between a category of proofs in intuitionistic sequent calculus and a category of terms in simply-typed lambda calculus. In our telling of the story the fundamental duality is not between proofs and programs but between local (sequent calculus) and global (lambda calculus or natural deduction) points of view on a common logico-computational mathematical structure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2023

A theory independent Curry-De Bruijn-Howard correspondence

Instead of developing a customized typed lambda-calculus for each theory...
research
04/24/2023

On the Expressive Power of Schemes

We present a calculus, called the scheme-calculus, that permits to expre...
research
09/10/2018

Classical Proofs as Parallel Programs

We introduce a first proofs-as-parallel-programs correspondence for clas...
research
05/20/2017

Formalized Lambek Calculus in Higher Order Logic (HOL4)

In this project, a rather complete proof-theoretical formalization of La...
research
08/24/2021

On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms

Felty and Miller have described what they claim to be a faithful encodin...
research
09/13/2022

Monadic and Comonadic Aspects of Dependency Analysis

Dependency analysis is vital to several applications in computer science...
research
04/27/2019

Differential Logical Relations, Part I: The Simply-Typed Case (Long Version)

We introduce a new form of logical relation which, in the spirit of metr...

Please sign up or login with your details

Forgot password? Click here to reset