Adobe PDF
(279.37 kB)
| Title Details: | |
|
Lambda calculus and proofs, Curry–Howard isomorphism |
|
| Authors: |
Koletsos, Georgios |
| Reviewer: |
Dimitrakopoulos, Konstantinos |
| Subject: | HUMANITIES AND ARTS > LOGIC AND PHILOSOPHY OF LOGIC HUMANITIES AND ARTS > LOGIC AND PHILOSOPHY OF LOGIC > LOGIC AND PHILOSOPHY OF LOGIC, MISCELLANEOUS > DEDUCTIVE LOGIC MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > MATHEMATICAL LOGIC AND FOUNDATIONS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE |
| Description: | |
| Abstract: |
Introduction to λ-calculus. The concept of reduction and normalization. Programs as λ-terms. Representability of functions. Elementary programming. λ-calculus as a computational framework akin to Turing machines. Type programming, type λ-calculus. The system of simple types, Gödel's system T, and Girard's system F. Expressiveness of type systems. Recursive functions with termination proof. Description of the Curry-Howard isomorphism. Logical formulas as types in computer science and proofs of a formula as programs of that type. Proof of equivalence, which maintains the normalization of programs and correspondingly of proofs.
|
| Linguistic Editors: |
Toulatou, Dimitra |
| Technical Editors: |
Ksystra, Aikaterini |
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Handle | http://hdl.handle.net/11419/2307 |
| Bibliographic Reference: | Koletsos, G. (2015). Lambda calculus and proofs, Curry–Howard isomorphism [Chapter]. In Koletsos, G. 2015. Mathematical Logic [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/2307 |
| Language: |
Greek |
| Is Part of: |
Mathematical Logic |
| Publication Origin: |
Kallipos, Open Academic Editions |