The Functional Approach to Programming

The Functional Approach to Programming

ISBN-10:
0521576814
ISBN-13:
9780521576819
Pub. Date:
10/29/1998
Publisher:
Cambridge University Press
ISBN-10:
0521576814
ISBN-13:
9780521576819
Pub. Date:
10/29/1998
Publisher:
Cambridge University Press
The Functional Approach to Programming

The Functional Approach to Programming

$92.99
Current price is , Original price is $92.99. You
$92.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

A programming course should concentrate on a program's logical structure and design rather than on simply writing code. The functional approach to programming achieves this aim because logical concepts are evident and programs are transparent, and so can be written quickly and cleanly. In this book, the authors emphasize the notions of function and relate programming to familiar concepts from mathematics and logic. They introduce functional programming via examples but also explain what programs compute and how to reason about them. They show how the ideas can be implemented in the Caml language, a dialect of the ML family, and give examples of how complex programs from a variety of areas (such as arithmetic, tree algorithms, graph algorithms, text parsing and geometry) can be developed in close agreement with their specifications. Many exercises and examples are included throughout the book; solutions are also available. An appendix gives all the code used in the book in Standard ML.

Product Details

ISBN-13: 9780521576819
Publisher: Cambridge University Press
Publication date: 10/29/1998
Edition description: ENGLISH ED
Pages: 460
Product dimensions: 7.44(w) x 9.69(h) x 0.94(d)

Table of Contents

Introduction; Part I. Basic Principles: 1. Expressions; 2. Data structures; 3. Semantics; 4. Imperative aspects; Part II. Applications: 5. Exact arithmetic; 6. Formal terms, filtering, and unification; 7. Balanced trees; 8. Graphs and problem resolution; 9. Syntactic analysis; 10. Geometry and designs; Part III. Implementation: 11. Evaluation; 12. Compilation; 13. Types and typing; Appendix 1. Help for Caml Light 0.6; Appendix 2. How to Get Caml, MLgraph, and the examples; Bibliography; Index.
From the B&N Reads Blog

Customer Reviews