This time we will discuss these two topics:
1. Induction using implicits (Algimantas Krasauskas).
In the talk I will discuss methods of scrapping your boilerplate by using implicit induction and scala’s type system. As part of the demo, I will talk about HList and problems it helps us solve.
2. Abstract machines & sequent calculus (Alex Gryzlov).
Have you ever wondered if the foundations of FP can be redesigned from the ground up? In this talk we'll use a logical framework called "sequent calculus" to define an alternative system to the lambda calculus and see the benefits this will bring us, demystifying continuations in the process.
We will have pizza before the talks!