Talk:Definite assignment analysis
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
Although not quite the same as definite assignment analysis (see [1] and [2]), an early precedent is the "typestate" analysis done by the Hermes programming language. Quoting from the introduction of [3]:
Hermes is a language for distributed programming that was developed at the IBM T. J. Watson Research Center from 1986 through 1992. Hermes' most interesting features include:
- language support of processes and interprocess communication.
- Compile-time verification that operations use initialized data.
- Representation independent data aggregates called tables.
- Lack of pointers.
To the best of our knowledge, complete compile-time checking of data initialization is unique to Hermes and its predecessor, NIL; the other features have appeared in other languages.