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:
- Kito Mann's Hacking HTML5 Web Components and Polymer (in London on 10th - 11th July 2017)
- Lightbend's Fast Track to Akka with Java (in London on 16th - 18th August 2017)
- F# eXchange 2018 (in London on 5th - 6th April 2018)
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.