Главная
Study mode:
on
1
Introduction
2
David Hilbert
3
Antidual problem
4
Incompleteness theorem
5
Alonzo Church
6
lambda calculus
7
girdle
8
Turing machines
9
Is mathematics invented
10
Natural Deduction
11
Formal Proof
12
Sub Formula Property
13
Example
14
Type Theory
15
Evaluation
16
Holding problem
17
Evaluation of programs
18
History
19
Polymorphic lambda calculus
20
Philosophy
21
Multiverses
22
Questions
Description:
Explore the profound connection between logic and computation in this 43-minute conference talk from Strange Loop. Delve into the principle of Propositions as Types, uncovering its far-reaching impact on theorem provers and programming language design. Discover the depth, breadth, and mystery behind this concept, which goes by many names and has multiple origins. Examine why functional programming both is and isn't the universal programming language. Join Professor Philip Wadler, a distinguished computer scientist from the University of Edinburgh, as he guides you through topics including David Hilbert's work, incompleteness theorems, lambda calculus, Turing machines, natural deduction, type theory, and the philosophical implications of multiverses. Gain insights from Wadler's extensive experience in academia and industry, and his contributions to languages like Haskell, Java, and XQuery.

Propositions as Types

Strange Loop Conference
Add to list
0:00 / 0:00