Advertisement

Programming for Mathematicians

  • Raymond Séroul

Part of the Universitext book series (UTX)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Raymond Séroul
    Pages 1-4
  3. Raymond Séroul
    Pages 5-27
  4. Raymond Séroul
    Pages 29-58
  5. Raymond Séroul
    Pages 59-89
  6. Raymond Séroul
    Pages 91-107
  7. Raymond Séroul
    Pages 109-134
  8. Raymond Séroul
    Pages 135-157
  9. Raymond Séroul
    Pages 159-223
  10. Raymond Séroul
    Pages 225-252
  11. Raymond Séroul
    Pages 253-295
  12. Raymond Séroul
    Pages 297-336
  13. Raymond Séroul
    Pages 337-357
  14. Raymond Séroul
    Pages 359-422
  15. Back Matter
    Pages 423-432

About this book

Introduction

The aim of this book is to teach mathematics students how to program using their knowledge of mathematics. For this they require only to know how to construct a proof. The entire book's emphasis is on "how to think" when programming. Three methods for constructing an algorithm or a program are used: a) manipulation and enrichment of existing code; b) use of recurrent sequences; c) deferral of code writing, in order to deal with one difficulty at a time. Many theorems are mathematically proved and programmed. The last chapter explains how a compiler works and shows how to compile "by hand" little (but not trivial--even recursive) programs. The book is intended for anyone who thinks mathematically and wants to program and play with mathematics.

Keywords

Programming algorithm algorithms code transformation semantics sequences top-down programming

Authors and affiliations

  • Raymond Séroul
    • 1
  1. 1.U.F.R. de Mathématiques et d’InformatiqueUniversité Louis PasteurStrasbourgFrance

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-57129-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66422-2
  • Online ISBN 978-3-642-57129-9
  • Series Print ISSN 0172-5939
  • Series Online ISSN 2191-6675
  • Buy this book on publisher's site