What are commuting conversions in proof theory?

Commuting conversions are transformations on proofs in natural deduction, that move certain stuck inferences out of the way, so that the normal detour reductions (which correspond to beta-reduction under Curry-Howard) are enabled. The stuck inferences are uses of disjunction elimination. In programming terms, if you have an if-then-else (a simple case of or-elimination) where the then- and else-branches are lambda abstractions, and you apply that if-then-else to an argument, you need commuting conversions to move the argument into the branches, so you can call the functions (in the then- and else-branches) with it. See Section 10.1 of Girard's Proofs and Types for more on the problem, and a nice paper by de Groote on strong normalization with commuting conversions.

You can listen to What are commuting conversions in proof theory? online on Radio and Podcast. Open the player on this page to stream the available audio.

What are commuting conversions in proof theory? is an episode from Iowa Type Theory Commute by Aaron Stump.

This episode is 22:29 long.

This episode was published on Mar 3, 2026.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Iowa Type Theory Commute when more episodes are available from the podcast feed.