Home
I’m Heili. I can run down stairs really fast.
Click here for more info about me.
Preprints
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
Philipp G. Haselwarter, Kwing Hei Li, Alejandro Aguirre, Simon Oddershede Gregersen, Joseph Tassarotti, Lars Birkedal
Submitted, 2024
(Arxiv)
Publications
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
Phillipp G. Haselwarter, Kwing Hei Li, Markus de Medeiros, Simon O. Gregersen, Alejandro Aguirre, Joseph Tassarotti, Lars Birkedal
Conference on Object-Oriented Programming, Systems, Languages, and Applications 2024
(PDF)
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
Alejandro Aguirre, Philipp G. Haselwarter, Markus de Medeiros, Kwing Hei Li, Simon Oddershede Gregersen, Joseph Tassarotti, Lars Birkedal
International Conference on Functional Programming 2024
(PDF)
Distinguished Paper Award
Secure Aggregation for Federated Learning in Flower
Kwing Hei Li, Pedro Porto Buarque de Gusmão, Daniel J. Beutel, Nicholas D. Lane
International Workshop on Distributed Machine Learning 2021
(PDF)
Unpublished Notes
The Fundamental Theorem of Asynchronous Distributed Models in Intuitionistic Logic
Kwing Hei Li
2023
(PDF)
Wait-Free Task Solvability of Asynchronous Distributed Models
Kwing Hei Li
Masters thesis, 2023
(PDF)
Formalizing May’s Theorem
Kwing Hei Li
2022
(PDF)
Type Systems for Functional Reactive Programming
Kwing Hei Li
Bachelor thesis, 2022
(PDF)
Talks
Higher-Order Separation Logic for Probabilistic Programs
Kwing Hei Li
CS Research Evaluation 2024
(Slides)
How to Deal with Rejections - Separation Logics for Probability
Kwing Hei Li
LogSem Seminar 2024
(Slides)
The Asynchronous Computability Theorem - A Marriage Between Distributed Systems and Algebraic Topology
Kwing Hei Li
Churchill CompSci Talks 2022
(Slides, Recording)
Understanding the Source Coding Theorem - A Talk on Shannon’s Entropy
Kwing Hei Li
Churchill CompSci Talks 2021
(Slides)
Audience Favourite Talk Prize