001441743 000__ 05330cam\a2200565Ii\4500
001441743 001__ 1441743
001441743 003__ OCoLC
001441743 005__ 20230309003341.0
001441743 006__ m\\\\\o\\d\\\\\\\\
001441743 007__ cr\un\nnnunnun
001441743 008__ 220125s2021\\\\sz\a\\\\o\\\\\001\0\eng\d
001441743 019__ $$a1293258208$$a1293480341$$a1293652439$$a1293775452$$a1293847471
001441743 020__ $$a9783030769086$$q(electronic bk.)
001441743 020__ $$a3030769089$$q(electronic bk.)
001441743 020__ $$z9783030769079
001441743 020__ $$z3030769070
001441743 0247_ $$a10.1007/978-3-030-76908-6$$2doi
001441743 035__ $$aSP(OCoLC)1293296397
001441743 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCO$$dOCLCF$$dOCLCQ
001441743 049__ $$aISEA
001441743 050_4 $$aQA76.9.M35$$bS36 2021
001441743 08204 $$a004.01/51$$223
001441743 1001_ $$aSannella, D.$$q(Donald),$$d1956-$$eauthor.
001441743 24510 $$aIntroduction to computation :$$bHaskell, logic and automata /$$cDonald Sannella, Michael Fourman, Haoran Peng, Philip Wadler.
001441743 264_1 $$aCham :$$bSpringer,$$c[2021]
001441743 264_4 $$c©2021
001441743 300__ $$a1 online resource :$$billustrations (some color).
001441743 336__ $$atext$$btxt$$2rdacontent
001441743 337__ $$acomputer$$bc$$2rdamedia
001441743 338__ $$aonline resource$$bcr$$2rdacarrier
001441743 4901_ $$aUndergraduate topics in computer science,$$x2197-1781
001441743 500__ $$aIncludes index.
001441743 5050_ $$a1. 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.
001441743 506__ $$aAccess limited to authorized users.
001441743 520__ $$aComputation 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.
001441743 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 31, 2022).
001441743 650_0 $$aComputer science$$xMathematics.
001441743 650_6 $$aInformatique$$xMathématiques.
001441743 655_0 $$aElectronic books.
001441743 7001_ $$aFourman, Michael,$$eauthor.
001441743 7001_ $$aPeng, Haoran,$$eauthor.
001441743 7001_ $$aWadler, Philip,$$d1956-$$eauthor.
001441743 77608 $$iPrint version: $$z3030769070$$z9783030769079$$w(OCoLC)1247843954
001441743 830_0 $$aUndergraduate topics in computer science.$$x2197-1781
001441743 852__ $$bebk
001441743 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-76908-6$$zOnline Access$$91397441.1
001441743 909CO $$ooai:library.usi.edu:1441743$$pGLOBAL_SET
001441743 980__ $$aBIB
001441743 980__ $$aEBOOK
001441743 982__ $$aEbook
001441743 983__ $$aOnline
001441743 994__ $$a92$$bISE