# The Haskell Interlude 21: Andrey Mokhov

**URL:** <https://discourse.haskell.org/t/the-haskell-interlude-21-andrey-mokhov/5804>\
**Category:** Uncategorized\
**Created:** [February 13, 2023, 7:29pm UTC](https://discourse.haskell.org/t/the-haskell-interlude-21-andrey-mokhov/5804 "2023-02-13T19:29:35Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![nomeata](https://sea2.discourse-cdn.com/flex002/user_avatar/discourse.haskell.org/nomeata/32/1188_2.png) [@nomeata](https://discourse.haskell.org/u/nomeata)\
**Post date:** [February 13, 2023, 7:29pm UTC](https://discourse.haskell.org/t/the-haskell-interlude-21-andrey-mokhov/5804/1 "2023-02-13T19:29:35Z")

</div>

In this episode Matthías Páll and Andres Löh talk with Andrey Mokhov. Andrey is best known for his work on the Hadrian build system and today he talks about algebraic graphs, selective functors, and the difference between OCaml and Haskell.

[https://haskell.foundation/podcast/21/](https://haskell.foundation/podcast/21/)

---

<div class="post-metadata">

**Author:** ![danidiaz](https://sea2.discourse-cdn.com/flex002/user_avatar/discourse.haskell.org/danidiaz/32/92_2.png) [@danidiaz](https://discourse.haskell.org/u/danidiaz)\
**Post date:** [February 14, 2023, 6:14pm UTC](https://discourse.haskell.org/t/the-haskell-interlude-21-andrey-mokhov/5804/2 "2023-02-14T18:14:26Z")

</div>

I’ve used [algebraic-graphs](https://hackage.haskell.org/package/algebraic-graphs) to track dependencies between components in an application and it worked well. Built-in support for [bipartite graphs](https://hackage.haskell.org/package/algebraic-graphs-0.7/docs/Algebra-Graph-Bipartite-AdjacencyMap.html) also came in handy.