In: Bernhard Moeller, Helmut Partsch and Steve Schumann (editors), Formal Program Development. Lecture Notes in Computer Science 755, pp. 355-371,1993.

Authors: Doaitse Swierstra and Oege de Moor
>

Abstract

It is often convenient to describe an program as a number of consecutive stages: one first stage builds up a structure which is then consumed by the next stage. We call the intermediate data structures virtual because they can often be eliminated. In this paper, we develop a general theory of virtual data structures, and we apply it to a number of example problems.

(PS)

BIBTEX:

           @inproceedings{sdp93swierstra, 
           author = "S. Doaitse Swierstra and De Moor, Oege",
           title = "Virtual Data Structures", 
           booktitle = "Formal Program Development", 
           editor = "B. Moeller and H. Partsch and S. Schumann",
           series = "Lecture Notes in Computer Science",
           volume = "755",
           pages = "355-371", 
           year = "1993"}