Muutke küpsiste eelistusi

E-raamat: Haskell Quick Syntax Reference: A Pocket Guide to the Language, APIs, and Library

,
  • Formaat: PDF+DRM
  • Ilmumisaeg: 10-Jun-2019
  • Kirjastus: APress
  • Keel: eng
  • ISBN-13: 9781484245071
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.
Haskell Quick Syntax Reference: A Pocket Guide to the Language, APIs, and LibrarySuurem pilt
  • Formaat: PDF+DRM
  • Ilmumisaeg: 10-Jun-2019
  • Kirjastus: APress
  • Keel: eng
  • ISBN-13: 9781484245071
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. 

This condensed code and syntax reference presents the essential Haskell syntax in a well-organized format that can be used as a quick and handy reference, including applications to cloud computing and data analysis. This book covers the functional programming features of Haskell as well as strong static typing, lazy evaluation, extensive parallelism, and concurrency 

You won’t find any technical jargon, bloated samples, drawn out history lessons, or witty stories in this book. What you will find is a language reference that is concise, to the point and highly accessible. The Haskell Quick Syntax Reference is packed with useful information and is a must-have for any Haskell programmer working in big data, data science, and cloud computing.

What You Will Learn
  • Quickly and effectively use the Haskell programming language
  • Take advantage of strong static typing
  • Work with lazy evaluations 
  • Harness concurrency and extensive parallelism using Haskell

Who This Book Is For

Experienced programmers who may be new to Haskell or have experience with Haskell and who just want a quick reference guide on it.

About the Authors xi
About the Technical Reviewer xiii
Introduction xv
Chapter 1 Functional Programming
1(4)
The Advantages of Functional Programming
1(1)
Functional Programming vs. Object-Oriented Programming
2(1)
Summary
3(2)
Chapter 2 Static Typing
5(8)
Currying and Uncurrying
6(2)
Scoping Variables
8(2)
Types
10(1)
Summary
11(1)
References
12(1)
Chapter 3 GHC
13(6)
Introducing GHC
13(3)
Examples
16(2)
Summary
18(1)
References
18(1)
Chapter 4 Types
19(10)
Basic Types in Haskell
19(3)
Defining Your Own Types
22(4)
Synonyms
24(1)
Structures and Enumerations
24(1)
Records
25(1)
Type System
26(1)
Summary
27(1)
References
28(1)
Chapter 5 Tuples
29(4)
Writing Tuples
29(1)
Predefined Functions for Pairs
30(2)
Summary
32(1)
References
32(1)
Chapter 6 Lists
33(8)
Basic Functions on Lists
33(4)
Other Functions
37(3)
Summary
40(1)
References
40(1)
Chapter 7 Functions
41(12)
Haskell Files
41(3)
Pattern Matching
44(1)
Case Expressions
45(1)
Guards
46(1)
Clauses
47(2)
Lambda Expressions
49(1)
Infix Functions
49(1)
Higher-Order Functions
50(1)
Summary
51(1)
References
51(2)
Chapter 8 Recursion
53(10)
Handling for and while Loops from Imperative Languages
55(1)
Recursion on Lists
56(3)
Pattern Matching and Recursion
59(1)
Summary
60(1)
References
60(3)
Chapter 9 List Comprehension
63(8)
Introduction
63(3)
Other Functions on Lists
66(2)
Summary
68(1)
References
69(2)
Chapter 10 Classes
71(12)
Standard Classes
71(5)
The Eq Class
72(1)
Inheritance
73(3)
Creating Your Own Type Class
76(3)
Advanced Type Classes
77(2)
Maybe, Just, and Nothing
79(1)
Functor
79(1)
Summary
80(1)
References
81(2)
Chapter 11 Pattern Matching
83(6)
Pattern Matching and Constructors
85(1)
Uses of Pattern Matching
86(1)
Summary
87(1)
References
88(1)
Chapter 12 Monads
89(14)
Introduction
89(2)
The Three Rules
91(3)
The Right Unit
91(1)
The Left Unit
92(1)
Associativity
93(1)
An Example
94(7)
Useful Combinators
101(1)
Summary
101(1)
References
102(1)
Chapter 13 Monad Transformers
103(8)
Simple Transformers
103(1)
MaybeT Transformer
104(3)
Building a Simple Monad Transformer Stack
107(2)
Summary
109(1)
References
109(2)
Chapter 14 Parsec
111(4)
Summary
113(1)
References
113(2)
Chapter 15 Folds
115(4)
Summary
117(1)
Reference
118(1)
Chapter 16 Algorithms
119(6)
Quicksort
119(5)
Mergesort
121(2)
Bubble sort
123(1)
Summary
124(1)
Reference
124(1)
Chapter 17 Parsing
125(6)
Summary
129(1)
References
130(1)
Chapter 18 Parallelism and Concurrency
131(6)
Parallelism
132(2)
Concurrency
134(1)
Summary
134(1)
References
134(3)
Chapter 19 Haskell Pipes
137(8)
Summary
144(1)
References
144(1)
Chapter 20 Lens
145(8)
Summary
150(1)
References
151(2)
Chapter 21 Lazy Evaluation
153(6)
Summary
157(1)
References
157(2)
Chapter 22 Performance
159(6)
Type Signatures
159(1)
Optimization Flags
159(1)
Profiling
160(2)
The weigh Library
162(1)
Other Techniques
163(1)
References
163(2)
Chapter 23 Haskell Stack
165(8)
Summary
170(1)
References
171(2)
Chapter 24 Yesod
173(16)
Installing and Configuring Yesod
174(11)
Using Yesod in a Practical Example
185(2)
Summary
187(1)
References
187(2)
Chapter 25 Haskell Libraries
189(6)
Prelude
189(1)
Haskell 2010 Libraries
190(1)
GHC Bootstrap Libraries
191(1)
Core Libraries and Haskell Platform Libraries
191(1)
The Hackage Database
192(1)
Summary
192(1)
References
193(2)
Chapter 26 Cabal
195(8)
Summary
200(1)
References
201(2)
Index 203
Stefania Loredana Nita holds two B.Sc., one in mathematics (2013) and one in computer science (2016) from the University of Bucharest, Faculty of Mathematics and Computer Science; she received her M.Sc. in software engineering (2016) from the University of Bucharest, faculty of Mathematics and Computer Science. She has worked as developer for an insurance company (Gothaer Insurance), and as a teacher of mathematics and computer science in private centers of education. Currently, she is a Ph.D. student in computer science in the Faculty of Mathematics and Computer Science at the University of Bucharest. Also, she is a teaching assistant at the same university and since 2015 has worked as a researcher and developer at the Institute for Computers, Bucharest, Romania. Her domains of interest are cryptography applied in cloud computing and big data, parallel computing and distributed systems, and software engineering. Marius Mihailescu received his B.Sc. in science and information technology (2008) and B.Eng. in computer engineering (2009) from the University of Southern Denmark; he holds two M.Sc., one in software engineering (2010) from the University of Bucharest and the second one in information security technology (2011) from the Military Technical Academy. His Ph.D. is in computer science (2015) from the University of Bucharest, Romania with a thesis on security of biometrics authentication protocols.  From 2005 to 2011 he worked as a software developer and researcher for different well-known companies (Softwin, NetBridge Investments, Declic) from Bucharest, Romania (software and web development, business analysis, parallel computing, cryptography researching, distributed systems). Starting in 2012 until 2015 he has been an assistant in the informatics department, University of Titu Maiorescu and computer science department, University of Bucharest. Since 2015, he is a lecturer at the University of South-East Lumina.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97814842450712e.html
Märksõnad: