Abstract
The theory of institutions as introduced by Goguen and Burstall formalizes the notion of a logical system, and it allows to study many aspects of programming methodology independently of the underlying logical system. In this paper we present an institutional study of implementations. As an illustration we show how implementations of loose algebraic specifications constitute an institution. In particular, the horizontal structuring properties of implementations are investigated and it is shown that parameterization and implementation operations are compatible with each other. Conditions are given under which these results carry over to implementations in arbitrary institutions.
Cite
CITATION STYLE
Beierle, C., & Voß, A. (1987). Viewing implementations as an institution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 283 LNCS, pp. 196–218). Springer Verlag. https://doi.org/10.1007/3-540-18508-9_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
