On the Correspondence Between Proofs and -Terms
نویسنده
چکیده
The correspondence between natural deduction proofs and λ-terms is presented and discussed. A variant of the reducibility method is presented, and a general theorem for establishing properties of typed (first-order) λ-terms is proved. As a corollary, we obtain a simple proof of the Church-Rosser property, and of the strong normalization property, for the typed λ-calculus associated with the system of (intuitionistic) first-order natural deduction, including all the connectors →, ×, +, ∀, ∃, and ⊥ (falsity) (with or without η-like rules). ∗This research was partially supported by ONR Grant NOOO14-88-K-0593.
منابع مشابه
بررسی میزان همخوانی عبارت‌های جستجوی کاربران با اصطلاحات پیشنهادی مقالات در پیشینه‌های کتابشناختی پایگاه‌های اطلاعاتی لاتین EBSCO و IEEE
Purpose: This study aims to investigate correspondence of users' queries with alternative terms of Latin databases namely IEEE and EBSCO. Databases display subjective content of their documents through natural or controlled language vocabularies in specified bibliographic fields along with other bibliographic information that are called papers alternative terms. Methodology: We used content an...
متن کاملOn the Correspondence Between Proofs and Lambda-Terms
The correspondence between natural deduction proofs and λ-terms is presented and discussed. A variant of the reducibility method is presented, and a general theorem for establishing properties of typed (first-order) λ-terms is proved. As a corollary, we obtain a simple proof of the Church-Rosser property, and of the strong normalization property, for the typed λ-calculus associated with the sys...
متن کاملOn automating the extraction of programs from proofs using product types
Introduction • We are interested in programming language with the point of view: Proofs as Programs (Curry-Howard correspondence). Introduction • We are interested in programming language with the point of view: Proofs as Programs (Curry-Howard correspondence). • The specifications are the types and the lambda-terms are the extracted programs (the code). Introduction • We are interested in prog...
متن کاملOn a Formal Correspondence Between A-C-Terms and Classical Proofs
The propositions-as-types correspondence [IIowSO] relates proofs in con structive logic to functional programs. The correspondence has intrigued those interested in the formal verification of programs with the possibility of developing programs from proofs of their specifications [BC85, Con86, Moh86]. However, one drawback of this approach to program development is that the programming language...
متن کاملOn the pointfree counterpart of the local definition of classical continuous maps
The familiar classical result that a continuous map from a space $X$ to a space $Y$ can be defined by giving continuous maps $varphi_U: U to Y$ on each member $U$ of an open cover ${mathfrak C}$ of $X$ such that $varphi_Umid U cap V = varphi_V mid U cap V$ for all $U,V in {mathfrak C}$ was recently shown to have an exact analogue in pointfree topology, and the same was done for the familiar cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995