Iowa Type Theory Commute
Iowa Type Theory Commute
Aaron Stump
Lexicographic termination
11 minutes Posted Jun 3, 2020 at 4:00 am.
0:00
11:17
Download MP3
Show notes

Many termination checkers support lexicographic (structural) recursion.  The lexicographic combination of orderings on sets A and B is an ordering on A x B where a pair decreases if the A component does (and then the B component can increase unboundedly) or else the A component stays the same and the B component decreases.  Connections with nested recursion and ordinals discussed.