The Locally Nameless Representation Iowa Type Theory Commute podcast

Artwork

Science Tech Math Aaron Stump Programming Language Computational Logic Type Theory Proof Assistants Cedille

Indhold leveret af Aaron Stump. Alt podcastindhold inklusive episoder, grafik og podcastbeskrivelser uploades og leveres direkte af Aaron Stump eller deres podcastplatformspartner. Hvis du mener, at nogen bruger dit ophavsretligt beskyttede værk uden din tilladelse, kan du følge processen beskrevet her https://da.player.fm/legal.

Iowa Type Theory Commute « »
The Locally Nameless Representation

3M ago 19:54

Del

MP3•Episode hjem

Indhold leveret af Aaron Stump. Alt podcastindhold inklusive episoder, grafik og podcastbeskrivelser uploades og leveres direkte af Aaron Stump eller deres podcastplatformspartner. Hvis du mener, at nogen bruger dit ophavsretligt beskyttede værk uden din tilladelse, kan du følge processen beskrevet her https://da.player.fm/legal.

I discuss what is called the locally nameless representation of syntax with binders, following the first couple of sections of the very nicely written paper "The Locally Nameless Representation," by Charguéraud. I complain due to the statement in the paper that "the theory of λ-calculus identifies terms that are α-equivalent," which is simply not true if one is considering lambda calculus as defined by Church, where renaming is an explicit reduction step, on a par with beta-reduction. I also answer a listener's question about what "computational type theory" means.
Feel free to email me any time at aaron.stump@bc.edu, or join the Telegram group for the podcast.

… continue reading

172 episoder

#Science #Tech #Math #Aaron Stump #Programming Language #Computational Logic #Type Theory #Proof Assistants #Cedille

Artwork

The Locally Nameless Representation

Iowa Type Theory Commute

17 subscribers

published 3M ago

Del

MP3•Episode hjem

Indhold leveret af Aaron Stump. Alt podcastindhold inklusive episoder, grafik og podcastbeskrivelser uploades og leveres direkte af Aaron Stump eller deres podcastplatformspartner. Hvis du mener, at nogen bruger dit ophavsretligt beskyttede værk uden din tilladelse, kan du følge processen beskrevet her https://da.player.fm/legal.

I discuss what is called the locally nameless representation of syntax with binders, following the first couple of sections of the very nicely written paper "The Locally Nameless Representation," by Charguéraud. I complain due to the statement in the paper that "the theory of λ-calculus identifies terms that are α-equivalent," which is simply not true if one is considering lambda calculus as defined by Church, where renaming is an explicit reduction step, on a par with beta-reduction. I also answer a listener's question about what "computational type theory" means.
Feel free to email me any time at aaron.stump@bc.edu, or join the Telegram group for the podcast.

… continue reading

172 episoder

#Science #Tech #Math #Aaron Stump #Programming Language #Computational Logic #Type Theory #Proof Assistants #Cedille

Alle episoder

×

Velkommen til Player FM!

Player FM is scanning the web for high-quality podcasts for you to enjoy right now. It's the best podcast app and works on Android, iPhone, and the web. Signup to sync subscriptions across devices.

Lyt til 500+ emner

Lyt til dette show, mens du udforsker