Donald Sannella: Introduction to Computation

Cover: 9783030769079 | Introduction to Computation | Haskell, Logic and Automata | Buch | xvi

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

44,15 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

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.

Über den Autor

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.

Zusammenfassung

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: [...]

Inhaltsverzeichnis

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.

Details

Erscheinungsjahr:	2022
Genre:	Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Reihe:	Undergraduate Topics in Computer Science
Inhalt:	xvi 366 S. 271 s/w Illustr. 13 farbige Illustr. 366 p. 284 illus. 13 illus. in color.
ISBN-13:	9783030769079
ISBN-10:	3030769070
Sprache:	Englisch
Ausstattung / Beilage:	Paperback
Einband:	Kartoniert / Broschiert
Autor:	Sannella, Donald Wadler, Philip Peng, Haoran Fourman, Michael
Auflage:	1st ed. 2021
Hersteller:	Springer International Publishing Springer International Publishing AG Undergraduate Topics in Computer Science
Maße:	279 x 210 x 21 mm
Von/Mit:	Donald Sannella (u. a.)
Erscheinungsdatum:	20.01.2022
Gewicht:	0,934 kg

Artikel-ID: 119920705