Propositions as Types: Logic and Programming Correspondence

In course

Nostrud culpa consectetur est magna velit amet exercitation nulla deserunt cupidatat duis commodo. Ex consectetur do eiusmod quis officia id excepteur aliquip sint laborum magna aliquip ad. Duis quis cupidatat elit sint ullamco excepteur non reprehenderit commodo. Sint esse et velit in amet cupidatat. Ut irure adipisicing ad sit nostrud elit laboris aliqua eiusmod non officia.

Description

This lecture explores the Curry-Howard Correspondence, showing the relationship between constructive logics and programming languages. It covers how proofs in logic correspond to evidence in programming, and how types in programming correspond to propositions in logic. The lecture delves into the concept of proof simplification, also known as 'cut elimination', and mentions tools like Coq, Lean, Agda, Idris, Scala, and Haskell.

Instructor

duis aliqua

Fugiat ullamco Lorem consequat non esse ex nisi ad aliquip incididunt et duis irure. Occaecat magna in irure excepteur consectetur ipsum occaecat qui quis adipisicing sunt ea nisi. Magna ex aute eiusmod ad aliquip occaecat sunt velit ad do in. Exercitation Lorem ad magna sit ipsum aliqua sit amet ut id. Lorem exercitation do anim nostrud exercitation aute sunt ad qui ut sunt id dolor nostrud. Ad deserunt proident exercitation aliqua fugiat pariatur excepteur velit cupidatat qui ea proident ullamco adipisicing.

Official source

https://mediaspace.epfl.ch/media/0_0gk33fqf

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Logic

Classical logic: First-order logic

Related lectures (58)