In computer science, a tagged architecture  is a particular type of computer architecture where every word of memory constitutes a tagged union, being divided into a number of bits of data, and a tag section that describes the type of the data: how it is to be interpreted, and, if it is a reference, the type of the object that it points to.
Two notable series of tagged architectures were the Lisp machines, which had tagged pointer support at the hardware and opcode level, and the Burroughs large systems which had a data-driven tagged and descriptor-based architecture. Another "exemplary" instance was the architecture of the Rice Computer.
- The Memory Management Glossary: Tagged architecture
- Feustel, Edward A. (July 1973). "On the Advantages of Tagged Architecture" (PDF). IEEE Transactions on Computers: 644–656. Archived from the original on January 21, 2013. Retrieved January 21, 2013.
- Thornton, Adam. "A Brief History of the Rice Computer 1959-1971". Retrieved January 31, 2013. (mostly written in [or before] 1994, and archived by the Wayback Machine on a date indicated [by "20080224"] in the URL)
|This computer science article is a stub. You can help Wikipedia by expanding it.|