LOADING
In this talk, I will discuss why it's hard to use the power of RT to test side-effect-heavy apps.
In this talk we'll see how to model a tree structure in Scala, take both imperative and functional approaches to tree traversal algorithms, and do some ASCII art at the same time.
In this presentation you will learn the source of your issues, and a third way - sanely-automatic derivation which is fast to compile, fast to run, and easy to debug by its users.
In this talk, I'll look at the different uses to which tagless final is put to, and see what we can learn about when it is useful and when it just gets in the way.
Don't miss out on this opportunity to connect with Scalar community and create lasting memories
.png)
