Skip to main content
SpringerLink
Log in

Infinite structures in scratchpad II

  • Applications And Systems
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. H. Rutishauser [1954], Der Quotienten-Differenzen-Algorithmus, Z. Angew. Math. Physik 5 233–251.

    Article  Google Scholar 

  2. H.B. Curry and R. Feys [1958], Combinatory Logic, North Holland, Amsterdam.

    Google Scholar 

  3. P. Henrici [1977], Applied and Computational Complex Analysis, Volume 2, John Wiley & Sons.

    Google Scholar 

  4. R.D. Jenks and B.M. Trager [1981], A Language for Computational Algebra, Proc. 1981 ACM Symposium on Symbolic and Albebraic Computation.

    Google Scholar 

  5. H. Abelson and G. Sussman (with J. Sussman) [1985], Structure and Interpretation of Computer Programs, The MIT Press, Cambridge Mass.

    Google Scholar 

  6. R.D. Jenks, R.S. Sutor and S.M. Watt [1986], “Scratchpad II: An Abstract Datatype System for Mathematical Computation” in Mathematical Aspects of Scientific Software, J. R. Rice ed., IMA Volumes in Mathematics and Its Applications, Volume 14, Springer-Verlag, New York, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, Box 218, 10598, Yorktown Heights, NY, USA

    William H. Burge & Stephen M. Watt

Authors
  1. William H. Burge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen M. Watt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burge, W.H., Watt, S.M. (1989). Infinite structures in scratchpad II. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation