My plan for this week’s lecture of the CIS 194 Haskell course at the University of Pennsylvania is to dwell a bit on the concept of Functor, Applicative and Monad, and to highlight the value of the Applicative abstraction.
This article describes a simple approach to set up a continuous integration and continuous deployment pipeline for a sample Haskell application deploying to AWS Elastic Beanstalk.
The tensorflow-haskell package provides Haskell bindings to TensorFlow, an open source software library for machine intelligence.
Haskell’s laziness enables some pretty cool tricks. The
fixfunction is one of the neater ones, though it can be hard to understand how to use it from just the implementation and type signature. A fixed point of a function is some value where applying the function to the value returns the same value.
A keynote talk at MuniHac 2016 given by Gabriel Gonzalez. This talk covers an analytics trick that commonly arises in distributed/parallel programming. Haskell permits an elegant, efficient, and general implementation of this trick which also has useful applications outside of high-performance computing.
I recently solved a problem (using Haskell) that ended up being tougher than I thought, but I learned a lot along the way. Rather than just presenting a solution, I’d like to take you through my thought process, crazy detours and all.
Did you like this issue? Let us know on Twitter! Think it could be better? Send us an email or open an issue. Thanks for reading!