Please log in to watch this conference skillscast.

Are you tired of fiddling with sets of vertices and edges when working with graphs? Would you like to have a simple tree-like data type for representing graphs and manipulating them using familiar functional programming abstractions? In this talk, you will learn a new way of thinking about graphs and a new approach to working with graphs in a functional programming language like Haskell.

This talk is beginner-friendly. You do not need to know dependent types or category theory, and even functors and monads will appear just as familiar and natural (psst!) graph transformations.

The ideas presented in the talk are implemented in the Alga library.

YOU MAY ALSO LIKE:

• Functional Concurrency in .NET with C# and F# (in London on 9th - 10th September 2019)
• The wonders of IBM: Watson, artificial intelligence, Swift coding and databases! (in London on 19th June 2019)