More on FP and concise code episode artwork

EPISODE · Dec 12, 2019 · 9 MIN

More on FP and concise code

from Iowa Type Theory Commute · host 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.

Episode metadata supplied by the publisher feed · Published Dec 12, 2019

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.

PodParley-generated summary based on available episode metadata and transcript content.

NOW PLAYING

More on FP and concise code

0:00 9:56

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

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.

What is this episode about?

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.

Can I download this Iowa Type Theory Commute episode?

Yes, you can download this episode by clicking the download button on the episode player, or subscribe to the podcast in your preferred podcast app for automatic downloads.
URL copied to clipboard!