| 000 -LEADER |
|---|
| fixed length control field |
a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
220224b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783030769079 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.3 |
| Item number |
SAN |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Sannella, Donald |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Introduction to computation : Haskell, logic and automata |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
Springer, |
| Date of publication, distribution, etc |
2021 |
| Place of publication, distribution, etc |
Cham : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvi, 366 p. ; |
| Other physical details |
ill., |
| Dimensions |
29 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
34.99 |
| Price type code |
EUR |
| Unit of pricing |
88.10 |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Undergraduate topics in computer science, |
| Volume number/sequential designation |
2197-1781 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science, Mathematics |
|
|---|
| Topical term or geographic name as entry element |
Finite Automata |
|
|---|
| Topical term or geographic name as entry element |
Functional Programming |
|
|---|
| Topical term or geographic name as entry element |
Haskell, Programming Language |
|
|---|
| Topical term or geographic name as entry element |
Arden's Rule |
|
|---|
| Topical term or geographic name as entry element |
Boolean algebra |
|
|---|
| Topical term or geographic name as entry element |
CNF |
|
|---|
| Topical term or geographic name as entry element |
De Morgan's laws |
|
|---|
| Topical term or geographic name as entry element |
DFA |
|
|---|
| Topical term or geographic name as entry element |
e-transition |
|
|---|
| Topical term or geographic name as entry element |
Finite automation |
|
|---|
| Topical term or geographic name as entry element |
Karnaugh map |
|
|---|
| Topical term or geographic name as entry element |
NP-complete |
|
|---|
| Topical term or geographic name as entry element |
Prelude |
|
|---|
| Topical term or geographic name as entry element |
Pumping lemma |
|
|---|
| Topical term or geographic name as entry element |
Whoosh-style- programming |
|
|---|
| Topical term or geographic name as entry element |
Symbolic logic |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Fourman, Michael |
|
|---|
| Personal name |
Peng, Haoran |
|
|---|
| Personal name |
Wadler, Philip |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |