Abstract
The paper proposes a unified approach to study and compare specification techniques and languages. It is devided into two parts: (1) A general notion of specification language is given which provides an axiomatic framework for the various known specification techniques. (2) Algebraic specification languages which admit initial semantics are characterized up to equivalence. They are shown to be exactly the implicational languages.
Supported by th MINERVA Foundation for German-Israeli collaboration while visiting the Computer Science Department at the Technion-Israel Institute of Technology in Haifa, Israel.
Supported by the Swiss National Science Foundation Grant No. 82.820.0.80
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Goguen, J., Thatcher, J., Wagner, E., Wright, J.B.: "Abstract Data Types as Initial Algebras and Correctness of Data Representations", Proc. Conf. on Comp. Graphics, Pattern Recognition and Data Structures, May 1975, pp. 89–93.
Goguen, J., Thatcher, J., Wagner, E.: Abstract Data Types as Initial Algebras and Correctness of Data Representations, Current Trends in Programming Methodology, Vol. 4 (R. Yeh, ed.), Prentice Hall, N.Y., 1978, pp. 80–149.
Andreka,H. and Nemeti,I.: Generalisation of variety and quasivariety concepts to partial algebras through category theory, Dissertationes Mathematicae (Rozprawy Math.) 204 (1982)
Bergstra, J.A., Broy, M., Tucker, J.W., Wirsing, M.: On the Power of Algebraic Specifications, Proceedings of the MFCS'81, Springer Lecture Notes 118 (1981)
Barwise,J. and Feferman,S.; Higher Model Theory: Logic of Mathematical Concepts, Springer 1983
Burstall, R.M., Goguen, J.A.; The Semantics of CLEAR, a Specification Language, Proc. of 1979 Copenhagen Winter School on Abstract Software Specifications.
Burstall, R.M., Goguen, J.A.; Institutions: Abstract model theory for program specification, unpublished draft, Stanford 1983.
Banaschewski, B. and Herrlich, H.; Subcategories defined by implications, Houston Journal of Mathematics 2.2 (1976) pp. 149–171
Cudnovskii, G.V.; Some results in the theroy of infinitely long expressions, Soviet Math.Dokl. 9 (1968) pp.556–559
Carvalho, R.L.de, Maibaum, T.S.E., Pequeno, T.H.C., Pereda, A.A. and Veloso, P.A.S.; A Model Theoretic Approach to the Theory of Abstract Data Types and Data Structures. Research Report CS-80-22, Waterloo, Ontario, 1980.
Ehrig, H.; Algebraic Theory of Parametrized Specifications with Requirements, Proceedings of the CAAP'81, Springer-Lecture Notes, No.112 (1981)
Ehrig, H., Kreowski, H.J., Thatcher, J.W., Wagner, E.G. and Wright, J.B.; Parametrized Data Types in Algebraic Specification Languages, Proceedings of the 7th ICALP'80, LNCS 85 pp. 157–168, Springer 1980
Ehrig, H., Kreowski, H.J., Mahr, B. and Padawitz, P.; Algebraic Implementation of Abstract Data Types, to appear in TCS, Fall '82.
Gratzer, G.; Universal Algebra, 2nd ed., Springer 1979
Guttag, J.V.; The Specification and Application to Programming of Abstract Data Types, TR. CSRG-59, Toronto, 1975.
Hornung, G. and Raulefs, P.: Initial and Terminal Algebra Semantics of Parametrized Abstract Data Type Specifications with Inequalities. Proceedings of the CAAP'81, LNCS No. 112, Springer 1981
Kamin, S.: "Some Definitions for Algebraic Data Type Specifications", SIGPLAN Notices 14 (3), 1979.
Kamin, S.; Final Data Type Specifications: A New Data Type Specification Method, Proc. of the 7th POPL-Conference, 1980.
Liskov, B.H. and Zilles, Z.M.: Programming with Abstract Data Types, Proc. ACM Symp. on Very High Level Languages, SIGPLAN Notices, 9, 1974, pp. 50–9
Mal'cev, A.I.: Quasiprimitive Classes of Abstract Algebras, in the Metamathematics of Algebraic Systems, Studies in Logic, Vol. 66. North-Holland, 1971, pp. 27–31.
Makowsky,J.A.; Model theoretic issues in theoretical computer science, to appear in the proceedings of the "Logic Colloquium '82", Florence 1982
Mahr, B. and Makowsky, J.A.: An axiomatic approach to semantics of specification languages, in "Theoretical Computer Science", 6th GI-Conference, Dortmund 1983, Lecture Notes in Computer Science vol. 145, pp. 211–219, Heidelberg 1983
Selman, A.: Completeness of Calculii for Axiomatically Defined Classes of Algebras, Algebra Universalis, Vol.2, Fasc. 1, 1972, pp. 20–32.
Wand,M.: Final Algebra Semantics and Data Type Extensions, Indiana TR65 (1978)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahr, B., Makowsky, J.A. (1983). Characterizing specification languages which admit initial semantics. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-12727-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12727-7
Online ISBN: 978-3-540-38714-5
eBook Packages: Springer Book Archive