Cellular Automata are a very universal model of computations, letting us break complex systems into sets of simple rules and immutable pieces of data, which we can apply a range of FP techniques to, in order to run complex simulations with very little of actual code writing. During this talk we’re going to do just that. We’ll start with some theory, and then move to generating visual patterns out of chaos. I promise that you won’t learn anything that is immediately useful, but - I hope - it will inspire you.
Intermediate Scala (up to traits, type bounds, and functions as parameters), basic concurrency concepts.
Maciej is a Scala/Android developer at Wire, Berlin. Maciej advocates healthy minimalism and keeping one's code clean and simple, believing that in commercial applications these qualities beat high-level abstractions every time. He appreciates Scala exactly because it allows programmers to be pragmatic and draw from both worlds, imperative and functional, as needed.