I am a Ph.D. candidate at the University of Kent, UK. I started here in 2013. Previously I worked at Associated Compiler Experts in Amsterdam. I was born in Soest, the Netherlands. I speak Dutch, English and Danish.

My main interest is in the area of program analysis and transformation. I research and develop compilers, tracers, debuggers, profilers and virtual machines.

The topic of my current research is making tracing and algorithmic debugging for lazy functional languages such as Haskell practical and easy to use for real-world programs. My goal is to help programmers to understand their code and locate bugs in a systematic manner.

Previously I worked on analysis and transformation of reducible and irreducible loops, interprocedural optimization of recursive functions and out-of-SSA translation.

I have experience developing in LLVM, the CoSy compiler framework, the Glasgow Haskell Compiler, and Haskell debugging aids Hat, Hood and Hoed. I am most at home with the programming languages Haskell, Erlang and C, but I have experience with other languages and am keen to pick up more.

At the University of Kent I teach logic, logic programming, functional programming, concurrent programming and using Unix, at Master's and undergraduate level.

Curriculum Vitæ

Read full C.V.

September 2013 - Present: Ph.D. candidate & teaching assistant, University of Kent
May 2011 - September 2013: Software engineer, ACE Associated Compiler Experts
October 2005 - March 2012: Ice skating instructor
September 2010 - May 2011: Intern software engineer, ACE Associated Compiler Experts
September 2009 - September 2011: Master of Science, Computer Engineering, University of Technology Delft
September 2004 - September 2008: Bachelor of Information and Communication Technology, Hogeschool Utrecht

Publications

Lightweight Computation Tree Tracing for Lazy Functional Languages, Maarten Faddegon and Olaf Chitil, to appear in the proceedings of the ACM SIGPLAN conference on Programming Language Design and Implementation (PLDI) 2016
Algorithmic Debugging of Real-World Haskell Programs: Deriving Dependencies from the Cost Centre Stack, Maarten Faddegon and Olaf Chitil, proceedings of the ACM SIGPLAN conference on Programming Language Design and Implementation (PLDI) 2015
Type Generic Observing, Maarten Faddegon and Olaf Chitil, post-proceedings of Trends in Functional Programming (TFP) 2014
SSA Back-Translation: Faster Results with Edge Splitting and Post Optimization, Maarten Faddegon, Master's Thesis in Computer Engineering, TU Delft, 2011

I also present my work at research conferences, user meetings or when visiting another university:

Practical and Easy Algorithmic Debugging for Lazy Functional Languages, poster presentation for Google's PhD Summit on Compiler & Programming Technology, 7 December, München Germany
Practical Debugging of Haskell Programs with Hoed, London Functional Programmers meetup, 10 November 2015, London UK
Practical and Easy Algorithmic Debugging for Lazy Functional Languages, for the Programming Languages Group of Aarhus University, 4 November 2015, Aarhus Demark
Algorithmic Debugging in Haskell by Observing Values and the Cost Centre Stack, poster presentation for the ACM Student Research Competition held at at the International Conference on Functional Programming (ICFP) 2014, Götenborg Sweden

Software

You can also get the source code for some of my projects.

Hoed — Lightweight algorithmic debugging.
Hoed is a tracer and algorithmic debugger for the programming language Haskell. To locate a defect with Hoed you annotate suspected functions and compile as usual. Then you run your program; information about the annotated functions is collected. Finally you connect to a debugging session using a webbrowser.

Unlike other algorithmic debuggers for Haskell, no specialized run-time environment or whole-program transformation is required.
Libgraph — Store and manipulate data in a graph.
Graphs, analysis of graphs and manipulation of graphs play an important role in the implementation of various research project on tracing Haskell. To make re-use of my work easier this library collects a variety of graph algorithms.
LLVM-TURBO — A bridge between LLVM and CoSy.
As part of the research for my Master's thesis I built an experimental bridge that connected the LLVM C compiler with the CoSy Compiler Framework.

After I was hired as part of ACE's Research and Development team I further productised the bridge and even experimented with connecting a Haskell front-end to my bridge. When I left the company to pursue my Ph.D. studies development continued and at HiPEAC 2014 LLVM-TURBO was presented as a commercial product.

Maarten Faddegon

Curriculum Vitæ

Publications

Software