<ul><li><a target="_blank" href="https://www.sweetbabyrays.com/">Sweet Baby Ray's</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Talkboy">Talkboy</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Yak_Bak">Yak Bak</a></li><li><a target="_blank" href="https://facebook.github.io/react/">React</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/Moore_machine">Moore Machine</a></li><li><a target="_blank" href="https://www.schoolofhaskell.com/user/edwardk/moore/for-less">Moore for Less</a></li><li><a target="_blank" href="https://clojure.org/about/spec">clojure.spec</a></li><li><a target="_blank" href="https://hackage.haskell.org/package/comonad-5.0.2/docs/Control-Comonad.html">Comonad</a></li><li><a target="_blank" href="https://hackage.haskell.org/package/base-4.10.0.0/docs/Data-Functor.html#t:Functor">Functor</a></li><li><a target="_blank" href="https://hackage.haskell.org/package/base-4.10.0.0/docs/Data-Functor.html#t:Functor">Trie</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Mealy_machine">Mealy Machine</a></li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Adjoint_functors">Adjunction</a></li><li><a target="_blank" href="https://github.com/vmchale/morphism-zoo">morphism-zoo</a></li><li><a target="_blank" href="https://youtu.be/9EGYSb9vov8">Unifying Structured Recursion Schemes</a> - Ralf Hinze, Nicolas Wu, and Jeremy Gibbons</li><li><a target="_blank" href="https://en.wikipedia.org/wiki/Prettyprint">Prettyprint</a></li><li><a target="_blank" href="https://homepages.inf.ed.ac.uk/wadler/papers/prettier/prettier.pdf">A prettier printer - Philip Wadler</a></li><li><a target="_blank" href="https://prettier.io/">Prettier</a></li><li><a target="_blank" href="https://github.com/avh4/elm-format">elm-format</a></li><li><a target="_blank" href="https://www.ponylang.org/">Pony</a></li></ul>

Sweet Baby Ray'sTalkboyYak BakReactHeyting AlgebraMoore MachineMoore for Lessclojure.specComonadFunctorTrieMealy MachineAdjunctionmorphism-zooUnifying Structured Recursion Schemes - Ralf Hinze, Nicolas Wu, and Jeremy GibbonsPrettyprintA prettier printer - Philip WadlerPrettierelm-formatPony

<ul><li><a href="https://www.sweetbabyrays.com/" rel="noopener noreferrer">Sweet Baby Ray's</a></li><li><a href="https://en.wikipedia.org/wiki/Talkboy" rel="noopener noreferrer">Talkboy</a></li><li><a href="https://en.wikipedia.org/wiki/Yak_Bak" rel="noopener noreferrer">Yak Bak</a></li><li><a href="https://facebook.github.io/react/" rel="noopener noreferrer">React</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/Moore_machine" rel="noopener noreferrer">Moore Machine</a></li><li><a href="https://www.schoolofhaskell.com/user/edwardk/moore/for-less" rel="noopener noreferrer">Moore for Less</a></li><li><a href="https://clojure.org/about/spec" rel="noopener noreferrer">clojure.spec</a></li><li><a href="https://hackage.haskell.org/package/comonad-5.0.2/docs/Control-Comonad.html" rel="noopener noreferrer">Comonad</a></li><li><a href="https://hackage.haskell.org/package/base-4.10.0.0/docs/Data-Functor.html#t:Functor" rel="noopener noreferrer">Functor</a></li><li><a href="https://hackage.haskell.org/package/base-4.10.0.0/docs/Data-Functor.html#t:Functor" rel="noopener noreferrer">Trie</a></li><li><a href="https://en.wikipedia.org/wiki/Mealy_machine" rel="noopener noreferrer">Mealy Machine</a></li><li><a href="https://en.wikipedia.org/wiki/Adjoint_functors" rel="noopener noreferrer">Adjunction</a></li><li><a href="https://github.com/vmchale/morphism-zoo" rel="noopener noreferrer">morphism-zoo</a></li><li><a href="https://youtu.be/9EGYSb9vov8" rel="noopener noreferrer">Unifying Structured Recursion Schemes</a>&nbsp;-&nbsp;Ralf Hinze, Nicolas Wu, and Jeremy Gibbons</li><li><a href="https://en.wikipedia.org/wiki/Prettyprint" rel="noopener noreferrer">Prettyprint</a></li><li><a href="https://homepages.inf.ed.ac.uk/wadler/papers/prettier/prettier.pdf" rel="noopener noreferrer">A prettier printer - Philip Wadler</a></li><li><a href="https://prettier.io/" rel="noopener noreferrer">Prettier</a></li><li><a href="https://github.com/avh4/elm-format" rel="noopener noreferrer">elm-format</a></li><li><a href="https://www.ponylang.org/" rel="noopener noreferrer">Pony</a></li></ul>

Sweet Baby Rao's

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

Share Sweet Baby Rao's

Sign up to save your podcasts

Sweet Baby Rao's

Sweet Baby Rao's