News‎ > ‎

PhD short course: Proofs and types

posted Apr 16, 2012, 3:41 AM by Massimo Bartoletti   [ updated Jun 22, 2012, 7:58 AM ]
Upcoming PhD course

Proofs and Types

May-June 2012
Dipartimento di Matematica e Informatica - Via Ospedale 72, Cagliari

Paolo Di Giamberardino

Dipartimento di Matematica e Informatica
Università degli Studi di Cagliari


Abstract. Computer science owes its birth largely to logic and to the research on the foundations of mathematics. In early nineties, the notion of "computational model" was defined in the framework of logic in order to give an answer to Hilbert's second problem: is there a general algorithm or mechanical procedure to establish, for each formula of arithmetic, whether it is a theorem
or not, i.e. if the formula is deducible from the axioms?

Subsequentely, the theoretical notion of computational model was the basis on which modern computers were developed.


The "family resemblance" between logic and computer science was precisely formulated in the '60, with the discovery by Haskell Curry and William Howard of the isomorphism between proofs and programs, a cornerstone result connecting proof theory and programming languages​​.


The purpose of this short course is to present in an accessible way the Curry Howard isomorphism, highlighting its significance and importance.


Contents.
  1. The simply-typed lambda-calculus (May 9, Aula F, 15:00-17.00)
  2. Intuitionistic logic and natural deduction. The Curry-Howard isomorphism (May 11, Aula F, 15:00-17.00)
  3. System F and polymorphism (June 22, Aula C, 12.00)
References.
  • J.Y. Girard, Y. Lafont, P. Taylor : Proofs and Types. Cambridge University, 1989.
  • L. Tortora di Falco: Sulla struttura logica del calcolo. Rendiconti di Matematica e delle sue applicazioni (vol. 26, serie VII - pagg. 367-404), 2006.

Slides.

Comments