
AI compiler engineer at Huawei Hong Kong Research Center, and a PhD in programming languages from the University of Hong Kong. I build the stacks that take tile-level kernels through MLIR onto Huawei Ascend NPUs, and I work on the type systems that make language designs hold together.
GitHub · LinkedIn · baberrehman26@gmail.com · CV
Work
AI Compiler Engineer, Huawei Hong Kong Research Center (Nov 2023–present)
I work on TileLang-Ascend, Triton-Ascend, AscendNPU-IR, and Triton-distributed-ascend: the stacks that take tile-level kernels through MLIR and lower them onto the NPU.
On TileLang-Ascend I work on the AscendNPU-IR path in the open compiler: MLIR dialects and verifiers, JIT compilation, Ascend A5 operator lowering, and the tests and CI for that pipeline. On Triton-Ascend I work on the Ascend compiler backend, including static checks on kernel scope. Triton-distributed-ascend extends the same stack to distributed kernels. Related public work is a Lean model of Triton and the Triton-Ascend core, and a Lean core for Triton-Distributed.
Earlier at the same center, I created a P4-inspired DSL for programmable networking: a high-level way to describe packet-processing logic that compiles to data-plane code.
Software Engineer (DevOps), Team Lead, CloudPlex, Lahore (Jun 2015–Aug 2018). Led a team in Lahore and a remote team in Argentina. Built a cloud platform for orchestration and deployment on AWS and Azure, and automated PfSense and Fortinet configuration.
Intern, Mentor Graphics, Lahore (Jul–Sep 2014). Debugged Sourcery CodeBench and fixed GUI bugs in Java and SWT.
Research
PhD in Computer Science, University of Hong Kong (2018–2023), supervised by Bruno C. d. S. Oliveira. The dissertation is on intersection types and union types: how to combine them, when they stay disjoint, and how to keep the resulting languages type-sound.
Before that, a BS in Computer Science from PUCIT, University of the Punjab (2011–2015).
Selected publications
- Disjoint Polymorphism with Intersection and Union Types. Baber Rehman and Bruno C. d. S. Oliveira. FTfJP 2024.
- A Blend of Intersection Types and Union Types. Baber Rehman. PhD dissertation, 2023.
- Correctness-by-Construction meets Refinement Types. Baber Rehman. FTfJP 2023.
- Union Types with Disjoint Switches. Baber Rehman, Xuejing Huang, Ningning Xie, and Bruno C. d. S. Oliveira. ECOOP 2022.
- The Duality of Subtyping. Bruno C. d. S. Oliveira, Shaobo Cui, and Baber Rehman. ECOOP 2020.
Also
- Formal Specifications for Data Plane Programs. Keyu Yuan and Baber Rehman. FMANO 2025. In submission.
- Determinism with Intersection and Union Types. Baber Rehman and Bruno C. d. S. Oliveira. ECOOP/ISSTA student research competition, 2023. Poster.
- Type Soundness with Unrestricted Merges. Baber Rehman and Bruno C. d. S. Oliveira. Journal of Functional Programming. In submission.
Artifacts
- Union Types with Disjoint Switches. ECOOP 2022.
- The Duality of Subtyping. ECOOP 2020.
Service
Program committees and artifact evaluation, newest first.
- ECOOP 2022–2026. Program committee 2026. Artifact evaluation 2022–2025. Extended review 2022–2024.
- OOPSLA 2025–2026. Program committee 2025. Artifact evaluation 2026.
- POPL 2023, 2024, 2026. Artifact evaluation.
- PLDI 2024–2025. Artifact evaluation.
- ISSTA 2024. Artifact evaluation.
- ATC 2023. Artifact evaluation.
- OSDI 2023. Artifact evaluation.
- APLAS 2022. Artifact evaluation.
Teaching
Teaching assistant for Functional Programming and Principles of Programming Languages at the University of Hong Kong. Visiting lecturer and teaching assistant at the University of the Punjab. Resident tutor at New College, HKU, from 2019 to 2023.
Contact
Baber Rehman
baberrehman26@gmail.com
github.com/baberrehman