Introduction to the Parigot encoding
from Iowa Type Theory Commute Hosted by Aaron Stump
The Parigot encoding solves the Church encoding's problem of inefficient predecessor. It can be typed using positive-recursive types, which preserve normalization of the type theory.
Embed this episode
No transcript yet.
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 February 18, 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.