Rate My Professor Cezary Kaliszyk

Cezary Kaliszyk is Professor in Theoretical Computing Science in the School of Computing and Information Systems, Faculty of Engineering and Information Technology at the University of Melbourne, a position he took up in July 2024. Prior to this appointment, he was Associate Professor in the Computational Logic Group at the University of Innsbruck from February 2012 to June 2024. Kaliszyk earned his PhD from Radboud University Nijmegen in September 2009 with the dissertation "Correctness and Availability: Building Computer Algebra on top of Proof Assistants and making Proof Assistants available over the Web." He completed his Master's degree at Warsaw University in 2005 and received his Habilitation in February 2016 on "Learning-Assisted Automated Reasoning."

His research specializes in foundations of computer science, formal methods, and learning for reasoning, with key contributions to automated reasoning, proof assistant automation, interactive theorem proving, formalized mathematics, and AI in mathematics. As Principal Investigator, he leads the AI4Math DEEPER project, awarded a $1.5 million (USD $1 million) grant by the AI for Math Fund in 2025 to develop AI-based guidance for automated reasoning and integrate it into proof assistants. Other projects include the ERC FormalWeb3, ERC SMART developing CoqHammer and Tactician, FWF P26201 for HOL(y)Hammer, JSPS P10044, NWO MathWiki, SURF ProofWeb, and EuroProofNet where he led WG5 until 2024. He has developed tools such as HOL(y)Hammer, HOL Import, and Nominal Isabelle. Notable publications include "Hammer for Coq: Automation for Dependent Type Theory" (2018), "Learning-Assisted Automated Reasoning with Flyspeck" (2014), "TacticToe: Learning to Prove with Tactics" (Journal of Automated Reasoning, 2021), "Combining Higher-Order Logic with Set Theory Formalizations" (Journal of Automated Reasoning, 2023), "Automated Strategy Invention for Confluence of Term Rewrite Systems" (IJCAI 2025), and "The Dependently Typed Higher-Order Form for the TPTP World" (FroCoS 2025). Kaliszyk has supervised PhD students including Stanisław Purgał and Liao Zhang, and teaches courses like Algorithms and Complexity, Models of Computation, Automated Reasoning, and Machine Learning for Theorem Proving.