Connecting...

W1siziisimnvbxbpbgvkx3rozw1lx2fzc2v0cy9zawduawz5lxrly2hub2xvz3kvanbnl2jhbm5lci1kzwzhdwx0lmpwzyjdxq

Videos from Scala in the City #8

W1siziisijiwmtgvmdkvmjqvmtavmjkvmjuvndcwlzq5nzu3n2y0lwfmmtctndq2ys04m2jjltzmzty2mdnkndi0ns5kuecixsxbinailcj0ahvtyiisijkwmhg5mdbcdtawm2uixv0

Thank you again to everyone who came along to Scala in the City at Babylon Health last week. The offices were amazing and it was great to hear about the exciting projects they are up to from CEO Mark Tsimelzon.

Thanks to our speakers Greg McKay and Pawel Szulc for giving up their time to come along and talk for us. We are really grateful for all the support from everyone and we hope you continue to enjoy our meetup. 

Stay posted for the announcement of our next Scala in the City, you will definitely not want to miss this one.


If you, unfortunately, missed the meetup at Babylon Health don't worry as we have the videos here for you to catch up on. Check them out below!


A quick overview of Scala in the City at Babylon Health



Pawel Szulc (@rabbitonweb) - A road trip with Monads: From MTL, through Tagless to Bio

This talk is about a journey: from imperative code to purely functional one. It starts with a program written in imperative style. Its weak spots can be quickly recognized: lack of robustness, testability and maintainability. We seek our salvation in the functional paradigm, but the road to enlightenment, has many dangerous and deceivable dead-ends. The quest has a happy ending, as we reach code that is performant, testable, readable and maintainable. Keep in mind however that knowledge comes from experience. As once someone wise said "Its the not the Destination, it's the Journey." Though it is not a live coding session, it will sure feel like it. Code is written in Scala, parental guidance is advised.


Greg McKay - How to fold a forest


Recursion is one of the most fundamental aspects of functional programming and perhaps the most useful method of recursion is the fold. Recursion schemes are a way of generalising folds and unfolds. Abstracting away recursive function calls can help to simplify the underlying ideas in the code; think foldLeft vs standard recursion. However learning about them can be daunting, especially when faced with elaborate names and type signatures. This talk will be a basic introduction to the library Matryoska which provides many recursion schemes. Along the way we will learn about fixed-point types and how they can be used to define common data structures.




If you're interested in talking at any of our events, hosting an event or if you would like to chat please get in touch on 02038650621 or email us at info@signifytechnology.com