<p>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.</p>

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.

<p>The Parigot encoding solves the Church encoding's problem of inefficient predecessor.&nbsp; It can be typed using positive-recursive types, which preserve normalization of the type theory.</p>

Introduction to the Parigot encoding

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.

Share Introduction to the Parigot encoding

Sign up to save your podcasts

Introduction to the Parigot encoding

Introduction to the Parigot encoding

More shows like Iowa Type Theory Commute

The Changelog: Software Development, Open Source

Sean Carroll's Mindscape: Science, Society, Philosophy, Culture, Arts, and Ideas

Interesting Times with Ross Douthat

Tech Won't Save Us

Dwarkesh Podcast

The Ezra Klein Show

The Haskell Interlude

Software Unscripted

Oxide and Friends