Introduction to the Parigot encoding episode artwork

EPISODE · Feb 18, 2020 · 11 MIN

Introduction to the Parigot encoding

from Iowa Type Theory Commute · host 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.

Episode metadata supplied by the publisher feed · Published Feb 18, 2020

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.

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

NOW PLAYING

Introduction to the Parigot encoding

0:00 11: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.

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.

What is this episode about?

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.

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!