/explore
|
You are here 
|
kupac.gitlab.io | ||
| | | | |
markkarpov.com
[AI summary] A technical blog post arguing against the use of Free Monads in Haskell programming due to issues with inspection, efficiency, and composability, proposing Type Classes and Final Tagless Encoding as superior alternatives. |
|
| | | | | ||
| | | | |
hookrace.net
|
|
| | | | | ||
| | | | |
lambdaland.org
This is the story of how I solved a problem (ugly, cumbersome boilerplate code) that I ran into while writing a program in a functional language (Elixir). Functional programming languages often pride themselves on expressiveness and elegance; but occasionally they are not amenable to the most obvious solutions to the problems we wish to solve. In this case, the simplest solution to my problem would have been to have a global mutable variable. But no one likes those. |
|
| | | | | ||
| | | | |
almostsuremath.com
The aim of this post is to motivate the idea of representing probability spaces as states on a commutative algebra. We will consider how this abstract construction relates directly to classical probabilities. In the standard axiomatization of probability theory, due to Kolmogorov, the central construct is a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$. This consists... |
|
| | | |||
