EPISODE · May 12, 2021 · 14 MIN
A look at Agda's module system
from Iowa Type Theory Commute · host Aaron Stump
Agda's module system (beautifully described here) could be seen as intermediate between Haskell's and Standard ML's. It supports nested parametrized modules with information hiding, but does not go all the way to higher-order functors (as in Standard ML).
Embed this episode
Ready to play
A look at Agda's module system
0:00
14:04
1×
No transcript for this episode yet
Similar Episodes
No similar episodes found.
Similar Podcasts
No similar podcasts found.
Frequently Asked Questions
How long is this episode of Iowa Type Theory Commute?
This episode is 14 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on May 12, 2021.
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.
URL copied to clipboard!