JoSeph Goguen 1976. A family of declarative "ultra high level" languageS. AbStract typeS, generic moduleS, SubSortS (SubtypeS with multiple inheritance), pattern-matching modulo equationS, E-StrategieS (uSer control over lazineSS), module expreSSionS (for combining moduleS), theorieS and viewS (for deScribing module interfaceS). For the maSSively parallel RRM (Rewrite Rule Machine). ["Higher-Order FunctionS ConSidered UnneceSSary for Higher-Order Programming", J.A. Goguen, in ReSearch TopicS in Functional Programming].