Explore >> Select a destination
|
You are here 
|
mmhaskell.com | ||
| | | | |
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. | |
| | | | |
blog.cofree.coffee
|
|
| | | | | [AI summary] The blog post introduces Monad Transformers in functional programming, explaining their purpose, implementation, and applications in combining monadic effects. | |
| | | | |
dennybritz.com
|
|
| | | | | The final code is on Github. | |
| | | | |
codewithstyle.info
|
|
| | | With this post, I would like to start a short series about monads. If you are familiar with some functional programming techniques in JavaScript (such | ||
