Skip to main content
  • Textbook
  • © 2021

Introduction to Computation

Haskell, Logic and Automata

  • Introduces computation, spanning the key concepts and methods
  • Highly intuitive and accessible explanatory style
  • Firm grounding in logic and automata, with an approach using Haskell
  • Request lecturer material: http://www.sn.pub/lecturer-material

Part of the book series: Undergraduate Topics in Computer Science (UTICS)

Buy it now

Buying options

eBook USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (32 chapters)

  1. Front Matter

    Pages i-xvi
  2. Sets

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 1-6
  3. Types

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 7-13
  4. Simple Computations

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 15-22
  5. Venn Diagrams and Logical Connectives

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 23-31
  6. Lists and Comprehensions

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 33-41
  7. Features and Predicates

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 43-50
  8. Testing Your Programs

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 51-59
  9. Patterns of Reasoning

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 61-69
  10. More Patterns of Reasoning

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 71-80
  11. Lists and Recursion

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 81-88
  12. More Fun with Recursion

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 89-98
  13. Higher-Order Functions

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 99-109
  14. Higher and Higher

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 111-118
  15. Sequent Calculus

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 119-130
  16. Algebraic Data Types

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 131-142
  17. Expression Trees

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 143-159
  18. Karnaugh Maps

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 161-168
  19. Relations and Quantifiers

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 169-176
  20. Checking Satisfiability

    • Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
    Pages 177-188

About this book

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.

Reviews

“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)

Authors and Affiliations

  • School of Informatics, University of Edinburgh, Edinburgh, UK

    Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler

About the authors

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.

Bibliographic Information

Buy it now

Buying options

eBook USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access