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:

This article is within the scope of WikiProject Computer science , a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science }}

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.

--David-Sarah Hopwood ⚥ (talk) 23:24, 27 August 2009 (UTC) [reply ]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Definite_assignment_analysis&oldid=1201424873"