Creează un cont pentru a te abona la acest blog și a-i urmări articolele pe pagina Lectură.
-
Write commit messages before coding.
-
You want to invent a new language, and you want to do this in F#, don’t you?
-
I’m addicted to consult.el.
-
I promised myself to write a Tree-sitter major mode for F#.
-
How an innocuous Kata shows that either emergent design does not exist, or that a better way of doing TDD is possible.
-
Summaries From Matteo Vaccari: There’s no easy way to evolve the hardcoded values into general code.
-
Let’s develop squint a little package for controlling the font height, so you won’t need to squint your eyes when you are on smaller screens.
-
Ever wondered why parametric tests in xUnit are called “theories”?
-
Index Source code: github.com/arialdomartini/state-monad-for-the-rest-of-us In chapter 7, when we wanted to introduce a new type for the result value of index we got to this: // Tree a -> (Int -> (Tree (a, Int), Int)) let rec index = function | Le…
-
Index Source code: github.com/arialdomartini/state-monad-for-the-rest-of-us Binary Trees Our journey starts with this problem: we want to count the number of leaves of an arbitrary Binary Tree.