Introduction. Basic Mathematical Vocabulary. On Definitions and Specifications. Conditional Expressions. Local Definitions. Recursive Function Definitions. Designing Recursive Definitions. More Complex Recursion. High-Order Data: Sequences. Our Main Tool: Induction. Proving Facts about Recursively Defined Functions. Tail Recursion. Iterative Algorithms. From Recursion to Iteration and Back. Partial and Total Correctness. How to Design Iterative Algorithms. Computer Programming. Solutions of Exercises. Recommendations for Further Reading. Index of Technical Terms. Index.
A feature of modern advanced computing is the functional approach to programming. In this book, the authors present an introduction to the mathematics which underline functional programming, emphasizing the understanding of definition and specification--a prerequisite of good programming and problem solving with a computer. The book is self-contained, requiring a low level of mathematical sophistication and may be used as an introduction to the mathematics of programming.
Provides an introduction to the functional approach to programmingEmphasizes the problem to be solved, not the programming languageTakes the view that all computer programs are a definition of a functionIncludes exercises for each chapterCan be used as a pre-programming language introduction to the mathematics of computing.
Undergraduate students in computer science or mathematics taking a functional/formal methods approach to a first course in computing.
- No. of pages:
- © Academic Press 1991
- 28th January 1991
- Academic Press
- eBook ISBN:
@qu:This book is highly recommended for undergraduates and for software engineers looking for a gentle introduction to the mathematics of programming. @source:--NEW SCIENTIST