Algorithms for Functional Programming

  • John David┬áStone

Table of contents

  1. Front Matter
    Pages i-xv
  2. John David Stone
    Pages 1-38
  3. John David Stone
    Pages 39-81
  4. John David Stone
    Pages 83-201
  5. John David Stone
    Pages 203-259
  6. John David Stone
    Pages 261-295
  7. John David Stone
    Pages 297-346
  8. John David Stone
    Pages 347-370
  9. Back Matter
    Pages 371-389

About this book


This book presents a variety of widely used algorithms, expressing them in a pure functional programming language to make their structure and operation clearer to readers. In the opening chapter the author introduces the specific notations that constitute the variant of Scheme that he uses. The second chapter introduces many of the simpler and more general patterns available in functional programming. The chapters that follow introduce and explain data structures, sorting, combinatorial constructions, graphs, and sublist search.

Throughout the book the author presents the algorithms in a purely functional version of the Scheme programming language, which he makes available on his website. The book is supported with exercises, and it is suitable for undergraduate and graduate courses on programming techniques.


Data structures Functional programming Scheme Sorting Combinatorial Constructions Graphs

Authors and affiliations

  • John David┬áStone
    • 1
  1. 1.Department of Computer ScienceGrinnell CollegeGrinnellUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Germany, part of Springer Nature 2018
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-57968-8
  • Online ISBN 978-3-662-57970-1
  • Buy this book on publisher's site