Proofs as Programs

Curry%E2%80%93Howard correspondence

The Curry-Howard correspondence is a connection between computer programs and mathematical proofs in programming language theory and proof theory. It generalizes the relationship between formal logic systems and computational calculi, first discovered by Haskell Curry and William Alvin Howard. This correspondence has also been extended to include category theory as the Curry-Howard-Lambek correspondence.

2 courses cover this concept

15-312 Foundations of Programming Languages

Carnegie Mellon University

Spring 2014

A comprehensive course at Carnegie Mellon University that introduces fundamental principles of programming language design and implementation from a mathematical perspective. It delves deep into the structural and dynamic aspects of programming languages, studying concepts like recursion, objects, polymorphism, and parallelism.

No concepts data

+ 38 more concepts

15-317 / 15-657 Constructive Logic

Carnegie Mellon University

Fall 2021

This undergraduate course introduces students to constructive logics such as intuitionistic and linear logic, focusing on their use in computer science. The goal is to understand the distinction between classical and constructive logic, define logical connectives, implement theorem provers, and explore computational interpretations of logics. Concepts covered include natural deduction, sequent calculus, logic programming, linear logic, and many more.

No concepts data

+ 35 more concepts