Iowa Type Theory Commute
Iowa Type Theory Commute
Aaron Stump
Noncompositionality of syntactic structural-recursion checks
13 minutes Posted Mar 20, 2020 at 4:00 am.
0:00
13:03
Download MP3
Show notes

Review of need for termination analysis for recursive functions on inductive datatypes.  Discussion of a serious problem with syntactic termination checks, namely noncompositionality.  A function may pass the syntactic termination check, but abstracting part of it out into a helper function may result in code which no longer passes the check.  So we need a compositional termination check, which will be discussed in subsequent episodes.