Explore >> Select a destination
|
You are here 
|
julesh.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. | |
| | | | |
diego.codes
|
|
| | | | | Data Scientist. I like music, keyboards and Legos. Proficient in pop culture references and xkcd. | |
| | | | |
hookrace.net
|
|
| | | | | ||
| | | | |
sitr.us
|
|
| | | Dependent types provide an unprecedented level of type safety. A quick example is a type-safe printf implementation. They are also useful for theorem proving. According to the Curry-Howard correspondence, mathematical propositions can be represented in a program as types. An implementation that satisfies a given type serves as a proof of the corresponding proposition. In other words, inhabited types represent true propositions. | ||
