Programming Leftovers
-
KDE PIM in July and August - Claudio Cambra
KDE PIM is the set of applications that helps you manage your email, contacts, appointments, tasks and more.
Since our last report covering KDE PIM in May and June, the PIM applications and libraries have seen over 1200 changes from almost 30 contributors. Let’s go over some of the biggest updates.
-
Andrea Scarpino's blog: Sniffing Android apps network traffic
Back in the days, it was really easy to sniff the network traffic made by the Apps in Android. You could do it in a few minutes by adding mitmproxy’s certificate and setting the HTTP proxy on your wifi network settings. That was it. But things have changed (for good) and that’s no longer the case. However, I still want to sniff the network traffic made by the Apps in Android.
-
Status update, September 2022
I have COVID-19 and I am halfway through my stockpile of tissues, so I’m gonna keep this status update brief.
In Hare news, I finally put the last pieces into place to make cross compiling as easy as possible. Nothing else particularly world-shattering going on here. I have a bunch of new stuff in my patch queue to review once I’m feeling better, however, including bigint stuff — a big step towards TLS support. Unrelatedly, TLS support seems to be progressing upstream in qbe. (See what I did there?)
powerctl is a small new project I wrote to configure power management states on Linux. I’m pretty pleased with how it turned out. It makes for a good case study on Hare for systems programming.
-
rec-def: Dominators case study – Blog – Joachim Breitner's Homepage
He said “it’s ICFP and I wanted to say the dominance relation has a beautiful set of equations … you can read all these algorithms how to compute this, but the concept is simple”.
This made me wonder: If the concept is simple and this formula is beautiful – shouldn’t this be sufficient for the Haskell programmer to obtain the dominator relation, without reading all those algorithms?
Before we start, we have to clarify the formula a bit: If a node is an entry node (no predecessors) then the big intersection is over the empty set, and that is not a well-defined concept. For these nodes, we need that big intersection to return the empty set, as entry nodes are not dominated by any other node. (Let’s assume that the entry nodes are exactly those with no predecessors.)