Well-respected text for computer science students provides an accessible introduction to functional programming. Cogent examples illuminate the central ideas, and numerous exercises offer reinforcement. Includes solutions. 1989 edition.
Gregory Michaelson is a Professor of Computer Science and Mathematics at Heriot-Watt University in Edinburgh, Scotland.
Preface 1. Introduction 2. Lambda Calculus 3. Conditions, booleans, and numbers 4. Recursion and arithmetic 5. Types 6. Lists and Strings 7. Composite values and trees 8. Evaluation 9. Functional programming in Standard ML 10. Functional programming and LISP Answers to exercises Bibliography Index
Show moreWell-respected text for computer science students provides an accessible introduction to functional programming. Cogent examples illuminate the central ideas, and numerous exercises offer reinforcement. Includes solutions. 1989 edition.
Gregory Michaelson is a Professor of Computer Science and Mathematics at Heriot-Watt University in Edinburgh, Scotland.
Preface 1. Introduction 2. Lambda Calculus 3. Conditions, booleans, and numbers 4. Recursion and arithmetic 5. Types 6. Lists and Strings 7. Composite values and trees 8. Evaluation 9. Functional programming in Standard ML 10. Functional programming and LISP Answers to exercises Bibliography Index
Show morePreface 1. Introduction 2. Lambda Calculus 3. Conditions, booleans, and numbers 4. Recursion and arithmetic 5. Types 6. Lists and Strings 7. Composite values and trees 8. Evaluation 9. Functional programming in Standard ML 10. Functional programming and LISP Answers to exercises Bibliography Index
Gregory Michaelson is a Professor of Computer Science and Mathematics at Heriot-Watt University in Edinburgh, Scotland.
|
Ask a Question About this Product More... |
|
