The main things a TeX user needs to know about glue are discussed at What is glue stretching?, but to address the peculiar parts of this question that are not covered there: As @egreg says, it's not accurate to stretch the analogy too far. The “springs” of TeX's line-breaking algorithm are not modelled on real-life springs.
This is all described very clearly in the wonderful paper Breaking Paragraphs into Lines by Knuth and Plass. (Including the “algebra” of putting multiple boxes or glues together.)
To repeat some parts of it: abstractly, for TeX a paragraph is a sequence of
- boxes: a box has a width wi
- glue (aka springs, skips): a glue has a width wi, a stretchability yi, and a shrinkability zi. The stretchability and shrinkability may independently be positive, negative, or infinite (in fact there are multiple “orders of infinity”).
- penalties: has a penalty pi, a width wi and a flag fi which may be 1 or 0 (for the width and flag: think of hyphens).
The stretchability and shrinkability in the glue specification can be specified independently and either of them can be negative.
Some “algebra” of the sort the question asks about:
- Consecutive boxes are equivalent to a bigger box:
box(w)box(w') = box(w + w')
- Consecutive glues are equivalent to a bigger glue:
glue(w, y, z)glue(w', y', z') = glue(w+w', y+y', z+z')
(Some more stuff about penalties, omitted here.)
All this and more are described in, apart from of course The TeXbook and TeX: The Program (Volumes A and B of Computers and Typesetting), the following papers which are cited thus in the Supplementary Bibliography at the start of Volume B:
“Breaking paragraphs into lines” by Michael F. Plass and Donald E. Knuth, Software—Practice and Experience 11 (1981), 1119–1184. *Develops the theory underlying TeX's line-breaking algorithm and applies it to a variety of practical problems; includes an illustrated history of line-breaking techniques in the printing industry. An appendix discusses a simplified algorithm suitable for word processors.
“Choosing better line breaks” by Michael F. Plass and Donald E. Knuth, in Document Preparation Systems, Nievergelt et al., eds. (Amsterdam: North-Holland, 1982), 221–242. A shorter version of the preceding paper. Introduces the notion of a “kerf,” which unifies and generalizes TeX's primitive operations of glue, penalties, and discretionary breaks.