Skip to main content

An Introduction to the Theory of Lists

  • Conference paper
Logic of Programming and Calculi of Discrete Design

Part of the book series: NATO ASI Series ((NATO ASI F,volume 36))

Abstract

In these lectures we introduce a notation and a calculus for specifying and manipulating computable functions over lists. The calculus is used to derive efficient solutions for a number of problems, including problems in text processing. Although programming per se is not the main topic, we indicate briefly how these solutions can be implemented in a purely functional programming language.

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

Access this chapter

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. Bird, R.S. Transformational programming and the paragraph problem. Science of Computer Programming 6 (1986) 159–189.

    Article  MATH  Google Scholar 

  2. Bird, R.S. The promotion and accumulation strategies in transformational programming. ACM. Trans, on Prog. Lang, and Systems 6 (1984) 487–450. Addendum Ibid 7 (1985).

    Article  MATH  Google Scholar 

  3. Bird, R.S. and Hughes, R.J.M. The alpha-beta algorithm: an exercise in program transformation. Inf. Proc. Letters (to appear 1986).

    Google Scholar 

  4. Bird, R.S. and Meertens L.G.L.T Two exercises found in a book on algorithmics. Proc. TC2 Conference on Program Specification and Transformation, Bad Tolz, W. Germany 1986 (to appear Springer LNCS 1986).

    Google Scholar 

  5. Bird, R.S. and Wadler, P. An Introduction to Functional Programming Prentice-Hall (to be published 1987).

    Google Scholar 

  6. Meertens, L.G.L.T Algorithmics — towards programming as a mathematical activity. Proc. CWI Symp. on Mathematics and Computer Science, CWI Monographs, North-Holland, 1 (1986) 289–334.

    Google Scholar 

  7. Turner, D. Recursion equations as a programming language. Functional Programming and its Applicatons, Cambridge University Press, Cambridge, U.K. 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bird, R.S. (1987). An Introduction to the Theory of Lists. In: Broy, M. (eds) Logic of Programming and Calculi of Discrete Design. NATO ASI Series, vol 36. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87374-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-87374-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-87376-8

  • Online ISBN: 978-3-642-87374-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics