learn-you-a-haskell VS algebra-driven-design

The LYAH is by far my favorite book for beginners, however, it lacks exercises for you to practice, but you can still move along typing and playing with the examples shown, and it’s free to read online. It’s outdated but most of the code may still be valid with little to no changes.

Learn You a Haskell For Great Good! is also a really good resource:

https://learnyouahaskell.com/

If you've never done functional, Learn You Some Erlang For Great Good was a very fun read, and I'll always love Learn You a Haskell for Great Good for showing me everything imperative languages kinda gloss over magically, as well as why I should never take a job working in Haskell!

you start that way, but don't do http://learnyouahaskell.com really?

Learn You a Haskell for Great Good!

I enjoyed http://learnyouahaskell.com/ which is available in print and digital. Fun and lighthearted while still teaching reasonable depth. YMMV.

Elm is a statically typed language inspired by Haskell. The natural step would be to use Elm on the frontend and Haskell on the backend. And that's what I tried to do. I read with some difficulty the Learn You a Haskell for Great Good! book (available for free here) and learned a lot of cool stuff. But creating a complete backend using Haskell proved to be more than I could chew. So I decided to look for alternatives...

Here y’go!

You might want to read on Algebra-Driven Design and Data Oriented Design. If you are greedy, both books were pirated.

I would like to do this more. At the moment I don't do formal verification. However, I often borrow methodology from the excellent book Algebra-Driven Design (text available on GitHub but support the author if you find it useful!) when designing systems. This means I define algebraic data types to describe the program and the laws that relate the different types, and use that to guide implementation in a language that doesn't support ADTs.

Their approach might be to express their business logic as a carefully selected collection of types and laws, as described in Algebra-Driven Design (the full text is available on GitHub, please support the author if you find it useful though). I recommend this book to everyone because, even if you don't use this approach to design your programs, it's an excellent way to think about problems and better understand the problem space.

If you have an interest in computer science, category theory is very useful there. Here's a good book on the topic (Algebra-Driven Design, by Sandy Maguire).

This reminds me of QuickSpec (different from QuickCheck) in Haskell. It takes Haskell code and finds the Mathematical laws that the code supports. It does this using a sort of smart random search. I learned about this as part of the Algebra Driven Design book.

Sorry probably worth pointing out that I'm not referring to an Algebra in the pure math sense. I'm more referring to specifying algebraic laws that an API would have to satisfy as talked about in this book https://leanpub.com/algebra-driven-design.