2000 character limit reached
A Generalization of the Curry-Howard Correspondence
Published 8 Dec 2016 in cs.LO and math.CT | (1612.02816v1)
Abstract: We present a variant of the calculus of deductive systems developed in (Lambek 1972, 1974), and give a generalization of the Curry-Howard-Lambek theorem giving an equivalence between the category of typed lambda-calculi and the category of cartesian closed categories and exponential-preserving morphisms that leverages the theory of generalized categories (Schoenbaum 2016). We discuss potential applications and extensions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.