Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Algorithms: A Functional Programming Approach (International Computer Science Series)

Buy

This book is primarily an introduction to the design of algorithms for problem solving. Its prominent feature is to use a functional language as an implementation language. Because of the high level of abstraction provided, functional programs tend to be shorter, clearer and faster to develop than their imperative counterparts. This contributes to a better understanding of the algorithm being implemented and makes it possible to explore alternative solutions more rapidly. Although we believe that this is true for a wide range of algorithms, the book also discusses the limitations of functional style in dealing with certain problems.

This book is not about a particular functional language. The material is arranged in the same way as in a classic algorithms book: it is a succession of chapters on 'traditional' topics such as sorting and searching algorithms. In addition, the choice of a functional language permits the introduction of algorithm design strategies such as divide-and-conquer and dynamic programming by means of higher-order functions. New concepts such as process networks and parallel algorithms can also be introduced in a non-conventional way. Due to this extra material, topics such as lower bound proofs and N-P completeness theory are not covered.

The emphasis of the book is on intuitive and pragmatic program development tech- niques. This is only a small step forward, as we believe that functional programming provides a link between the study of algorithms and the study of correctness proofs and systematic derivation from formal specifications. We are hoping that more publications covering this area will emerge in the near future.

Another aim of this book is to provide a useful reference of functional programs related to a variety of problems. Programmers will be able to choose (or adapt) a functional program that is relevant to their problem as they already do with other languages such as Fortran. Pascal or C. We are also hoping that this book will contribute towards making functional languages more viable as a programming tool.  

(HTML tags aren't allowed.)

Graph Algorithms, Third Edition (Algorithms in Java, Part 5)
Graph Algorithms, Third Edition (Algorithms in Java, Part 5)

Graphs and Graph algorithms are pervasive in modern computing applications. This book describes the most important known methods for solving the graph-processing problems that arise in practice. Its primary aim is to make these methods and the basic principles behind them accessible to the growing number of people in need of...

Understanding and Writing Compilers: A Do It Yourself Guide (Macmillan Computer Science Series)
Understanding and Writing Compilers: A Do It Yourself Guide (Macmillan Computer Science Series)
In the past compiler writers and designers seemed to form an elite group within computing science, set apart by their esoteric knowledge and their ability to produce large, important system programs which really worked. The admiration of the computing public, whether it was once deserved or not, is no longer merited now that the principles of...
Compiler Design: Analysis and Transformation
Compiler Design: Analysis and Transformation

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages. Additional descriptions...


Problems on Algorithms
Problems on Algorithms
The ability to devise effective and efficient algorithms in new situations is a skill that separates the master programmer from the merely adequate coder. The best way to develop that skill is to solve problems. To be effective problem solvers, master-programmers-in-training must do more than memorize a collection of...
Algorithms
Algorithms

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly...

Everyday Data Structures
Everyday Data Structures

A practical guide to learning data structures simply and easily

About This Book

  • This book is a very practical, friendly, and useful guide that will help you analyze problems and choose the right data structures for your solution
  • Learn to recognize data patterns for determining which...
©2019 LearnIT (support@pdfchm.net) - Privacy Policy