Explore >> Select a destination
|
You are here 
|
typesanitizer.com | ||
| | | | |
journal.infinitenegativeutility.com
|
|
| | | | | For almost a complete decade-starting with discovering Haskell in about 2009 and right up until switching to a job where I used primarily... | |
| | | | |
serokell.io
|
|
| | | | | In this article, we look at three ways to do compile-time evaluation in Haskell: Template Haskell, type families, and functional dependencies. | |
| | | | |
gilmi.me
|
|
| | | | | ?m.me - The bottom of the Haskell Pyramid | |
| | | | |
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. | ||
