Construct · 2 fields · 4 citations

Where does stack collide?

One name. Different field. Different construct. One map.

● jingle · one word, two constructs Nearest construct by meaninglayercompare the meanings
How to read this

Every construct on the map is compared with every other by the meaning of its definitions, and the closest one is surfaced here. The nearest construct to stack is layer.

Hold this as a prompt, not a verdict. Two constructs sitting close in meaning is a reason to read them side by side and decide for yourself whether they are one idea under two names. It is not proof that they are. Compare the meanings in the Collider.

stack2 CONSTRUCTSLIFO structureKNUTH · LIFOProtocol stackZIMMERMANN · OSI LAYERS

Spokes are fields; dashed arcs are shared lineage. Tap a field for its definition, unit, and measures.

1960LIFO structure1974Protocol stack
2026

Drag to watch the word get claimed. Each field appears at the publication date of the earliest source cited for it. Tap a year to see which.

Computer science

Last-in, first-out data structure

A last-in, first-out collection: items are added and removed at one end only, so the most recently pushed item is the first one popped. Knuth set out the stack in The Art of Computer Programming alongside the queue and the deque, defining it purely by the order in which elements enter and leave. The same discipline governs the call stack, where each procedure call pushes a frame that is popped when the call returns; Dijkstra used exactly this structure to make recursion work. The referent is an abstract data type, and what marks it is the ordering rule over time, not any arrangement of parts in space. It shares only the word with the layered meanings: a stack here is a rule about which item comes next, not a pile of technologies.[1][2]

Unit
A last-in, first-out ordering of elements
Recovery means
Not applicable
Measured by
Push and pop operations against the ordering invariant; correct entry and exit of call frames

Networking

a layered suite of communication protocols in which each layer serves the one above it.

A layered suite of communication protocols, where each layer handles one part of moving data between machines and offers that service to the layer above. Zimmermann set out the OSI reference model as seven such layers, an ISO architecture for open systems interconnection, while the working Internet runs the shorter TCP/IP arrangement that Cerf and Kahn's protocol began. The referent is a standardised division of communication functions, and what marks it is that the layers are defined by the job each does, with a strict interface between them. It shares the word and the layered image with the technology stack, but a protocol stack is a specification of functions, not a shelf of chosen products, and a single layer here can be filled by many different pieces of software.[3][4]

Unit
A layered division of communication functions
Recovery means
Not applicable
Measured by
Conformance of each layer to its protocol specification and interface

Next

Run it through the Collider, or take the citations with you.

See how stack sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this collision

Nearby collisions

network4 fields · 6 citationsjingle · one word, four constructscoupling4 fields · 4 citationsjingle · one word, four constructsbuffer3 fields · 3 citationsjingle · one word, three constructs

References

  1. Knuth, D. E. (1997). The art of computer programming, Volume 1: Fundamental algorithms (3rd ed.). Addison-Wesley.
  2. Dijkstra, E. W. (1960). Recursive programming. Numerische Mathematik, 2(1), 312–318. https://doi.org/10.1007/BF01386232
  3. Zimmermann, H. (1980). OSI reference model: The ISO model of architecture for open systems interconnection. IEEE Transactions on Communications, 28(4), 425–432. https://doi.org/10.1109/TCOM.1980.1094702
  4. Cerf, V., & Kahn, R. (1974). A protocol for packet network intercommunication. IEEE Transactions on Communications, 22(5), 637–648.

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct