Abstract
In the previous chapter, we introduced a VDM composite object, which is the basic mechanism for giving a well-defined structure to a data object. We used composite objects to represent simple record type structures that could be associated together in sets. We implemented these sets in code as linked lists. It is possible to make explicit the linking together of a series of composite objects in the form of a list or a binary tree. We do this by specifying such objects in a recursive manner. We will examine this in the first part of this chapter. In the second part we shall introduce the VDM sequence type, a very useful form of data structure which encapsulates the common programming notion of a list of items without having to resort to the kind of recursive specification which will be described in part one.
Preview
Unable to display preview. Download preview PDF.
References
M.B. Feldman, Data Structures with Modula-2, (1988), Prentice-Hall
E.B. Koffman, Problem Solving and Structured Programming in Modula-2, (1988) Addison-Wesley
C.B. Jones, Systematic Software Development using VDM (2nd edition), (1990) Prentice-Hall
L. Nyhoff & S. Leestma, Data Structures and Program Design in Modula-2, (1990) Macmillan
Author information
Authors and Affiliations
Copyright information
© 1992 F.D. Rolland
About this chapter
Cite this chapter
Rolland, F.D. (1992). Further Structured Data Types. In: Programming with VDM. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-12692-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-349-12692-7_6
Publisher Name: Palgrave, London
Print ISBN: 978-1-349-12694-1
Online ISBN: 978-1-349-12692-7
eBook Packages: EngineeringEngineering (R0)