Abstract
This paper contributes to the systematic development of abstract data types which specify “low level” implementations of data structures like threaded trees or traversable stacks. In particular, a technique is described to “freeze” an operation of an abstract type such that its arguments become reconstructable. Thus an algebraic specification of a data structure with “construction history” evolves, which may be viewed as a formal description of an implementation using pointers.
This work was partially sponsored by the Sonderforschungsbereich 49 — Programmiertechnik — Munich.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bauer, F.L., Wossner, H.: Algorithmische Sprache und Programmentwicklung. Berlin-Heidelberg-New York: Springer 1981 (to appear)
Guttag, J.V., Horning, J.J.: The algebraic specification of abstract data types. Acta Informatica 10, 27–52 (1978)
Kapur, D.: Specification of Majster’s traversable stack and Veloso’s traversable stack. ACM SIGPLAN Notices 14: 5, 46–53 (1979)
Knuth, D.E.: The art of computer programming, Vol. 1: Fundamental algorithms. Reading, Mass.: Addison-Wesley 1968
Laut, A.: Deriving a computation structure for program trees from a context-free grammar. Technical University Munich, Internal Report 1978
Laut, A.: Safe procedural implementations of algebraic types. Inform. Proc. Letters 11, 147–151 (1980)
Laut, A., Möller, B.: Mutual development of the abstract data type TREE and the function preorder. Technical University Munich, Internal Report 1979
Majster, M. E.: Limits of the “algebraic” specification of abstract data types. ACM SIGPLAN Notices 12: 10, 37–42 (1977)
Merzenich, W.: A binary operation on trees and an initial algebra characterization for finite tree types. Acta Informatica 11, 149–168 (1979)
Partsch, H., Broy, M.: Examples for change of types and object structures. In: Program construction (F.L. Bauer, M. Broy, eds.), Lecture Notes in Computer Science 69, 421–463 (1979)
Perlis, A.J., Thornton, C.: Symbol manipulation by threaded lists. Comm. ACM 3, 195 — 204 (1960)
Wirsing, M., Pepper, P., Partsch, H., Dosch, W., Broy, M.: On hierarchies of abstract data types. Technical University Munich, TUM-I8007, 1980
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Laut, A. (1981). Developing Algebraic Specifications of Threaded Data Structure Implementations. In: Goos, G. (eds) Werkzeuge der Programmiertechnik. Informatik-Fachberichte, vol 43. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68064-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-68064-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10725-5
Online ISBN: 978-3-642-68064-9
eBook Packages: Springer Book Archive