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)
- Haskell eXchange 2020 (Online Conference on 4th - 5th November 2020)
- Type Me If You Can: Writing Safe Communication Protocols with F# (SkillsCast recorded in October 2020)
- Arthas: Inside Alibaba’s Java Diagnostic Tool (SkillsCast recorded in September 2020)
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.