We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 121728e + d5f0ec9 commit ba0c6ffCopy full SHA for ba0c6ff
blog/_posts/2016-02-17-scaling-dot-soundness.md
@@ -133,7 +133,7 @@ because they invalidate some idioms in type-level programming. For
133
instance, the cute trick of making Scala's type system Turing complete
134
by having it [simulate SK
135
combinators](https://michid.wordpress.com/2010/01/29/scala-type-level-encoding-of-the-ski-calculus/)
136
-would not longer work since that one relies on unrestricted type
+would no longer work since that one relies on unrestricted type
137
projections. The same holds for some of the encodings of type-level
138
arithmetic.
139
0 commit comments