Trigpoint
Collections › Personal Knowledge Management › Hypertext and transclusion
“A link is a link”: it is not that simple.

Hypertext and transclusion

Hypertext & Transclusion · Nelson (1965)
Bibliography checked ✓ Personal knowledge management · history of ideas Tell the editor privately ▸
In three sentences The word "hypertext" is defined in Nelson's 1965 paper, meaning interconnected text that paper cannot present. Transclusion, which Nelson says his concept already contained, goes one layer deeper: the same content is embedded by reference in several places, so changing the source changes every instance. The bidirectional links and block embeds in today's note-taking tools are partial realisations of that vision.

↳ Seen a counter-example?

Two kinds of link: jump and transclusion Nelson (1965) Jump hyperlink (what the Web took) Document A Document B one-way jump B does not know Transclusion (the Xanadu vision; today's block embeds) Source S a single canonical copy Document A [S transcluded here] Document B [S transcluded here] embedded by reference, not copied: change the source, all update The Web took the jump and dropped transclusion and two-way links: an engineering trade, not a refutation. Figure: trigpoint.pub
Figure 1 · Two kinds of link. A jump hyperlink is one-way and the target does not know it has been linked. Transclusion embeds content by reference in several places, so a change at the source propagates everywhere. The Web took the first and dropped the second, which was an engineering trade rather than a refutation of the vision. Redrawn. View full size ▸

1. What happened

Nelson's problem was this: human thought is interconnected, changing and indeterminate, while paper and sequential file structures force it into a line. In a 1965 ACM conference paper he proposed a file structure capable of carrying non-linear text, and set out a definition of hypertext for that kind of text. A 1963 coinage is often reported, but no primary source from Nelson was found[1]Nelson, T. H. (1965). Complex Information Processing: A File Structure for the Complex, the Changing and the Indeterminate. Proceedings of the ACM 20th National Conference, 84–100. DOI 10.1145/800197.806036. Bibliographic details checked against the official record. Claims matched against the full text. Attribution note: the word “hypertext” is defined in this paper (page 96), the most widely cited place. Nelson himself says that his FID conference paper of the same year, “The Hypertext”, was the first publication in which he used the term..

The deeper mechanism in the vision is transclusion: content exists in many places by reference rather than by copy, so a change at the source propagates to every embedding. That word is generally credited to Literary Machines, first published in 1981 (which edition first uses it was not checked here), although Nelson says the concept already sits inside the 1965 description[2]Nelson, T. H. (1981). Literary Machines. Swarthmore, PA: self-published. Bibliographic details cross-checked against multiple sources. The attribution of the word \"transclusion\" to this book follows secondary accounts that agree with one another. Attribution note: the word “transclusion” is generally credited to this book (this page did not check which edition first uses it) and defined as the same content knowably in more than one place. The concept is already present in the description in the 1965 paper. The first edition is 1981, per the copyright pages of the first and third editions held by the Internet Archive; some catalogues give 1980..

The complete vision, with bidirectional links, transclusion, versioning and micropayments, was never fully realised. Project Xanadu became a famously unfinished long-running project, and the thing that actually made hypertext universal was the Web, which deliberately dropped bidirectionality and transclusion in exchange for simplicity and scale.

Attribution where due: The concept ancestor is Bush's associative trails of 1945, which Nelson cites as a precedent[3]Bush, V. (1945). As We May Think. The Atlantic, 176(1), 101–108. Verification inherited from Memex; not re-run here. Attribution note: associative trails are the conceptual ancestor of hypertext. Nelson cites them as a precedent.. A 1963 coinage is commonly reported, but no primary source from Nelson was found; the 1965 ACM paper defines the word, though by Nelson's own note it is not his first publication to use it. The word transclusion is generally credited to the 1981 first edition of Literary Machines, more than a decade after the concept by Nelson's own account. Concept, coinage and printing are three separate things and each needs its own credit.

2. Why this matters to you

Distinguish three different promises hiding behind the word "link". A jump, which is the Web's hyperlink, one-way, with the target unaware. Backward visibility, where both ends know about each other. And embedded synchronisation, where content is transcluded rather than copied.

If your note tool supports backlinks and block embeds, it is doing precisely the part of the vision the Web discarded. So "a link is a link" does not hold: the three promises differ in maintenance cost and in payoff, and each is worth asking about separately when choosing a tool.

There is a second lesson in Xanadu. Never shipping is not the same as being wrong. Features sacrificed by one generation's engineering trade can be vindicated decades later under different constraints, and reading "unrealised" as "worthless" means missing the designs that are currently coming back.

Verification layer · Members
The guided layer of this node is open to all readers.
Verification details and failure boundaries are for members.

Lab cases Written only where there is evidence

No field record for this node yet.

References

How to read the source notes “Bibliographic details checked” means author, year, title and venue were confirmed. It does not mean the source's claims were checked. “Matched against the full text” means the claim was compared with the text of the source itself. “Follows secondary accounts” means the claim rests on sources that report it, not on the original document. “Verification inherited” means the check was done on another page of this site and not repeated here. Definitions as of 2026-09-20.

  1. [1] Nelson, T. H. (1965). Complex Information Processing: A File Structure for the Complex, the Changing and the Indeterminate. Proceedings of the ACM 20th National Conference, 84–100. https://doi.org/10.1145/800197.806036 ↩
  2. [2] Nelson, T. H. (1981). Literary Machines. Swarthmore, PA: self-published. Bibliographic details cross-checked against multiple sources. The attribution of the word \"transclusion\" to this book follows secondary accounts that agree with one another. First edition 1981; some catalogues give 1980. ↩
  3. [3] Bush, V. (1945). As We May Think. The Atlantic, 176(1), 101–108. https://www.theatlantic.com/magazine/archive/1945/07/as-we-may-think/303881/ ↩

↳ Is a citation wrong?

Tell the editor privately: a correction, a counter-example or where it applies

An editor reviews submissions once a week. Once a note is handled, its summary and response are listed on the discussion and response record; nothing is published before then. No sign-up is needed, and the nickname may be left blank.

What are you submitting?
Set a public name to be credited by name ▸
Submit anonymously, without signing in

Signing in lets you follow the status on your page. What you have written is kept.

You are signed in: this note is linked to your account, visible only to you and the editor, so you can follow its status on your page. The text is never published. Full privacy policy ▸

Submit anonymously instead, not linked to your account ▸

No email is collected. Your original text and nickname are read only by the editor and are never published; the discussion and response record carries only a summary the editor writes. The human check is provided by Cloudflare Turnstile. To limit abuse, the system keeps a hash of your IP address, not the address itself. Your original text is stored with our cloud provider and can be deleted on request. Full privacy policy ▸

Response record ▸