Example of programming with indexed types: binary search trees episode artwork

EPISODE · Jan 16, 2020 · 10 MIN

Example of programming with indexed types: binary search trees

from Iowa Type Theory Commute · host Aaron Stump

Using indexed types, we can restrict the form of legal values in some datatype.  A nice example is binary search trees, where we can statically enforce the binary search tree property using an indexed type bst l u, where l is a lower bound and u an upper bound on the data stored in the tree.

Episode metadata supplied by the publisher feed · Published Jan 16, 2020

Using indexed types, we can restrict the form of legal values in some datatype. A nice example is binary search trees, where we can statically enforce the binary search tree property using an indexed type bst l u, where l is a lower bound and u an upper bound on the data stored in the tree.

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

NOW PLAYING

Example of programming with indexed types: binary search trees

0:00 10:54

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 10 minutes long.

When was this Iowa Type Theory Commute episode published?

This episode was published on January 16, 2020.

What is this episode about?

Using indexed types, we can restrict the form of legal values in some datatype.  A nice example is binary search trees, where we can statically enforce the binary search tree property using an indexed type bst l u, where l is a lower bound and u an...

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!