In this episode we briefly review the Church and Parigot encodings (discussed previously in Chapter 6 of this podcast) and then consider the Scott encoding, where combining functions receive only the immediate subdata of the data.
Want to check another podcast?
Enter the RSS feed of a podcast, and see all of their public statistics.