Explore >> Select a destination
|
You are here 
|
mmhaskell.com | ||
| | | | |
kndrck.co
|
|
| | | | | Prelude State monads, introduced to me during the data61 functional programming course was one of my most memorable encounter with a monad. This was mainly because things only started to clicked and made a tiny bit of sense after a couple of weeks of frustration. This article is my attempt to explain the underlying mechanics of the State Monad to try and relief the frustration of whomever who was in my position. | |
| | | | |
blog.cofree.coffee
|
|
| | | | | [AI summary] The blog post introduces Monad Transformers in functional programming, explaining their purpose, implementation, and applications in combining monadic effects. | |
| | | | |
pbrisbin.com
|
|
| | | | | In Haskell, functions must always return the same consistent type. There is also no concept of nil or null built into the language. This is not meant to handicap you, and the expressiveness and polymorphic-ness of Haskell's types mean it certainly does not. One way to handle such situations where functions (conceptually) may or may not return a value is through the Maybe type. data Maybe a = Just a | Nothing Maybe is a perfect and simple solution for this situation. | |
| | | | |
johnazariah.github.io
|
|
| | | A post about how the foundations of functional programming have neat effects on real-life programming | ||
