Abstract
This paper gives a proposal for how order-sorted algebraic
specification languages can be extended with higher-order
functions. The approach taken is a generalisation to the
order-sorted case of an approach given by Mller, Tarlecki and
Wirsing for the many-sorted case. The main idea in the proposal is
to only consider reachable extensional algebras. This leads to a
very simple theory, where it is possible to relate the
higher-order specifications to first-order specifications.
Original language | English |
---|---|
Journal | Theoretical Computer Science |
Volume | 183 |
Issue number | 2 |
Pages (from-to) | 157-185 |
ISSN | 0304-3975 |
Publication status | Published - 1997 |