Skip to content
Explaining my encoding of a HOAS datatype, part 1 episode artwork

Oct 19, 2020 10 min

Explaining my encoding of a HOAS datatype, part 1

from Iowa Type Theory Commute Hosted by Aaron Stump

I start explaining an idea from my paper "A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille", 2019, available from my web page. The goal is to encode a datatype (including its constructors, which we saw were troublesome for higher-order signatures generally in the previous episode) for application-free lambda terms, which I submit is the simplest higher-order datatype possible. I just explain some of the setup, and will attempt wading through the details next time.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Explaining my encoding of a HOAS datatype, part 1

0:00 10:02

No transcript yet.

Requests help us decide what to transcribe next.

Share this episode

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 October 19, 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.