EVENTS
Scala Days, Aug 19th - 21st, Lausanne, Switzerland
Leaders from Scala User Groups and global communities, students, and language contributors will gather to discuss academic research, use cases, and visionary projects for a two-day, action-packed event.
Scala Days (@scaladays)
|
The Scala Workshop, Oct 13th, Singapore
The Scala Workshop is the continuation of the Scala Symposium, providing a forum for researchers and practitioners to discuss the design, implementation, and applications of the Scala programming language. Topics include language features, compiler internals, type systems, libraries, tools, and industrial applications.
EPFL
|
|
READING
Mill Build Tool v1.0.0 Release Highlights
Graal Native Launchers by Default, JVM-free Installation and Bootstrapping, Bash/Zsh Tab-Completion, YAML Build Headers for Early Configuration, Stable Support for Kotlin Builds, Support for Android builds, and many more updates!
Li Haoyi (@li_haoyi)
|
Business4s H1 2025 Highlights
Today, I’d love to share with you some of the key developments from the past six months. Our mission remains the same: solving real business problems using Scala in the most practical and enjoyable way possible.
Voytek Pituła (@Krever01)
|
Rust vs Scala: a technical developer’s perspective
In this article, we provide a neutral, developer-focused comparison of Rust and Scala in terms of concurrency, stream processing, shared state, programming style, error handling, and memory management. Understanding these differences will help you decide which language best fits your project’s needs.
Scalac (@scalac_io)
|
|
VIDEOS
Fail Faster: Staging and Fast Randomness for High-Performance Property-Based Testing
Property-based testing (PBT) relies on generators of random test cases. The effectiveness of PBT depends critically on the speed of these generators: the faster data is generated, the faster properties can fail, and the faster bugs can be found. However, careful measurements show that the generator performance of widely used PBT libraries falls well short of what is possible, due principally to (1) the abstraction overhead of their combinator-heavy style and (2) suboptimal sources of randomness. We characterize, quantify, and address these bottlenecks. To eliminate abstraction overheads, we propose a technique based on multi-stage programming, dubbed Allegro. We apply this technique to leading generator libraries in OCaml and Scala 3, significantly improving performance
Joe Cutler (@alpha_convert)
|
|
|
|
|
|
|