Andreas Lööw
Lecturer at Royal Holloway, University of London
London, England, United Kingdom
Summary
🤩
Rockstar🎓
Top SchoolAndreas Lööw is a Lecturer and experienced researcher-engineer with 11 years in software and formal methods, currently based in London and previously a postdoc at Imperial College. He blends practical backend development with deep formal verification expertise, contributing to notable projects like CakeML and the HOL4 theorem prover where he worked on compiler proofs, theorem generalization, and build/documentation improvements. His industry work includes formal verification of railway interlocking systems and tooling for CAD data extraction, showing an ability to move between safety-critical engineering and pragmatic automation. Comfortable in languages from Python and C# to OCaml, Andreas has a track record of improving build processes, lexer/parser tooling, and abstract-syntax generation in open-source repos. He holds a PhD in Computer Science from Chalmers and brings both academic rigor and hands-on maintenance mindset to research software. An understated strength is his focus on reproducible builds and documentation hygiene, which often unlocks long-term project maintainability.
11 years of coding experience
7 years of employment as a software developer
University of GothenburgDoctor of Philosophy, Computer Science, Doctor of Philosophy, Computer Science at Chalmers tekniska högskolaMaster of Science in Computer Science and Engineering, Computer Science, Master of Science in Computer Science and Engineering, Computer Science at Linköping UniversityStockholm University
Swedish, English
Github Skills (22)
hol10
lambda-calculus10
programming-language10
bnf10
sml10
formal-semantics10
compiler-design10
formal-verification10
theorem-proving10
haskell10
abstract-syntax-tree9
parser-generator9
latex9
compiler-compiler9
documentation9
Programming languages (13)
Github contributions (5)
CakeML/cakeml
Oct 2016 - Jul 2019
CakeML: A Verified Implementation of ML
Role in this project:
Back-end Developer & Theorem Prover
Back-end Developer & Theorem ProverContributions:48 commits, 1 PR, 33 pushes in 2 years 9 months
Contributions summary:Andreas primarily contributed to the formal verification of the CakeML compiler. Their commits involve moving and generalizing theorems related to the wordLang and wordSem theories. The user made optimizations related to constant folding and propagation within the wordLang. Further contributions include adding proofs for If cases, and removing pair_option as well as modifications to accommodate Ag32 ISA changes, with a focus on compiler backend and proofs.
machine-learningprogramming-languageformal-verificationformal-semanticscompiler
HOL-Theorem-Prover/HOL
Nov 2016 - Jun 2020
Canonical sources for HOL4 theorem-proving system. Branch develop is where “mainline development” occurs; when develop passes our regression tests, master is merged forward to catch up.
Role in this project:Back-end Developer & Technical Writer
Back-end Developer & Technical WriterContributions:41 commits, 28 PRs, 47 comments in 3 years 7 months
Contributions summary:Andreas primarily contributes to the HOL4 theorem prover by implementing new functionality and fixing existing issues. Their work includes adding filtering capabilities, integrating with the dependency rewriting system, and correcting documentation formatting. They also address build and documentation issues, such as correcting rendering of ligatures and ensuring consistent capitalization in documentation.
theorem-provinglambda-calculushigher-order-logic
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.