Abstract data types are an essential tool in a programmer's toolkit, but finding a data structure to fit them can be challenging. This is especially so for graphs, which can have complex constraints that are difficult to encode using conventional data structures.
Join Zainab in the search for a functional, typesafe graph. Together, you will explore different graph representations, and discover how types can help you encode constraints. Using dependent types, you will construct a graph that you can prove satisfies its abstract data type.
YOU MAY ALSO LIKE:
- Topiary and the art of origami (SkillsCast recorded in December 2017)
- ScalaCon 2022: Opening Keynote Networking Party (in London on 4th October 2022)
- ScalaCon 2022 (Online Conference on 4th - 8th October 2022)
- LJC: I Started Testing In Production... Then I Went On Holiday (Online Meetup on 15th August 2022)
- Real-time Stream Processing in Spring Made Easy (in London on 25th August 2022)
- Not My Type (SkillsCast recorded in November 2021)
- A History of Enterprise Monads (SkillsCast recorded in May 2021)
Abstract Data Types In The Region Of Abysmal Pain, And How To Navigate Them
Zainab is a functional programmer. She is the author of Libra and a contributor to many functional Scala libraries, such as cats and fs2.