15851 Computation and Deduction
Lecture 25: Termination
It turns out that in MiniML, the fixpoint constructor is the only
source of nontermination. We verify this by showing that every fixpointfree
welltyped program has a value. This property persists when we add
subtyping, intersection types, and polymorphism, even though significantly
more programs can be typed.
The proof proceeds by constructing a (unary) logical relation, a
very important proof technique in the theory of lambdacalculi and
programming languages.
[ Home
 Schedule
 Assignments
 Handouts
 Software
 Overview
]
fp@cs
Frank Pfenning
