15399 Constructive Logic
Lecture 14: Contracting Proofs to Programs
In general, a proof in arithmetic may have more information than we
are interested in computationally. For example, the evaluation of a
proof may return not just a natural number, but also a proof that the
number satisfies a specified property. In the lecture we discuss
how to specify the relevant computational content of a proposition
and how to extract efficient programs from constructive proofs.
[ Home
 Schedule
 Assignments
 Handouts
 Software
 Overview
]
fp@cs
Frank Pfenning
