HO Weng Kin received his Ph.D. in Computer Science from The University of Birmingham (UK) in 2006. His doctoral thesis proposed an operational domain theory for sequential functional programming languages. He specializes in programming language semantics and is dedicated to the study of hybrid semantics and their applications in computing. Notably, he solved the open problem that questions the existence of a purely operationally-based proof for the well-known minimal invariance theorem of (nested) recursive types in Fixed Point Calculus. His research interests also include domain theory, exact real arithmetic, category theory, algebra, real analysis and applications of topology in computation theory.