Muutke küpsiste eelistusi

E-raamat: Introduction to Computation: Haskell, Logic and Automata

, , ,
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 37,04 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Introduction to Computation: Haskell, Logic and AutomataSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

Arvustused

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)

1 Sets 13
2 Types 19
3 Simple Computations 27
4 Venn Diagrams and Logical Connectives 35
5 Lists and Comprehensions 45
6 Features and Predicates 55
7 Testing Your Programs 63
8 Patterns of Reasoning 73
9 More Patterns of Reasoning 81
10 Lists and Recursion 91
11 More Fun with Recursion 101
12 Higher-Order Functions 111
13 Higher and Higher 123
14 Sequent Calculus 131
15 Algebraic Data Types 143
16 Expression Trees 157
17 Karnaugh Maps 175
18 Relations and Quantifiers 183
19 Checking Satisfiability 191
20 Data Representation 203
21 Data Abstraction 221
22 Efficient CNF Conversion 237
23 Counting Satisfying Valuations 249
24 Type Classes 263
25 Search in Trees 275
26 Combinatorial Algorithms 285
27 Finite Automata 299
28 Deterministic Finite Automata 311
29 Non-Deterministic Finite Automata 321
30 Input/Output and Monads 341
31 Regular Expressions 359
32 Non-Regular Languages 369
Index 377
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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830307690862e.html
Märksõnad: