Programming with indexed types using singletons episode artwork

EPISODE · Jan 16, 2020 · 11 MIN

Programming with indexed types using singletons

from Iowa Type Theory Commute · host Aaron Stump

Basic idea of using singleton types like Nat n where n is a value from the index domain, to connect program expressions and index expressions.  The data value of type Nat n is a copy of n, but living in the syntactic category of program expressions.  This allows programs to operate on a proxy for n.  Singletons library in Haskell mentioned.

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

Basic idea of using singleton types like Nat n where n is a value from the index domain, to connect program expressions and index expressions. The data value of type Nat n is a copy of n, but living in the syntactic category of program expressions. This allows programs to operate on a proxy for n. Singletons library in Haskell mentioned.

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

NOW PLAYING

Programming with indexed types using singletons

0:00 11:49

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

When was this Iowa Type Theory Commute episode published?

This episode was published on January 16, 2020.

What is this episode about?

Basic idea of using singleton types like Nat n where n is a value from the index domain, to connect program expressions and index expressions.  The data value of type Nat n is a copy of n, but living in the syntactic category of program...

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!