Skip to main content
SpringerLink
Log in

A Declarative Specification of Giant Number Arithmetic

  • Conference paper
Practical Aspects of Declarative Languages (PADL 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8324))

Included in the following conference series:

Abstract

The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the structural complexity of their operands rather than by their bitsizes. While within constant factors from their traditional counterparts for their average and worst case behavior, our arithmetic operations open the doors for interesting numerical computations, intractable with a traditional number representation.

We provide a complete specification of our algorithms in the form of a purely declarative Prolog program.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Knuth, D.E.: Mathematics and Computer Science: Coping with Finiteness. Science 194(4271), 1235–1242 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  2. Tarau, P., Haraburda, D.: On Computing with Types. In: Proceedings of SAC 2012, ACM Symposium on Applied Computing, PL track, Riva del Garda (Trento), Italy, pp. 1889–1896 (March 2012)

    Google Scholar 

  3. Tarau, P.: A Prolog Specification of Giant Number Arithmetic. In: Rocha, R., Have, C.T. (eds.) Proceedings of the 13th International Colloquium on Implementation of Constraint Logic Programming Systems (CICLOPS 2013), Istanbul, Turkey (August 2013), http://arxiv.org/abs/1307.8389

  4. Goodstein, R.: On the restricted ordinal theorem. Journal of Symbolic Logic (9), 33–41 (1944)

    Google Scholar 

  5. Knuth, D.E.: TCALC program (December 1994)

    Google Scholar 

  6. Vuillemin, J.: Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. In: 19th IEEE Symposium on Computer Arithmetic, ARITH 2009, pp. 7–14 (June 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of North Texas, USA

    Paul Tarau

Authors
  1. Paul Tarau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, University of Utah, 50 Central Campus Drive, 84112-9205, Salt Lake City, UT, USA

    Matthew Flatt

  2. Department of Computer Science, University of Nebraska, 6001 Dodge Street, 68182, Omaha, NE, USA

    Hai-Feng Guo

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tarau, P. (2014). A Declarative Specification of Giant Number Arithmetic. In: Flatt, M., Guo, HF. (eds) Practical Aspects of Declarative Languages. PADL 2014. Lecture Notes in Computer Science, vol 8324. Springer, Cham. https://doi.org/10.1007/978-3-319-04132-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04132-2_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04131-5

  • Online ISBN: 978-3-319-04132-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation