Please log in to watch this conference skillscast.
Binary compatibility has been a persistent challenge for the Scala community. This not because we do not take it seriously - in fact the opposite is true. Over the years, the Scala community has developed sophisticated tools and rigid processes to deal with binary compatibility. Yet the problem persists.
In this talk I will explain what binary compatibility means in the Scala context and why it poses such a problem. I will then put forward a possible solution that relies on a new high-level interchange format of typed trees.
YOU MAY ALSO LIKE:
- Greg Young's CQRS, Domain Events, Event Sourcing and how to apply DDD (in Stockholm on 22nd - 24th May 2017)
- Simon Brown's Software Architecture for Developers Workshop (in London on 22nd - 23rd May 2017)
- µCon 2017: The Microservices Conference (in London on 6th - 7th November 2017)
- Serverless Architecture with Azure Functions with Christos Matskas! (in London on 29th November 2017)
The Binary Compatibility Challenge
Martin Odersky is a professor at EPFL in Lausanne, Switzerland. He is best known as the creator of the Scala programming language. Prior to that, he made several contributions to the development of Java. He created the Pizza and GJ languages, designed the original version of generics for Java, and wrote the javac reference compiler.