Skip to content
Using GADTs for typed subsetting of your language episode artwork

Jan 20, 2020 14 min

Using GADTs for typed subsetting of your language

from Iowa Type Theory Commute Hosted by Aaron Stump

One use case for GADTs (as a special case of dependent types) is to form a typed subset of your host language. One creates an EDSL called Expr a, where a is a type of the language (say this language is Haskell). Values of types Expr a are the abstract syntax trees of expressions of type a from your host language. This is just a special case of embedding a typed language into your host language: in this case the typed language is a subset of your host language.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Using GADTs for typed subsetting of your language

0:00 14:35

No transcript yet.

Requests help us decide what to transcribe next.

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 January 20, 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.