Skip to main content

An Investigation of Compact and Efficient Number Representations in the Pure Lambda Calculus

  • Conference paper
  • First Online:

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

Abstract

We argue that a compact right-associated binary number representation gives simpler operators and better efficiency than the leftassociated binary number representation proposed by den Hoed and investigated by Goldberg. This representation is then generalised to higher number-bases and it is argued that bases between 3 and 5can give higher efficiency than binary representation.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guy Cousineau, Pierre-Louis Curien, Michel Mauny, and Ascander Suárez. Combinateurs catégorieques et impleméntation des languages fonctionnels. Technical Report 86-3, LIENS, 1986.

    Google Scholar 

  2. Mayer Goldberg. An adequate and efficient left-associated binary numreal system in the λ-calculus. Journal of Functional Programming, 10(6):607–623, November 2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. Jean-Louis Krivine. Un interpréteur du λ-calcul. 1985.

    Google Scholar 

  4. T. Æ. Mogensen. Self-applicable online partial evaluation of the pure lambda calculus. In William L. Scherlis, editor, Proceedings of PEPM’95, pages 39–44. ACM, ACM Press, 1995.

    Google Scholar 

  5. T. Æ. Mogensen. Gödelisation in the untyped lambda calculu. In O. Danvy, editor, Proceedings of PEPM’99. BRICS Notes Series, 1999.

    Google Scholar 

  6. W. L. van den Poel, C. E. Schaap, and G. van der Mey. New arithmetical operators in the theory of combinators. Indagationes Mathematicae, (42):271–325, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mogensen, T.Æ. (2001). An Investigation of Compact and Efficient Number Representations in the Pure Lambda Calculus. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45575-2_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43075-9

  • Online ISBN: 978-3-540-45575-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics