Burge, William H.; Watt, Stephen M. Infinite structures in Scratchpad II. (English) Zbl 1209.68667 Davenport, James H. (ed.), EUROCAL ’87. European Conference on Computer Algebra Leipzig, GDR, June 2-5, 1987. Proceedings. Berlin etc.: Springer-Verlag (ISBN 3-540-51517-8). Lecture Notes in Computer Science 378, 138-148 (1989). Summary: An infinite structure is a data structure which cannot be fully constructed in any fixed amount of space. Several varieties of infinite structures are currently supported in Scratchpad II: infinite sequences, radix expansions, power series and continued fractions. Two basic methods are employed to represent infinite structures: self referential data structures and lazy evaluation. These may be employed either separately or in conjunction. This paper presents recently developed facilities in Scratchpad II for manipulating infinite structures. General techniques for manipulating infinite structures are covered, as well as the higher level manipulations on the various types of mathematical objects represented by infinite structures.For the entire collection see [Zbl 1209.00079]. Cited in 5 Documents MSC: 68W30 Symbolic computation and algebraic computation Keywords:Scratchpad II Software:IBM Scratchpad PDFBibTeX XMLCite \textit{W. H. Burge} and \textit{S. M. Watt}, Lect. Notes Comput. Sci. 378, 138--148 (1989; Zbl 1209.68667) Full Text: DOI