Well-founded recursion
from Iowa Type Theory Commute Hosted by Aaron Stump
Well-founded recursion is a technique to turn recursion which decreases along a well-founded ordering into a structural recursion.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 15 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on May 19, 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.