<== Previous | Contents | Next ==>

The Type System

It is not possible in this tour to go into any depth on the type system proper. However, this is a good place to point out some of the unique aspects to how the type system implementation is used in practice, especially in the presence of un-typesafe code. This is particularly interesting because we believe this is the first time that a fully developed, strong, static type system has been integrated with an existing dynamically-typed language in a completely optional, incremental fashion.

Integrating a Type System with Smalltalk

Type systems are both a form of verifiable annotation, and a structuring tool. Like other structuring tools, a type system provides benefits, such as clarity and verifiability, at the cost of some degree of flexibility. A well designed type-system should provide benefits that are clearly worth putting up with the restrictions. Most strongly typed languages have the luxury of starting with a clean slate, with the ability to enforce use of a type system, and to design the standard libraries to work within the type system framework.

A type system for Smalltalk does not have these luxuries, since there already exist lots of untyped Smalltalk code, a fairly standard set of class library interfaces, and a programming tradition that embraces a highly unstructured, flexible programming style. This daunting set of obstacles has in the past stopped all efforts to design a type system for Smalltalk at a point far short of the goal of a usable, strongly-typed system. On the other hand, the traditional Smalltalk emphasis on education and exploration by reading code could be significantly aided by a type system, since typed programs are much easier to browse, understand, and test.

We believe the Strongtalk type system, as currently implemented in the Strongtalk system, accomplishes the goal of adding a powerful, flexible type system to Smalltalk in a way that complements and does not impede the Smalltalk "style" of programming. One reason for this was a careful type-system design which includes things such as very flexible generic types and classes, as well as innovative developments such as algorithmic inference clauses that were necessary to preserve the flavor of Smalltalk programming. But just as important are some properties of the way the type system implementation is integrated into the system. The type checker is:

Together the type system design and the above implementaton properties produce an environment where typed, partially typed, and untyped code can coexist quite naturally.

We experienced this effect thoroughly during development of the Strongtalk system, since the pressures of rapid development and bootstrapping, combined with the premature cessation of development, led to a system with a considerable variation in the degree of type-safety among the various subsystems. While ideally the whole system should be typesafe (and the core classes and applications have been heavily typechecked), we found that the typechecker was remarkably useful even when invoked on individual methods imbedded in untypesafe classes, as long as the particular things that the method used had reasonable type annotations.

For those who find this topic interesting and who intend to do any poking around the libraries, it will help to read a very short, two-page introduction to the type system.

Mixins ==>