Please log in to watch this conference skillscast.
A core principal of functional programming is to use immutable data structures not sometimes, but all the way through. They are highly optimized in performing the necessary copy operations in a lazy and efficient way, but this approach has its limits, for example when you try sorting algorithms. During this talk, you will explore how you can get the speed benefits of mutable data structures without breaking the contract.
YOU MAY ALSO LIKE:
- Lightning Talks 2 (SkillsCast recorded in December 2015)
- Post Quantum Cryptography Apocalypse (Online Meetup on 3rd September 2020)
- Ceci n’est pas un canard - Machine Learning and Generative Adversarial Networks (SkillsCast recorded in August 2020)
- Digital Discrimination: Cognitive Bias in Machine Learning (SkillsCast recorded in June 2020)
Lightning Talk: Some Thoughts about Immutability and its Limits
Karl has been working for his own company IT Sky Consulting GmbH since 2007, mostly as contractor doing SW development, SW-architecture, and training, including teaching college lectures. He has a sound knowledge of programming languages such as Clojure, Scala, Java, Perl, Ruby, and C.