15-317 Constructive Logic
Lecture 7: Computational Meaning of Quantifiers
In this lecture we finish the discussion of quantifiers by
presenting their computational meaning, which is a key to making the
connection between constructive mathematics and functional
programming. We also define verifications and uses for quantifiers
which yield a useful proof search strategy.
- Reading: 07-compq.pdf
- Previous lecture: Quantification
- Next lecture: Proof Irrelevance
- Key concepts:
- Universal quantification and dependent function types
- Existential quantification and dependently typed pairs
- Existential witnesses
[ Home
| Schedule
| Assignments
| Handouts
| Software
]
fp@cs
Frank Pfenning
|