000			04919nam a22004335i 4500
999			_c368184 _d368184 _x1
001			368184
003			ES-MaUEC
005			20230102121715.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220119s2021 sz | s |||| 0|eng d
020			_a9783030769086
024	7		_a10.1007/978-3-030-76908-6 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .M35 _b2021 EB
100	1		_aSannella, Donald _eautor
245	1	0	_aIntroduction to Computation : _bHaskell, Logic and Automata _cby Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (XVI, 366 páginas) _b283 ilustraciones, 13 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aUndergraduate Topics in Computer Science _x2197-1781
505	0		_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.
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.
988			_aSpringer_Computer_2022
650		7	_2embne _aMatemáticas discretas _9160233
700	1		_aFourman, Michael _eautor
700	1		_aPeng, Haoran _eautor
700	1		_aWadler, Philip _eautor
773	0		_tSpringer Nature eBook
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-76908-6 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE _n0
998			_b03/2022 _dz _eu _zSI