15-851
Computation & Deduction
Spring 1997
Frank Pfenning
Lecture 15: Natural Deduction
Simple types allow only rudimentary specification of programs, but they
can be checked and inferred automatically. Now we move to constructive
predicate logic as a richer formalism to express program properties.
The presentation of logic will be in the form of a system of natural
deduction which can be concisely specified in LF and implemented in Elf.
©
Frank Pfenning 1992-1997
fp@cs