Log In Sign Up

Gentzen-Mints-Zucker duality

by   Daniel Murfet, et al.

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.


page 1

page 2

page 3

page 4


A cut-free sequent calculus for the bi-intuitionistic logic 2Int

The purpose of this paper is to introduce a bi-intuitionistic sequent ca...

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction

Filinski constructed a symmetric lambda-calculus consisting of expressio...

Introduction to Judea Pearl's Do-Calculus

This is a purely pedagogical paper with no new results. The goal of the ...

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...

Monadic and Comonadic Aspects of Dependency Analysis

Dependency analysis is vital to several applications in computer science...

Formalized Lambek Calculus in Higher Order Logic (HOL4)

In this project, a rather complete proof-theoretical formalization of La...

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...