This paper extends order-sorted algebras with higher-order functions.
The aim is to present a new semantics for higher-order order-sorted ty
pes in functional programming, data type specification and program tra
nsformation. Our framework unifies higher-order functions, equational
deduction, overloading and subtype polymorphism.