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.
Want to check another podcast?
Enter the RSS feed of a podcast, and see all of their public statistics.
