Connecting...

W1siziisimnvbxbpbgvkx3rozw1lx2fzc2v0cy9zawduawz5lxrly2hub2xvz3kvanbnl2jhbm5lci1kzwzhdwx0lmpwzyjdxq

Recursion Schemes, Categorically! by Bartosz Milewski & Oli Makhasoeva at #ScalaUA

W1siziisijiwmjavmdyvmjivmtuvntqvmjyvotu2l2fzay1ibgfja2jvyxjklwnoywxrlwjvyxjklwnoywxrym9hcmqtmzu2mdc5lmpwzyjdlfsiccisinrodw1iiiwiotawedkwmfx1mdazzsjdxq

How do you make connections between the most abstract branch of mathematics and everyday programming?

Let Bartosz Milewski and Oli Makhasoeva show you!

Check our their talk from ScalaUA.


Recursion Schemes, Categorically!

Recursion schemes are an example of the direct application of category theory to programming. Category theory uses diagrams to define functors, algebras, and universal constructions. 
Wondering about how to make connections between the most abstract branch of mathematics and everyday programming? 
Bartosz will explain to you the theory of abstract diagrams and Oli will translate them into the working Scala code. 



This talk was given by Bartosz Milewski and Oli Makhasoeva at ScalaUA