@@ -4,7 +4,7 @@ title: "Lazy BDDs with eager literal differences"
44authors :
55- José Valim
66category : Internals
7- excerpt : " This is a follow up to our batch of set-theoretic types optimizations, this time targetting differences"
7+ excerpt : " This is a follow up to our batch of set-theoretic types optimizations, this time targeting differences"
88---
99
1010In [ a previous article] ( /blog/2026/02/26/eager-literal-intersections/ ) ,
@@ -62,7 +62,7 @@ empty?(difference(clause3, union(clause1, clause2)))
6262```
6363
6464Long story short: with Elixir v1.20.0-rc.2, the type system is seeing an
65- increase number of differences. Projects where modules had 1000+ of clauses
65+ increasing number of differences. Projects where modules had 1000+ of clauses
6666were taking too long to compile, so it was time to derive new formulas and
6767optimizations.
6868
@@ -139,7 +139,7 @@ one of the sides is exclusively a literal, which means that `C = :top`,
139139
140140### Literal on the right-hand side
141141
142- We want to derive new formulas for difference when ` B2 ` is a literal.
142+ We want to derive new formulas for the difference when ` B2 ` is a literal.
143143Let's start with the base formula:
144144
145145```
@@ -178,7 +178,7 @@ eager literal difference recursively.
178178
179179### Literal on the left-hand side
180180
181- Now let's derive new formulas for difference when ` B1 ` is a literal.
181+ Now let's derive new formulas for the difference when ` B1 ` is a literal.
182182This means we want to compute:
183183
184184```
0 commit comments