<ul><li><a target="_blank" href="https://youtu.be/vzLK_xE9Zy8">Teaching New Tricks to Old Programs</a> - Conal Elliott</li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Category_(mathematics)">Category</a></li><li><a target="_blank" href="https://ncatlab.org/nlab/show/cartesian+monoidal+category">Cartesian Monoidal Category</a></li><li><a target="_blank" href="https://ncatlab.org/nlab/show/cocartesian+monoidal+category">Cocartesian Monoidal Category</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Representable_functor">Representable Functor</a></li><li><a target="_blank" href="https://hackage.haskell.org/package/comonad">Comonad</a></li><li><a target="_blank" href="https://gist.github.com/ChrisPenner/4527dd0d9c60983562e03c28731bb3bd">Building up Zippers from Distributive, Representable, and Cofree</a></li><li><a target="_blank" href="https://hackage.haskell.org/package/free-4.12.4/docs/Control-Comonad-Cofree.html">Cofree</a></li><li><a target="_blank" href="https://youtu.be/eKkxmVFcd74">Free From Tree</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Rose_tree">Rose Tree</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Mutation_testing">Mutation Testing</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/QuickCheck">QuickCheck</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Heyting_algebra">Heyting Algebra</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Boolean_algebra">Boolean Algebra</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Law_of_excluded_middle">Law of excluded middle</a></li></ul>

Teaching New Tricks to Old Programs - Conal ElliottCategoryCartesian Monoidal CategoryCocartesian Monoidal CategoryRepresentable FunctorComonadBuilding up Zippers from Distributive, Representable, and CofreeCofreeFree From TreeRose TreeMutation TestingQuickCheckHeyting AlgebraBoolean AlgebraLaw of excluded middle

<ul><li><a href="https://youtu.be/vzLK_xE9Zy8" rel="noopener noreferrer">Teaching New Tricks to Old Programs</a> - Conal Elliott</li><li><a href="https://en.wikipedia.org/wiki/Category_(mathematics)" rel="noopener noreferrer">Category</a></li><li><a href="https://ncatlab.org/nlab/show/cartesian+monoidal+category" rel="noopener noreferrer">Cartesian Monoidal Category</a></li><li><a href="https://ncatlab.org/nlab/show/cocartesian+monoidal+category" rel="noopener noreferrer">Cocartesian Monoidal Category</a></li><li><a href="https://en.wikipedia.org/wiki/Representable_functor" rel="noopener noreferrer">Representable Functor</a></li><li><a href="https://hackage.haskell.org/package/comonad" rel="noopener noreferrer">Comonad</a></li><li><a href="https://gist.github.com/ChrisPenner/4527dd0d9c60983562e03c28731bb3bd" rel="noopener noreferrer">Building up Zippers from Distributive, Representable, and Cofree</a></li><li><a href="https://hackage.haskell.org/package/free-4.12.4/docs/Control-Comonad-Cofree.html" rel="noopener noreferrer">Cofree</a></li><li><a href="https://youtu.be/eKkxmVFcd74" rel="noopener noreferrer">Free From Tree</a></li><li><a href="https://en.wikipedia.org/wiki/Rose_tree" rel="noopener noreferrer">Rose Tree</a></li><li><a href="https://en.wikipedia.org/wiki/Mutation_testing" rel="noopener noreferrer">Mutation Testing</a></li><li><a href="https://en.wikipedia.org/wiki/QuickCheck" rel="noopener noreferrer">QuickCheck</a></li><li><a href="https://en.wikipedia.org/wiki/Heyting_algebra" rel="noopener noreferrer">Heyting Algebra</a></li><li><a href="https://en.wikipedia.org/wiki/Boolean_algebra" rel="noopener noreferrer">Boolean Algebra</a></li><li><a href="https://en.wikipedia.org/wiki/Law_of_excluded_middle" rel="noopener noreferrer">Law of excluded middle</a></li></ul>

Curry-Howard the Duck

Follow along with Brian Lonsdorf and Hardy Jones as they explore the internet, life, and programming.

Share Curry-Howard the Duck

Sign up to save your podcasts

Curry-Howard the Duck

Curry-Howard the Duck