Tagged architecture¶
Tagged architecture attaches type, permission, provenance, capability, or other metadata to machine words or memory objects and makes hardware operations interpret or enforce those tags during execution.
Core Idea¶
A tagged architecture is a computer architecture in which memory words, pointers, or other machine values carry protected metadata that identifies their type, interpretation, authority, or permitted use. Hardware propagates and checks the tag during load, store, arithmetic, branching, and memory access, so a bit pattern cannot automatically be treated as an instruction, integer, or valid reference merely because software casts it. Tags make semantic distinctions part of machine state rather than an informal convention maintained only by compilers. Designs vary in granularity and enforcement. Historical Burroughs systems tagged control and data words to support high-level languages; Lisp machines distinguished.
Scope of Application¶
-
Historical computer architecture. Burroughs and Lisp-machine designs show hardware support for high-level semantic distinctions.
-
Capability systems. CHERI-like validity tags combine unforgeability with bounds, permissions, and provenance.
-
Memory tagging. Address and allocation tags detect mismatched, stale, or cross-object accesses under a defined reuse policy.
-
Dynamic-language execution. Machine-visible type classes accelerate dispatch and reject invalid operations.
-
Garbage collection. Pointer-versus-immediate distinctions support tracing and descriptor validation.
Clarity¶
Tagged architecture makes protected metadata about type, interpretation, authority, or permitted use part of machine state and hardware enforcement. It is not merely software type information, spare pointer bits, or a debugging annotation. Clarity requires tag granularity, who may create or alter tags, propagation rules for each operation, exception behavior, and interaction with caches and memory. The sharper architecture question is which illegal reinterpretations or authority amplifications hardware prevents and whether tag integrity survives every data path, context switch, and external interface.
Manages Complexity¶
Tagged architecture compresses semantic and authority checks into protected metadata carried with values. The machine tracks tag class, creation rights, propagation rules, permitted operations, and exception behavior; hardware then rejects illegal reinterpretation at use time. Type tags, pointer tags, capability tags, memory-coloring tags, and information-flow labels form branches with different security goals. This structure prevents every instruction sequence from re-proving software invariants and makes violations local and diagnosable, while implementation review focuses on whether tags survive caches, registers, context switches, direct memory access, and external interfaces.
Abstract Reasoning¶
Tag-reading move. Interpret metadata attached to a word, pointer, capability, or memory unit before operating on its payload. Dispatch move. Use tags to select type-specific operations, access rules, representation, or garbage-collection treatment. Safety move. Detect invalid combinations or unauthorized uses at hardware, runtime, or language boundaries. Layout move. Trade tag width, alignment, address space, and checking cost against expressiveness and protection. Boundary move. Tagged architecture is not merely a software type annotation or a label in documentation; the tag must participate in machine or runtime semantics, and tags do not eliminate all memory errors.
Knowledge Transfer¶
Within the home domain. Tagged architecture transfers across processors, virtual machines, capability systems, garbage-collected runtimes, and dynamic-language hardware where metadata attached to words or references changes permitted interpretation or operation. Payload, tag, dispatch, access check, memory layout, and exception retain mechanistic roles. Beyond the home domain (B — shared abstract mechanism). Type-tagged data and labeled objects also pair content with control metadata, sharing metadata-governed semantics. Hardware enforcement, pointer representation, and machine instructions remain home-bound. A software annotation is not itself a tagged architecture, and tags do not guarantee full memory safety or semantic correctness.
Relationships to Other Abstractions¶
Current abstraction Tagged architecture Domain-specific
Parents (1) — more general patterns this builds on
-
Tagged architecture is a kind of Computer architecture Domain-specific
Tagged architecture is a domain-specific kind of computer architecture under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Hierarchy path (1) — routes to 1 parentless root
- Tagged architecture → Computer architecture
Neighborhood in Abstraction Space¶
Tagged architecture sits in a moderately populated region (47th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Digital Circuit & Memory Architecture (12 abstractions)
Nearest neighbors
- Instruction Set Architecture — 0.88
- Signedness — 0.87
- Message Authentication Code — 0.87
- Reduced Instruction Set Computer — 0.86
- Insecure Deserialization — 0.86
Computed from structural-signature embeddings · 2026-10-08