Stefania Loredana Nita, Marius Mihailescu

Haskell Quick Syntax Reference

A Pocket Guide to the Language, APIs, and Library

Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Verlag: Springer, Berlin; Apress
• Artikelnr. des Verlages: 978-1-4842-4506-4
• 1st ed.
• Erscheinungstermin: 11. Juni 2019
• Englisch
• Abmessung: 233mm x 156mm x 17mm
• Gewicht: 353g
• ISBN-13: 9781484245064
• ISBN-10: 1484245067
• Artikelnr.: 55071386

Autorenporträt

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.

Inhaltsangabe

1. Functional Programming 2. Static Typing 3. GHC 4. Monads 5. Types 6. Lists 7. Cabal 8. Yesod 9. Types 10. Classes 11. Recursion 12. GHCI 13. Haskell Stack 14. I/O and Haskell Pipes 15. Parsing 16. Lazy Evaluation 17. Pattern Matching 18. Functions 19. Parsecs 20. Monad Transformers 21. Performance 22. Strings 23. List Comprehension 24. Folds 25. Tuples 26. Algorithms 27. Lens 28. Parallelism 29. Haskell Libraries 1. Functional Programming 2. Static Typing 3. GHC 4. Types 5. Tuples 6. Lists 7. Functions 8. Recursion 9. List Comprehension 10. Classes 11. Pattern Matching 12. Monads 13. Monads Transformers 14. Parsecs 15. Folds 16. Algorithms 17. Parsings 18. Parallelism 19. Haskell Pipes 20. Lens 21. Lazy Evaluation 22. Performance 23. Haskell Stack 24. Yesod 25. Haskell Libraries 26. Cabal