Introduction to Computation

Haskell, Logic and Automata

Donald Sannella, Michael Fourman, Haoran Peng , Philip Wadler

$97.95

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer Nature Switzerland AG
20 January 2022

Algorithms & data structures; Mathematical theory of computation

Series: Undergraduate Topics in Computer Science

Computation, itself a form of calculation, incorporates steps that include arithmetical and non-arithmetical (logical) steps following a specific set of rules (an algorithm). This uniquely accessible textbook introduces students using a very distinctive approach, quite rapidly leading them into essential topics with sufficient depth, yet in a highly intuitive manner. From core elements like sets, types, Venn diagrams and logic, to patterns of reasoning, calculus, recursion and expression trees, the book spans the breadth of key concepts and methods that will enable students to readily progress with their studies in Computer Science.

By: Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
Imprint: Springer Nature Switzerland AG
Country of Publication: Switzerland
Edition: 1st ed. 2021
Dimensions: Height: 279mm, Width: 210mm,
Weight: 944g
ISBN: 9783030769079
ISBN 10: 3030769070
Series: Undergraduate Topics in Computer Science
Pages: 366
Publication Date: 20 January 2022
Audience: Professional and scholarly , Undergraduate
Format: Paperback
Publisher's Status: Active

1. Sets.- 2. Types.- 3. Simple Computations.- 4. Venn Diagrams and Logical Connectives.- 5. Lists and Comprehensions.- 6. Features and Predicates.- 7. Testing Your Programs.- 8. Patterns of Reasoning.- 9. More Patterns of Reasoning.- 10. Lists and Recursion.- 11. More Fun with Recursion.- 12. Higher-Order Functions.- 13. Higher and Higher.- 14. Sequent Calculus.- 15. Algebraic Data Types.- 16. Expression Trees.- 17. Karnaugh Maps.- 18. Relations and Quantifiers.- 19. Checking Satisfiability.- 20. Data Representation.- 21. Data Abstraction.- 22. Efficient CNF Conversion.- 23. Counting Satisfying Valuations.- 24. Type Classes.- 25. Search in Trees.- 26. Combinatorial Algorithms.- 27. Finite Automata.- 28. Deterministic Finite Automata.- 29. Non-Deterministic Finite Automata.- 30. Input/Output and Monads.- 31. Regular Expressions.- 32 Non-Regular Languages.- Index.

Prof. Donald Sannella, Prof. Michael Fourman, and Prof. Philip Wadler are each at the University of Edinburgh's School of Informatics, Edinburgh, UK. Mr. Haoran Peng is also at the same university department.

Reviews for Introduction to Computation: Haskell, Logic and Automata

“This book is intended as a textbook for an introductory course in computation for students beginning in informatics. No prerequisites are needed, all concepts, even elementary ones ... . it is also very suited for self-study, even if a reader is interested in Haskell or symbolic logic alone. ... Comprehension is supported by exercises for each chapter ... .” (Dieter Riebesehl, zbMATH 1497.68005, 2022)