Using GADTs for typed subsetting of your language episode artwork

EPISODE · Jan 20, 2020 · 14 MIN

Using GADTs for typed subsetting of your language

from Iowa Type Theory Commute · host 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 metadata supplied by the publisher feed · Published Jan 20, 2020

Embed this episode

NOW PLAYING

Using GADTs for typed subsetting of your language

0:00 14:35

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.

No similar episodes found.

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 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.
URL copied to clipboard!