Functional graph processing
Are you tired of fiddling with sets of vertices and edges when working with graphs? Would you like to have a simple algebraic data type for representing graphs and manipulating them using familiar functional programming abstractions? In this talk and live programming session, we will learn a new way of thinking about graphs and a new approach to working with graphs in a functional programming language like Haskell. The ideas presented in the talk are implemented in the Alga library: https://github.com/snowleopard/alga. I hope that after this session you will be able to implement a new algebraic graph library in your favourite programming language in an hour.
Andrey Mokhov is a senior lecturer in computer engineering at Newcastle University (UK), and a Royal Society Industry Fellow. Andrey is interested in applying abstract mathematics and functional programming to industrial engineering problems. In 2015 he was a visiting researcher at Microsoft Research Cambridge redesigning the build system of the Glasgow Haskell Compiler; this project is currently continued as part of a 4-year Royal Society research fellowship dedicated to studying build systems in general.
From engineering to abstract mathematics and back
We are an independent technology company, specialising in building and running the systems that organisations count on to deliver their core services.
Functional programmer, husband, father and skeptic (although not necessarily in that order)
Grainger St, Newcastle upon Tyne NE1 5JE, UK
An event page by David Sarginson
We ask for your email address so that we and the attendees have a way of contacting you.