Summary
Emilien Bauer is a PhD student and compiler researcher based in Edinburgh with nine years of software and research experience focused on algebra, code optimization, and tooling for compiler development. He co-developed xDSL to make MLIR exploration and teaching more accessible and has explored shared domain-specific abstractions across DSLs in peer-reviewed work. His current thesis on Structured Tensor Compilation leverages symbolic knowledge of tensor structure to generate more efficient tensor-centric code, bridging theory and practical compiler engineering. Prior roles span polyhedral compilation toolchains, applied research internships, and industry experience as a functional analyst, reflecting a mix of rigorous mathematics and hands-on implementation. Notably, his background includes formal rephrasings of Farkas' lemma for implementation and deriving combinatorial bounds on geometric problems, highlighting a talent for turning deep mathematical insight into implementable compiler techniques.
9 years of coding experience
2 years of employment as a software developer
Baccalauréat, STI2D SIN, Mention Très Bien, Mention Européenne, Baccalauréat, STI2D SIN, Mention Très Bien, Mention Européenne at Lycée Louis Couffignal
Master's degree, Computer Science, Second class honors, Master's degree, Computer Science, Second class honors at University of Strasbourg
CPGE TSI, ENGINEERING, Classement premier tiers, CPGE TSI, ENGINEERING, Classement premier tiers at Lycée Blaise Pascal
English, French