Introduction to Computation
Springer International Publishing (Verlag)
978-3-030-76907-9 (ISBN)
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.
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.
"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)
“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)
Erscheinungsdatum | 27.01.2022 |
---|---|
Reihe/Serie | Undergraduate Topics in Computer Science |
Zusatzinfo | XVI, 366 p. 284 illus., 13 illus. in color. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 210 x 279 mm |
Gewicht | 944 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Schlagworte | algorithms • Automata • computing • Haskell • Introduction • Logic • Mathematics of Computing |
ISBN-10 | 3-030-76907-0 / 3030769070 |
ISBN-13 | 978-3-030-76907-9 / 9783030769079 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich