1. 51:50 +
   Q: Are you planning to write more books?
   B: Yes

2. 53:56 +
   Q: How many companies use this approach in production?
   O: A variety of different companies

3. 1:02:30 +
   Q: How to define an algebra?
   B: C - carrier type, F[C] => C

4. 1:04:16 -
   Q: Is the idea of applying a category theory to programming a new thing?
   B: It's getting more popular

5. 1:05:33 -
   Q: What is g(f(a))?
   B: composition
   O: composition

6. 1:10:24 -
   Q: TF vs FreeMonads
   O: Use TF

7. 1:12:45 +
   Q: What kind of exotic CT techniques do you use?
   O: Rec schemes
   B: Rec schemes

8. 1:16:20 +
   Q: Do the rec schemes guarantee termination of sorting algorithms?
   B: recursion should be well defined, but proofs are not first level objects in Haskell.

9. 1:23:16 -
   Q: Design question
   B: …
   O: …

10. 1:32:26 -
    Q: I can't use matryoshka without understanding all the science behind it. It's a barrier
    O: Use Droste

11. 1:34:06 -
    Q: It's hard for me to read the book, any recommendations?
    B: I had hard time when I read books too, don't give up

12. 1:42:14 +
    Q: Sometimes diagrams do not commute, right?
    B: Right

1:04:16 - 1:12:45

1:23:16 - 1:42:14