<p>The Church encoding represents data as their own fold-right functions.  For booleans, this means they become their own if-then-else expressions.  We consider the polymorphic type for these, which is forall X. X -> X -> X.</p>

The Church encoding represents data as their own fold-right functions. For booleans, this means they become their own if-then-else expressions. We consider the polymorphic type for these, which is forall X. X -> X -> X.

<p>The Church encoding represents data as their own fold-right functions.&nbsp; For booleans, this means they become their own if-then-else expressions.&nbsp; We consider the polymorphic type for these, which is forall X. X -&gt; X -&gt; X.</p>

Church encoding of the booleans

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

Share Church encoding of the booleans

Sign up to save your podcasts

Church encoding of the booleans

Church encoding of the booleans

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