This fall, several people presented their work on Ruby type checkers. So let’s take a look: what’s the big deal, and what have they been up to?
Why Type Check?
Part of Ruby’s appeal is to be free of the cruft of its predecessors. So why is there so much interest in adding types to Ruby?
- Large, sprawling projects are becoming more common. At Ruby’s inception, there were no 10-year-old Rails apps which people struggled to maintain, only greenfield Ruby scripts for toy projects.
- Programmers have experienced excellent type systems in other languages, and want those benefits in Ruby.
What are the benefits?
- Correctness: Type checking, like testing, is a way to be confident that your codebase is functioning properly. Employing a type checker can help you find bugs during development and prevent those bugs from going to production.
- Confidence: Since an incorrect program won’t pass type checking, developers can refactor with more confidence. Common errors such as typos and argument errors can be caught by the type checker.
- Design: The type system gives you a way to think about the program. Specifically, types document and define the boundaries between parts of code, like methods, classes and modules.
To experience a great type system in a Ruby-like language, I recommend Crystal.
Jeff Foster, StrangeLoop 2017
Jeff Foster is a professor at the University of Maryland, College Park and works in the programming languages group. Along with his students, he’s been exploring Ruby type checkers for nine years! This year, he gave a presentation at StrangeLoop, Type Checking Ruby.
He described his various avenues of research over the years, and how they influenced one another, leading to a final question:
1 2 3 4 5 6 7 8 9
His early work revolved around static type checking: annotations in the source code were given to a type checker, which used those annotations to assert that the Ruby code was correct.
This approach had a fundamental limitation: how can dynamically-created methods (like
Talk#owner above) be statically annotated?
This drove him and his team to develop RDL, a dynamic type checker. In RDL, types are declared using methods instead of annotations, for example:
1 2 3 4
By using methods, it handles metaprogramming in a straightforward way. It hooks into Rails’
.belongs_to and adds annotations for the generated methods, for example:
1 2 3 4 5 6 7 8 9
(In reality, RDL uses conditions, not monkey-patching, to achieve this.)
In this approach, type information is gathered while the program runs, but the typecheck is deferred until the method is called. At that point, RDL checks the source code (static information) using the runtime data (dynamic information). For this reason, RDL is called “Just-in-Time Static Type Checking.”
You can learn more about RDL in several places:
- RDL on GitHub: https://github.com/plum-umd/rdl
- StrangeLoop 2017 talk: https://www.youtube.com/watch?v=buY54I7mEjA
- Academic papers from the folks behind RDL: https://github.com/plum-umd/rdl#bibliography
Personally, I can’t wait to take RDL for a try. At the conference, Jeff mentioned that type inference was on his radar. That would take RDL to the next level!
Not to read into it too far, but it looks like Stripe is exploring RDL 😎.
Soutaro Matsumoto, RubyKaigi 2017
Soutaro Matsumoto also has significant academic experience with type checking Ruby, and this year, he presented some of his work at RubyKaigi in Type Checking Ruby Programs with Annotations.
He begins with an overview of type checking Ruby, and surveys the previous work in type inference. He also points out how requirements should be relaxed for Ruby:
Correctness-> Forget correctness (Allow a mix of typed and untyped code, so that developers can work quickly when they don’t want or need types.) Static-> Defer type checking to runtime (He mentions RDL in this context) No annotations-> Let programmers write types (Completely inferring types is not possible, so accept some hints from the developers.)
Then, he introduces his recent project, Steep.
Steep’s approach is familiar, but new to Ruby. It has three steps:
- Write a
.rbifile which describes the types in your program, using a special type language, for example:
1 2 3
- Add annotations to your Ruby code to connect it to your types:
1 2 3 4
Some connections between Ruby source and the
.rbi files can be made automatically; others require explicit annotations.
Run the type checker:
$ steep check app/models/talk.rb
It reminds me a bit of the
.c files in a C project.
Soutaro is also presenting his work at this winter’s RubyConf.
Valentin Fondaratov, RubyKaigi 2017
Valentin works at JetBrains (creators of RubyMine) and presented his work on type-checking based on runtime data. His presentation, Automated Type Contracts Generation for Ruby, was really fascinating and offered a promising glimpse of what a Ruby type ecosystem could be.
Valentin started by covering RubyMine’s current type checking system:
- RubyMine tries to resolve identifiers (eg, method names, constant names) to their implementations
- But this is hard: given
obj.execute, what method does it call?
- Developers can provide hints with YARD documentation
- RubyMine uses this to support autocomplete, error prediction, and rename refactorings
He also pointed out that even code coverage is not enough: 100% code coverage does not guarantee that all possible codepaths were run. For example, any composition of
if branches require a cross-product of codepaths, not only that each line is executed once. Besides that, code coverage does not analyze the coverage of your dependencies’ code (ie, RubyGems).
So, Valentin suggests getting more from our unit tests: what if we observed the running program, and kept notes about what values were passed around and how they were used? In this arrangement, that runtime data could be accumulated, then used for type checking.
Impressively, he introduced the implementation of this, first using a TracePoint, then digging into the Ruby VM to get even more granular data.
However, the gathered data can be very complicated. For example, how can we understand the input type of
1 2 3 4 5 6 7 8 9 10 11
Valentin showed how a classic technique, finite automata, can be used to reduce this information to a useful data structure.
Then, this runtime data can be used to generate type annotations (as YARD docs).
Finally, he imagines a type ecosystem for Ruby:
- Users contribute their (anonymized) runtime information for their RubyGem depenedencies
- This data is pooled into a shared database, merged by RubyGem & version
- Users can draw type data from the shared database
Personally, I think this is a great future to pursue:
- Developers can gain type checking without any annotations
- Annotations can become very robust because resources are shared
- Real 100% coverage is possible via community collaboration
You can see the project on GitHub: https://github.com/JetBrains/ruby-type-inference
There’s a lot of technically-savvy and academically-informed work on type checking Ruby! Many of the techniques preserve Ruby’s productivity and dynamism while improving the developer experience and confidence. What makes them unique is their use of runtime data, to observe the program in action, then make assertions about the source code.