Abstract
A way of integrating predefined data type constructions into the framework of algebraic specifications is proposed in such a way that some standard results such as existence of initial and terminal algebras for hierarchical specifications are preserved. A general technique is presented which includes as special cases higher-order function spaces, cartesian products and standard power-set constructions. The central idea is to employ the generation principle also for the built-in constructions; this means that e.g. in the higher-order case not all functions use considered but only those that can be denoted by terms. This leads to a particularly simple theory by which the extended specifications can be related to the usual first-order ones.
This research has been partially sponsored by the ESPRIT-project 436, METEOR (MW) and by grants from the Polish Academy of Sciences and from the Science and Engineering Research Council (AT).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F.L. Bauer, H. Wössner: Algorithmic Language and Program Development. Berlin: Springer, 1982.
M. Broy, C. Pair, M. Wirsing: A systematic study of models of abstract data Types. Theoretical Computer Science 33, 1984, 139–174.
M. Broy: Partial interpretations of higher order algebraic types. Lecture Notes of the International Summer School on Logic of Programming and Calculi of Discrete Design, Marktoberdorf, 1986.
R.M. Burstall, J.A. Goguen: The semantics of CLEAR, a specification language. Proc. Advanced Course on Abstract Software Specifications, Copenhagen. Lecture Notes in Computer Science 86, Berlin: Springer, 1980, 292–332.
H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 1. EATCS Monographs on Theoretical Computer Science 6, Berlin: Springer, 1985.
H.J. Keisler: Model Theory for Infinitary Logic. Studies in Logic and Foundations of Mathematics, Vol. 62, 1971.
B. Mahr, J.A. Makowsky: Characterising specification languages which admit initial semantics, Theoretical Computer Science 31, 1984, 49–59.
R. Milner: Fully abstract semantics of typed λ-calculi. Theoretical Computer Science 4, 1977, 1–22.
B. Möller: Algebraic specifications with higher-order operators. In: L. Meertens (ed.): Proc. IFIP TC2 Working Conference on Program Specification and Transformation, Bad Tölz, April 1986. Amsterdam: North-Holland, 1987, 367–392.
B. Möller: Higher-order algebraic specifications. Fakultät für Mathematik und Informatik der TU München, Habilitationsschrift, 1987.
G.D. Plotkin: LCF considered as a programming language. Theoretical Computer Science 4, 1977, 223–255.
A. Poigné: On specifications, theories, and models with higher types. Information and Control 68, 1986, 1–46.
A. Tarlecki: On the existence of free models in abstract algebraic institutions. Theoretical Computer Science 37, 1985, 269–304.
A. Tarlecki: Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Sciences 33, 1986, 333–360.
A. Tarlecki, M. Wirsing: Continuous abstract data types. Fundamenta Informaticae 9, 1986, 95–125.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Möller, B., Tarlecki, A., Wirsing, M. (1988). Algebraic specification with built-in domain constructions. In: Dauchet, M., Nivat, M. (eds) CAAP '88. CAAP 1988. Lecture Notes in Computer Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026101
Download citation
DOI: https://doi.org/10.1007/BFb0026101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19021-9
Online ISBN: 978-3-540-38930-9
eBook Packages: Springer Book Archive