This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Goguen, J.W. Thatcher, E.G. Wagner: An initial algebra approach to specification, correctness and implementation of abstract data types. In: Current Trends in Programming Methodology IV: Data Structuring (R. Yeh, ed.), Prentice Hall (1978), 80–144.
H. Andreka, B. Burmeister, I. Nemeti: Quasivarieties of partial algebras — a unifying approach towards a two-valued model theory for partial algebras. TH Darmstadt, FB Mathematik, Preprint Nr. 557.
M. Bergman, P. Deransart: Abstract data types and rewriting systems: Application to the programming of algebraic abstract data types in Prolog. 6th CAAP, Genova, March 1981.
J. Bergstra, J. Tucker: Initial and final algebra semantics for data type specifications: Two characterisation theorems. Math. Centre, Dept. of Comp. Science Report IW 142, Amsterdam, 1980.
J.A. Bergstra, M. Broy, J.V. Tucker, M. Wirsing: On the power of algebraic specifications. To appear.
M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing: Existential quantifiers in abstract data types. 6th ICALP, Graz, 1979, LNCS 71, 73–87 (1979).
M. Broy, M. Wirsing: Programming languages as abstract data types. In: M. Dauchet (ed.): Lille Colloque 80.
M. Broy, M. Wirsing: Initial versus terminal algebra semantics for partially defined abstract types. Tech. Universität München, Institut für Informatik, TUM-I8018, December 1980.
H. Ehrig, H.J. Kreowski, P. Padawitz: Stepwise specification and implementation of abstract data types. 5th ICALP, Udine, LNCS 62, 205–226, 1978.
J.V. Guttag, E. Horowitz, D.R. Musser: The design of data type specifation. 2nd Int. Conf. on Software Engineering, ACM/IEEE, 1976.
J.V. Guttag, J.J. Horning: The algebraic specification of abstract data types. Acta Informatica 10, 27–52 (1978).
G. Hornung, P. Raulefs: Terminal algebra semantics and retractions for abstract data types. 7th ICALP (1980), LNCS 85, 310–323.
G. Huet: Confluent reductions: Abstract properties and applications to term rewriting systems. 18th IEEE Symp. of Foundations of Comp. Science (1977), 30–45.
G. Huet, D. Oppen: Equations and rewrite rules: a survey. In: R. Book (ed.) Formal languages: Perspectives and open problems. Academic Press, 1980.
H.A. Klaeren: A simple class of algorithmic specifications for abstract software modules. 9th MFCS, Rydzyna, LNCS 88, 362–374, 1980.
J. Loeckx: Algorithmic specifications of abstract data types. Universität Saarbrücken, Rep. A 80/12.
P. Padawitz: New results on completeness and consistency of abstract data types. 9th MFCS, Rydzyna, LNCS 88, 460–473, 1980.
G.D. Plotkin: A powerdomain construction. SIAM J. of Comp., 5, 452–487,1976.
H. Reichel: Initially restricting algebraic theories. 9th MFCS, Rydzyna, LNCS 88, 504–514, 1980.
M. Wand: Final algebra semantics and data type extensions. Indiana University TR65, 1978.
M. Wirsing, M. Broy: Abstract data types as lattices of finitely generated models. 9th MFCS, Rydzyna, LNCS 88, 673–685, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broy, M., Wirsing, M. (1981). On the algebraic extensions of abstract data types. In: Díaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_101
Download citation
DOI: https://doi.org/10.1007/3-540-10699-5_101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10699-9
Online ISBN: 978-3-540-38654-4
eBook Packages: Springer Book Archive