Explore >> Select a destination
|
You are here 
|
gilmi.me | ||
| | | | |
blog.drewolson.org
|
|
| | | | | I've spent the past several years working with functional programming languages in my free time - primarily Haskell and OCaml. I love both languages but also find aspects of each frustrating. Haskell is terse and elegant with type classes providing a powerful mechanism for ad-hoc polymorphism. However, it can also be confusingly implicit and I personally find lazy evaluation to have more downsides than upsides. OCaml is explicit and powerful with a best-in-class module system. However, I believe it is often exhaustingly explicit, especially when dealing with custom data types in generic containers. | |
| | | | |
journal.infinitenegativeutility.com
|
|
| | | | | I want to say a few words on how I write Haskell as of 2017. Before I go on, I want to make very clear: this is neither a style recommen... | |
| | | | |
blog.drewolson.org
|
|
| | | | | So you've learned some basic Haskell and you're feeling really good about yourself. You sit down the write some code and you're presented with a deeply nested JSON structure: { "foo": "Hello", "bar": 1, "baz": "More stuff", "people": [ { "name": "Drew", "hobbies": [ { "name": "bridge" }, { "name": "haskell" } ] }, { "name": "Jane", "hobbies": [ { "name": "chess" }, { "name": "ocaml" } ] } ] } Your goal is to simply find the name of Drew's first hobby. LET'S WRITE SOME TYPES! | |
| | | | |
text.marvinborner.de
|
|
| | | This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus). | ||
