Recursive data structures like lists or trees can be harvested using algebras and catamorphisms. But in order to support sustainable programming ecosystems, we need to grow trees. That's where coalgebras and anamorphisms prove their usefulness. Given a seed value, an anamorphism can produce a recursive data structure. Interestingly, we can also produce infinite data structures this way.

About Functional Scala:
Functional Scala was founded in 2019 to provide an independent, professional platform for speakers across the entire Scala community, bringing together new and existing Scala developers in an uplifting and welcoming environment that focuses on innovation & excellence.

Join the Functional Scala Community on Twitter: https://twitter.com/funscala2021 and https://twitter.com/zivergetech

Stay informed on future events: https://www.functionalscala.com/, https://ziverge.com/

Join us in 2021: https://www.eventbrite.co.uk/e/functional-scala-2021-tickets-131620665955

#FunctionalScala2020 #FunScala2020 #FunScala20