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:
- Keynote: Thrilled to have Martin Odersky at ScalaX 2018! (SkillsCast recorded in December 2018)
- F# eXchange 2020 (Online Conference on 21st October 2020)
- Haskell eXchange 2020 (Online Conference on 4th - 5th November 2020)
- Intro to OCaml (SkillsCast recorded in June 2020)
- Keynote: Haskell is a Great Host (SkillsCast recorded in October 2019)
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.