Compositional termination checking with sized types
from Iowa Type Theory Commute Hosted by Aaron Stump
Discussion of a compositional method of termination checking using so-called sized types. Datatypes are indexed by sizes, and recursive calls can only be made on data of strictly smaller size than the data as input to the recursion. Since the method is type-based, it is compositional: we can break out helper functions from a recursive function and not upset the termination checker. A readable and interesting tutorial on the subject is here.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 18 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on March 30, 2020.
Can I download this Iowa Type Theory Commute episode?
Yes. Use the download control on the episode player to save the publisher-provided media file.