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].

In addition suitable contents:
[ = ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ az ] [ b ] [ bi ] [ bs ] [ bt ] [ C ] [ ch ] [ cl ] [ co ] [ com ] [ con ] [ control ] [ cr ] [ de ] [ dec ] [ du ] [ E ] [ ec ] [ ed ] [ eg ] [ er ] [ es ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ Fun ] [ G ] [ ge ] [ gen ] [ gh ] [ gi ] [ Go ] [ gr ] [ gu ] [ h ] [ hing ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ inheritance ] [ int ] [ interface ] [ io ] [ it ] [ J ] [ la ] [ language ] [ laziness ] [ Lex ] [ lt ] [ ly ] [ M ] [ ma ] [ Mac ] [ Mach ] [ mil ] [ mm ] [ mo ] [ mod ] [ module ] [ modulo ] [ mu ] [ multiple inheritance ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ nn ] [ ns ] [ O ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ sa ] [ sc ] [ se ] [ si ] [ so ] [ sort ] [ st ] [ su ] [ subtype ] [ T ] [ tc ] [ th ] [ tr ] [ tt ] [ type ] [ ua ] [ us ] [ user ] [ ve ] [ vi ] [ write ] [ ws ]