|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
on1293296397 |
| 003 |
OCoLC |
| 005 |
20240909213021.0 |
| 006 |
m o d |
| 007 |
cr |n||||||||| |
| 008 |
220125s2021 sz a o 001 0 eng d |
| 040 |
|
|
|a YDX
|b eng
|e rda
|e pn
|c YDX
|d GW5XE
|d EBLCP
|d OCLCO
|d OCLCF
|d OCLCQ
|d OCLCO
|d OCLCL
|d OCLCQ
|d N$T
|
| 019 |
|
|
|a 1293258208
|a 1293480341
|a 1293652439
|a 1293775452
|a 1293847471
|
| 020 |
|
|
|a 9783030769086
|q (electronic bk.)
|
| 020 |
|
|
|a 3030769089
|q (electronic bk.)
|
| 020 |
|
|
|z 9783030769079
|
| 020 |
|
|
|z 3030769070
|
| 024 |
7 |
|
|a 10.1007/978-3-030-76908-6
|2 doi
|
| 035 |
|
|
|a (OCoLC)1293296397
|z (OCoLC)1293258208
|z (OCoLC)1293480341
|z (OCoLC)1293652439
|z (OCoLC)1293775452
|z (OCoLC)1293847471
|
| 050 |
|
4 |
|a QA76.9.M35
|b S36 2021
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Sannella, D.
|q (Donald),
|d 1956-
|e author.
|1 https://id.oclc.org/worldcat/entity/E39PCjxwvwhWQrRKJTrJdFhmBP
|
| 245 |
1 |
0 |
|a Introduction to computation :
|b Haskell, logic and automata /
|c Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler.
|
| 264 |
|
1 |
|a Cham :
|b Springer,
|c [2021]
|
| 264 |
|
4 |
|c ©2021
|
| 300 |
|
|
|a 1 online resource :
|b illustrations (some color).
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Undergraduate topics in computer science,
|x 2197-1781
|
| 500 |
|
|
|a Includes index.
|
| 520 |
|
|
|a 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 clear expository 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.
|
| 505 |
0 |
|
|a 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.
|
| 588 |
0 |
|
|a Online resource; title from PDF title page (SpringerLink, viewed January 31, 2022).
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
7 |
|a Computer science
|x Mathematics
|2 fast
|
| 700 |
1 |
|
|a Fourman, Michael,
|e author.
|
| 700 |
1 |
|
|a Peng, Haoran,
|e author.
|
| 700 |
1 |
|
|a Wadler, Philip,
|d 1956-
|e author.
|1 https://id.oclc.org/worldcat/entity/E39PBJx4pY9BWRcRggcY7pxMT3
|
| 776 |
0 |
8 |
|i Print version:
|z 3030769070
|z 9783030769079
|w (OCoLC)1247843954
|
| 830 |
|
0 |
|a Undergraduate topics in computer science.
|x 2197-1781
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-3-030-76908-6
|y Click for online access
|
| 903 |
|
|
|a SPRING-COMP2021
|
| 994 |
|
|
|a 92
|b HCD
|