More on FP and concise code
from Iowa Type Theory Commute Hosted by Aaron Stump
Discussion of datatypes for tree-like data structures in functional languages. Usefulness of these for processing structured linguistic artifacts, where the structure is represented by the tree structure.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 9 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on December 12, 2019.
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.