The post explains how to build a data compression program in Haskell using Huffman coding. It covers the concept of Huffman codes, prefix-free codes, creating prefix-free codes, and implementing Huffman codes. It also explains how...
About:
Marcelo Lazaroni is a London-based software developer interested in programming and algorithms, with a focus on Haskell.
Website:
Specializations:
Interests:
Outgoing Links:
Subscribe to RSS:
0A virtual DOM in 200 lines of JavaScript
2024-05-19 •
The post walks through the implementation of a Virtual DOM in a bit over 200 lines of JavaScript, illustrating the fundamental technique behind tools like React, Vue, and the Elm language. It explains the goal of a virtual DOM, th...
0Browse Hackage from the terminal ⚡
2021-09-19 •
The Haskell ecosystem has great facilities for searching and navigating package documentation using the browser. haskell-docs-cli allows you to do that much faster without leaving the terminal. The problem is switching focus from ...
The Nix package manager does not have a native way to search through previous revisions for older versions of a package. The author describes the process that led to the creation of Nix Package Versions, a tool that provides this ...
0Deploying statically-linked Haskell to Lambda
2020-06-24 •
The post discusses the process of deploying statically-linked Haskell programs to Amazon Lambda using Nix, Cachix, and GitHub Actions. It includes information on creating a special wrapping layer to run Haskell code in Lambda, usi...
0Download images from a page
2020-03-15 •
The text provides a snippet that works to download many images from a web page. It also suggests adding a timeout to make things work when the browser doesn't handle downloading many images at once very well.
0Fast parsing of String Sets in Elm
2020-03-10 •
The text discusses the problem of parsing a set of strings in Elm's standard parsing library and the inefficiency of using Parser.oneOf. It explains the issues with the current parser, the need for a more efficient solution, and t...
0Recursion Patterns - Getting rid of stack overflows
2019-03-23 •
The post discusses techniques to achieve unbounded recursion without fear of stack overflow in functional programming languages. It explains tail recursion, accumulating parameter, and multiple recursion calls to make functions ta...
The post discusses the importance of having applications available during updates and explains how to achieve zero downtime using Blue-Green deployment. It provides a detailed explanation of the process and how to use easy-deploy ...
The text discusses the issue of Haskell's laziness causing problems with recursive functions and how to handle it using an accumulating parameter. It presents benchmarks for different implementations and compares their performance...