Software engineering, compilers, languages
Creating a Glean index for React See part 1 (creating a working aarch64 env on Mac) and part 2 (building Glean for ARM). In the last post we got a working Glean installation built on aarch64 with native emulation on the ARM-based M1 MacBook Air. To be useful, we need to index some code and Continue reading Glean on aarch64 on Apple Silicon : part 3
See: Part 1: get an aarch64/Linux VM running in UTM on the M1 I want to develop and use Glean on ARM as I have a MacBook Air (road warrior mode) and I’m interested in making Glean more useful for local developer IDE backends. (c.f What is Glean?) To build Glean just read the fine Continue reading Glean on aarch64 on Apple Silicon : part 2
Get a working aarch64 box This post show how to get a working aarch64 env on the MacBook Air (M1) for Haskell. I’m working on the road at the moment, so picked up a MacBook Air with the M1 chip, to travel light. I wanted to use it as a development environment for Glean (c.f. Continue reading Glean on aarch64 on Apple Silicon : part 1
I recently gave an interview to Jasper Van der Jeugt as part of the Haskell Zurich Meetup, on the history of hackathons in the Haskell community, and how we intentionally tried to boostrap and grow an open source tooling and infra team for Haskell, via hackathons, in the 2005-2010 period. Prior to the launch of Continue reading Bootstrapping a community via hackathons
I ve been learning Rust for the past twenty days or so, working through the Blandy Orendorff book, coding up things as I go. Once I got into playing with Rust traits and closures and associated types, the similarities to programming in Haskell with typeclasses, data structures, closure passing and associated types was pretty obvious. Continue reading Back to old tricks .. (or, baby steps in Rust)
For the past 3 years I ve been managing the Testing + Verification org at Facebook London, a group of teams that build bug finding tools, focusing on test infrastructure, dynamic analysis, automated test generation, type systems and static analysis. Now, I m switching track to a software engineering role at Facebook, in the same organization. I m Continue reading Writing code again
I m excited to announce I will be joining Facebook next month as part of the Infer team in London. Using FP and static analysis to find bugs across the Facebook estate.
SMT solvers are automated tools to solve the Satisfiability Modulo Theories problem that is, determining whether a given logical formula can be satisfied. However, unlike SAT solvers, SMT solvers generalize to solving such NP-complete problems that contain not just boolean variables, but more useful types, such as lists, tuples, arrays, integers and reals. And Continue reading Painless NP-complete…
I saw Inception a few months ago. At the time I was struck by how coherent the computational environment describe in the movie was. I suspect Inception forms a monadic environment for computation (though not necessarily a useful one), and have been meaning to try to implement it. However, time is short, so here are Continue reading Control.Monad.Inception
The Haskell Implementors Workshop was held in Baltimore, Oct 1, 2010. Duncan Coutts from Well-Typed and I presented a status report on the Haskell distribution infrastructure: The Haskell Platform Hackage Cabal You can read the slides as PDF here, or online: The amount of freely available Haskell code has grown exponentially in the past two Continue reading Hackage, Cabal and the Haskell Platform:…