Blog - Monday Morning Haskell

Welcome to the sixth and final part of our series on MCAP parsing.

In the first 4 parts of this series (Part 1, Part 2, Part 3, Part 4), we’ve written a program that can parse specific topic information out of MCAP-based ROS2 bags.

Welcome to the 4th part of our series on parsing MCAP data from a ROS2 bag in Haskell.

Welcome to part 3 of our series on parsing ROS bags in the MCAP format.

Last week we started learning about ROS2 and the MCAP data format.

For the last 3 weeks, we’ve been learning about parsing in Haskell, particularly using the Megaparsec library.

Welcome to the third and final part of our simple HTTP Server series.

Last week, we discussed the utility of writing simple tools from scratch.

In the last several months, we’ve gone through solutions for a multitude of LeetCode problems in Haskell.

Today will be the final problem we do (for now) comparing Rust and Haskell LeetCode solutions.

In the past two weeks we’ve explored a couple different problems in dynamic programming.

Today we’ll continue the study of Dynamic Programming we started last week.

We’re about to start our final stretch of Haskell/Rust LeetCode comparisons (for now).

Today will be a nice culmination of some of the work we’ve been doing with data structures and algorithms.

In the last few weeks we’ve studied a few different graph problems.

Welcome back to our Rust vs.

For last week’s problem we started learning about graph algorithms, focusing on depth-first-search.

For a few weeks now, we’ve been tackling problems related to data structures, with a sprinkling of algorithmic ideas in there.

In the last few articles, we’ve spent some time doing manual algorithms with binary trees.

In our last article, we explored how to perform an in-order traversal of a binary search tree.