Cantitate/Preț
Produs
Total produse
Vezi coșul
Introduction to Computation: Haskell, Logic and Automata de Donald Sannella

Introduction to Computation: Haskell, Logic and Automata: Undergraduate Topics in Computer Science

Autor Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
en Limba Engleză Paperback – 20 ian 2022
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.
Citește tot Restrânge

Din seria Undergraduate Topics in Computer Science

Preț: 20645 lei

Preț vechi: 25807 lei
-20% Nou

Puncte Express: 310
Preț estimativ în valută:
3951€ • 4104$ • 3282£

Carte disponibilă

Livrare economică 11-25 ianuarie 25
Livrare express 31 decembrie 24 - 04 ianuarie 25 pentru 4216 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030769079
ISBN-10: 3030769070
Pagini: 366
Ilustrații: XVI, 366 p. 284 illus., 13 illus. in color.
Dimensiuni: 210 x 279 x 26 mm
Greutate: 0.86 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seria Undergraduate Topics in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.

Recenzii

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

Notă biografică

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.

Textul de pe ultima copertă

Computation is a process of calculation involving arithmetic and logical steps, following a given set of rules (an algorithm).
This uniquely accessible textbook introduces students to computation using a very distinctive approach, quite rapidly leading them into essential topics with sufficient depth, yet in a highly intuitive manner. The work is anchored in coverage of functional programming (in Haskell), symbolic logic, and finite automata-- each a critical component of the foundations of Informatics, and together offering students a clear glimpse into an intellectual journey beyond mere mastery of technical skills. From core elements like types, Venn diagrams and logic, to patterns of reasoning, sequent calculus, recursion and algebraic data types, the book spans the breadth of key concepts and methods that will enable students to readily progress with their studies in Computer Science.
Topics and features:
  • Spans the key concepts and methods that underpin computation
  • Develops symbolic logic, with a view toward honing clarity of thought; and automata, as a foundation for future study of both their applications and related theoretical topics
  • Introduces powerful functional programming ideas that will be useful regardless which programming languages are used later
  • Provides numerous exercises to support a clear and open, accessible approach
  • Offers a dedicated website with resources for instructors and students, including code and links to online information
  • Includes a wide array of marginal notes, empowering readers to "go beyond" the content presented
  • Approaches logic and automata through Haskell code, to bring key concepts alive and foster understanding through experimentation
Assuming no formal background in programming, this highly practical and accessible textbook provides the grounding fundamentals of computation for undergraduate students. Its flexible, yet clearexpository style also makes the book eminently suitable as a self-study instructional guide for professionals or nonspecialists interested in these topics.
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 will soon pursue research interests in machine learning and machine intelligence at Cambridge University, Cambridge, UK.

Caracteristici

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