Skip to main content
SpringerLink
Log in

Scans and Convolutions— A Calculational Proof of Moessner’s Theorem

  • Conference paper
Implementation and Application of Functional Languages (IFL 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5836))

Included in the following conference series:

Abstract

The paper introduces two corecursion schemes for stream-generating functions, scans and convolutions, and discusses their properties. As an application of the framework, a calculational proof of Paasche’s generalisation of Moessner’s intriguing theorem is presented.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Moessner, A.: Eine Bemerkung über die Potenzen der natürlichen Zahlen. In: Aus den Sitzungsberichten der Bayerischen Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse 1951, vol. (3), p. 29 (March 1951)

    Google Scholar 

  2. Sloane, N.J.A.: The on-line encyclopedia of integer sequences, http://www.research.att.com/~njas/sequences/

  3. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics, 2nd edn. Addison-Wesley Publishing Company, Reading (1994)

    MATH  Google Scholar 

  4. Paasche, I.: Ein neuer Beweis des Moessnerschen Satzes. In: Aus den Sitzungsberichten der Bayerischen Akademie der Wissenschaften, Mathematisch-naturwissenschaftliche Klasse 1952, vol. (1), pp. 1–5 (February 1952)

    Google Scholar 

  5. Perron, O.: Beweis des Moessnerschen Satzes. In: Aus den Sitzungsberichten der Bayerischen Akademie der Wissenschaften, Mathematisch-naturwissenschaftliche Klasse 1951, vol. (4), pp. 31–34 (May 1951)

    Google Scholar 

  6. Salié, H.: Bemerkung zu einem Satz von Moessner. In: Aus den Sitzungsberichten der Bayerischen Akademie der Wissenschaften, Mathematisch-naturwissenschaftliche Klasse 1952, vol. (2), pp. 7–11 (February 1952)

    Google Scholar 

  7. Hinze, R.: Functional pearl: Streams and unique fixed points. In: Thiemann, P. (ed.) Proceedings of the 2008 International Conference on Functional Programming, pp. 189–200. ACM Press, New York (2008)

    Google Scholar 

  8. Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D., Rydeheard, D., Dybjer, P., Poigné, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357–365. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  9. Peyton Jones, S.: Haskell 98 Language and Libraries. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  10. Fokkinga, M.M., Meijer, E.: Program calculation properties of continuous algebras. Technical Report CS-R9104, Centre of Mathematics and Computer Science, CWI, Amsterdam (January 1991)

    Google Scholar 

  11. McBride, C., Paterson, R.: Functional pearl: Applicative programming with effects. Journal of Functional Programming 18(1), 1–13 (2008)

    Article  MATH  Google Scholar 

  12. Wadler, P.: Theorems for free! In: The Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA 1989), London, UK, pp. 347–359. Addison-Wesley Publishing Company, Reading (1989)

    Chapter  Google Scholar 

  13. Hinze, R., Löh, A.: Guide2lhs2tex (for version 1.14) (October 2008), http://people.cs.uu.nl/andres/lhs2tex/

  14. Long, C.: On the Moessner theorem on integral powers. The American Mathematical Monthly 73(8), 846–851 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  15. Backhouse, R.: The capacity-C torch problem. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 57–78. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Paasche, I.: Eine Verallgemeinerung des Moessnerschen Satzes. Compositio Mathematica 12, 263–270 (1954)

    MathSciNet  MATH  Google Scholar 

  17. van Yzeren, J.: A note on an additive property of natural numbers. The American Mathematical Monthly 66(1), 53–54 (1959)

    Article  MathSciNet  Google Scholar 

  18. Long, C.T.: Strike it out: Add it up. The Mathematical Gazette 66(438), 273–277 (1982)

    Article  Google Scholar 

  19. Karczmarczuk, J.: Generating power of lazy semantics. Theoretical Computer Science (187), 203–219 (1997)

    Google Scholar 

  20. McIlroy, M.D.: Power series, power serious. J. Functional Programming 3(9), 325–337 (1999)

    Article  MATH  Google Scholar 

  21. McIlroy, M.D.: The music of streams. Information Processing Letters (77), 189–195 (2001)

    Google Scholar 

  22. Rutten, J.: Fundamental study — Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science (308), 1–53 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  23. Rutten, J.: A coinductive calculus of streams. Math. Struct. in Comp. Science (15), 93–147 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, England

    Ralf Hinze

Authors
  1. Ralf Hinze
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Hertfordshire, AL10 9AB, Hatfield, UK

    Sven-Bodo Scholz

  2. School of Computing, University of Kent, CT2 7NF, Kent, UK

    Olaf Chitil

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hinze, R. (2011). Scans and Convolutions— A Calculational Proof of Moessner’s Theorem. In: Scholz, SB., Chitil, O. (eds) Implementation and Application of Functional Languages. IFL 2008. Lecture Notes in Computer Science, vol 5836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24452-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24452-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24451-3

  • Online ISBN: 978-3-642-24452-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation