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)
- Real World Kotlin Development Workshop (in London on 22nd - 23rd October 2019)
- Lightbend Akka for Scala - Professional (in London on 11th - 12th November 2019)
- Scala eXchange London 2019 (in London on 12th - 13th December 2019)
- Scalax2gether Community Day 2019 (in London on 14th December 2019)
- Code Kata: Yilin Wei - Optics with Monocle (in London on 22nd October 2019)
- Don’t keep it to yourself - openness and honesty in the workplace (in London on 30th October 2019)
- Higher-Order Type-Level Programming (SkillsCast recorded in October 2019)
- Stick to Simple Haskell (SkillsCast recorded in October 2019)
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.