Question

When Scala is discussed, the type system is always mentioned as one of the primary features. It is referred to as powerful, and the primary reason for the language moniker (Scala being short for “scalable language”). Could someone please explain how Scala typing works/why this unique, and how that contributes to the language being scalable?

Answer 1

I don’t think the existing answers are appropriate. Scala has a lot of conveniences, but they are not related to the type system being powerful just because they relate to types. In fact, type inference is in direct conflict with the power of the type system — were it less powerful, one could have full type inference (like in Haskell).

So,

• Scala has classes with members. (Obvious, but I’m trying to be exhaustive here.)
• Method (“def”) members of a scala class can have zero or more parameter lists, each of which can have zero or more parameters, the last of which might be a vararg.
• Parameters may be passed by value or by name.
• Parameters have names and may have default values.
• Scala has “var” and “val” members (which are, in practice, also methods).
• Scala has “lazy val” members.
• Scala has “type” members (type aliases), which may be specified as fixed types or as type boundaries.
• Scala has abstract classes and members (all of the above members may be abstract).
• Scala has inner class, traits and objects (Scala’s inner class are different than Java’s).
• Scala’s members, plus inner stuff, may be overriden.
• Scala has type inheritance.
• Scala has traits, providing multiple-inheritance with type linearization.
• Scala’s traits’s method members may have abstract override (stackable, aspect-like override).
• Scala has singleton types.
• Scala has companion class/objects (related to scope).
• Scala has private, protected and public scopes for classes, traits, singletons and members.
• Scala’s private and protected scopes can be limited to any enclosing package, class, trait or singleton, plus “this”.
• Scala has self types.
• Scala has type parameters.
• Scala’s type parameters can be co- and contra-variant, as well as invariant.
• Scala has type constructors.
• Scala has higher-order types.
• Scala has existential types.
• Scala has structural types.
• Scala has implicit parameters.
• Scala has function types, though, since they are simply a class plus syntactic sugar, I don’t think it belongs on this list. On the other hand, function types are part of view bounds, so maybe it does.
• Scala has a top (like almost everyone) and a bottom (like other statically typed fp languages).
• Scala’s “unit” is a type with a value (as opposed to “void” elsewhere).

Next, there are features related to Scala’s implicits, which is what merit their inclusion above.

• Scala has view bounds, an implicit parameter that acts like another type bound.
• Scala has context counds, an implicit parameter that acts like another bound.
• Generally speaking, implicit parameters and type inference can be combined to construct arbitrary complex proofs over the type parameters.

Related to the last comment, implicits and type inference, together, make Scala’s type system turing complete. That is, you codify arbitrary programs as types, that will be “run” at compile time by the compiler. Proof here, by way of SKI Calculus, with a “buggy” infinite loop in the types as further demonstration.

The list of features above is quite big and impressive on many points. It is, however, the way Scala combines implicits and type inference to produce static proofs at compile time (such as view bounds and context bounds) that make Scala’s type system unique. AFAIK, there is no other language doing that, though there are certainly other languages providing proof capabilities through other means.