Find Academic Supervisors

• Type Theory
• Dependent Types
• Functional Programming
• +11 more

Andreas Abel is a Senior Lecturer in the Division of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology and the University of Gothenburg. He has previously served as an Assistant Professor at Ludwig-Maximilians-Universität (LMU) Munich and has been a visiting researcher at INRIA in Paris. His primary affiliations are with Chalmers and the University of Gothenburg, where he conducts research and teaches in programming languages and type theory. Chalmers University of Technology, Department of Computer Science and Engineering, Senior Lecturer University of Gothenburg, Division of Computing Science LMU Munich, Assistant Professor (former) INRIA Paris, Visiting Researcher Abel’s research lies at the intersection of type theory, functional programming, and formal verification. He is particularly known for his work on dependent types, normalization by evaluation, and the development of the Agda proof assistant. His interests include constructive logic, logical frameworks, modal and linear typing, program verification, and compiler construction. He leads the Modal Dependent Type Theory project funded by the Swedish Research Council (Vetenskapsrådet) and has contributed to several other major research initiatives in programming language theory. His recent publications reflect a strong focus on foundational aspects of type systems, including cubical type theory, decidability of conversion, and formalization of algebraic completeness. These works appear in top-tier venues such as ICFP, LICS, POPL, and TYPES, showcasing both theoretical depth and practical implementation in Agda. Distinguished Paper Award, ICFP 2019 Editor, Theoretical Pearls column, Journal of Functional Programming Member, IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students and contributes to the research community through program committee memberships for major conferences including LICS, ICFP, and CPP. He is a senior developer of Agda and the maintainer of the BNFC (Backus-Naur Form Compiler) tool. His work bridges theoretical computer science with practical software development for formal methods. He is involved in several research groups and projects, including the Programming Logic Group at Chalmers and the international EUTYPES network. His role as principal investigator and core contributor in multiple funded projects highlights his leadership in the field of programming language foundations.

Andrei PopescuView profile

Senior Lecturer

• Proof assistants
• Information flow security
• Inductive and coinductive datatypes
• +5 more

Andrei Popescu is a Senior Lecturer in Computing Foundations at the School of Computer Science, University of Sheffield, where he also serves as School Programmes Lead (PGT). He is a member of both the Security of Advanced Systems research group and the Foundations of Computation research group. Prior to joining Sheffield in May 2020, he was a Lecturer at Middlesex University and a postdoctoral researcher at TU Munich. Dr. Popescu holds dual PhDs: one in computer science from the University of Illinois at Urbana-Champaign (advised by Elsa L. Gunter and Grigore Roșu) and another in mathematics from the University of Bucharest (advised by George Georgescu). His primary research interests include proof assistants, information flow security, inductive and coinductive datatypes, automated deduction, and syntax with bindings. His work often focuses on the formal verification of security properties in practical systems, as evidenced by projects like CoCon (a conference management system with verified confidentiality) and CoSMeDis (a social media platform with formally verified security guarantees). Analysis of his recent publications reveals a strong focus on foundational aspects of proof assistants, particularly Isabelle/HOL, with significant contributions to syntax with bindings, recursion principles, and the formalization of Gödel's incompleteness theorems. His work bridges theoretical computer science with practical applications in security verification. Scientific Awards: Distinguished paper award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski: Strong Rule Induction for Syntax with Bindings' Distinguished paper award at POPL 2024 for 'Nominal Recursors as Epi-Recursors' Distinguished paper award at POPL 2023 for 'Admissible Types-to-PERs Relativization in Higher-Order Logic' Dr. Popescu has successfully supervised PhD students, including Lorenzo Gheri whose thesis focused on syntax with bindings. He has secured significant research funding, including the COVERT project (EPSRC, £422,585), Security of Digital Twins in Manufacturing (EPSRC, £774,954), and Cyclic Reasoning Mechanisms for Interactive Theorem Proving (Royal Society, £12,000). He is actively involved in the research community, serving on program committees for major conferences including POPL, ITP, CSF, and IJCAR, and co-organizing the Midlands Graduate School. His work with the Security of Advanced Systems group continues to advance the field of formal verification for security-critical systems.

Brigitte PientkaView profile

Professor

• Programming Languages
• Verification
• Type Theory
• +6 more

Brigitte Pientka is a Professor at McGill University's School of Computer Science , where she leads the Computation and Logic group . She earned her PhD from Carnegie Mellon University in 2003 and previously studied at the University of Edinburgh and Technical University of Darmstadt. Education PhD in Computer Science, Carnegie Mellon University (2003) University of Edinburgh Technical University of Darmstadt Research Interests Her work focuses on the theoretical and practical foundations for building reliable software systems, combining logic, type theory, and verification with system-building. Key areas include: Type Theory and Dependent Types Logical Frameworks and Mechanized Metatheory Session-Typed Concurrency and Linear Logic Metaprogramming and Contextual Type Systems Theorem Proving and Formal Verification Functional Programming and Language-Based Security Professional Roles She has served as: PC Chair for ICFP'24 and CPP'24 General Chair for POPL'20 Executive Editor of Logical Methods in Computer Science Steering Committee Member for LICS, POPL, and ESOP Scientific Awards Dr. Pientka has received: Test of Time Award at PPDP'18 Humboldt Fellowship for research at MPI-SWS, Germany Labs & Teams She actively develops the Beluga programming language , a tool for mechanizing meta-theory proofs and type-driven program manipulation.

Stephanie WeirichView profile

Professor

• Programming Languages
• Dependent Types
• Type Systems
• +3 more

Stephanie Weirich is the ENIAC President's Distinguished Professor in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. Her research focuses on programming languages, with emphasis on dependent types, formal verification, and functional programming semantics. She leads Penn's Programming Languages Group (PLClub) and teaches courses including Advanced Programming (CIS 5520) and Programming Languages and Techniques (CIS 120). Research Areas: Her work spans theoretical foundations and practical implementations, including type systems for security, mechanized program verification, cost analysis for lazy evaluation, and language-based techniques for probabilistic programming. Recent projects explore indistinguishability in dependent types and effects systems for resource-aware computation. Honors: SIGPLAN Robin Milner Young Researcher Award (2016) NSF CAREER Award (2004) Microsoft Outstanding Collaborator (2016) Most Influential Paper Award, ICFP (2016) DARPA Computer Science Study Panel (2007-2008) Advising: Mentored 15+ PhD graduates including Richard Eisenberg (2016 Reynolds Award winner) and Vilhelm Sjöberg. Current students work on stratified type theory and mechanized logical relations. Secured grants from NSF and DARPA for research in dependently typed systems. Collaborations: Leads the PLClub research group; collaborates with industry (Microsoft) on Haskell extensions and verification tools like Hs-to-Coq.

• Lambda Calculus
• Functional Programming
• Computational Complexity
• +5 more

Beniamino Accattoli is a Researcher in Computer Science at Inria , where he has been a member of the PARTOUT team since January 2015. His work centers on higher-order computation, particularly the lambda calculus, connecting theoretical mathematics with practical implementations of functional languages. Current Projects : CANofGAS (2022–2025), COCA HOLA (2016–2021). Recent Events : Program Committee member for LSFA 2025, ICFP 2024, and FSCD 2024; lecturer at MPRI 2023–24. Research Themes : Internal : Developing mathematical theories of sharing in lambda calculus to enhance efficiency in functional language implementations. External : Establishing reasonable cost models for time and space in lambda calculus, resolving long-standing open problems in computational complexity. Scientific Awards : Distinguished Paper Award at ICFP 2022. Best Paper Award at RTA 2013. Academic Contributions : Co-inventor of the Linear Substitution Calculus , a canonical framework for higher-order computation with sharing. Proved polynomial equivalence between lambda calculus and Turing machines for time complexity with Ugo Dal Lago. Refuted token-machine conjectures and introduced environment-based machines for space complexity with Ugo Dal Lago and Gabriele Vanoni.

Jon SterlingView profile

Associate Professor

• Programming Languages
• Semantics
• Type Theory
• +5 more

Jon Sterling is an Associate Professor at the Department of Computer Science and Technology, University of Cambridge. His research focuses on foundational aspects of programming languages and semantics, employing advanced mathematical frameworks such as type theory, category theory, domain theory, and topos theory. He is particularly known for contributions to cubical type theory, synthetic computability, and denotational semantics. His teaching responsibilities include lecturing on Discrete Mathematics (Part IA). Sterling's work bridges theoretical computer science and mathematics, emphasizing formal systems that ensure program correctness and computational adequacy. He has contributed to proof assistants like RedPRL and developed novel approaches to reasoning about higher-order store and effectful computations. His recent research explores topics such as univalent reference types, guarded domain theory, and cost-aware logical frameworks. Notable collaborations include work with Carnegie Mellon University and Aarhus University on foundational type-theoretic systems.

• Category Theory
• Type Theory
• Formal Semantics
• +3 more

Dr. Roy Crole is an Associate Professor in the School of Computing and Mathematical Sciences at the University of Leicester. He holds a PhD in Computer Science from the University of Cambridge, where his thesis focused on 'Programming Metalogics with a Fixpoint Type.' After postdoctoral research at Imperial College London (funded by the ESPRIT project) and an EPSRC Fellowship, he joined Leicester in 1994. His academic journey includes studies in Mathematics at Churchill College, Cambridge (MA, MMath), followed by doctoral work under Prof. Andrew Pitts. His research spans Category Theory , Type Theory , and Formal Semantics , with a focus on multi-language systems, categorical logic, and foundational programming language theory. Key research contributions include work on multi-language abstraction, static analysis, and hybrid logical frameworks. His articles explore topics like nominal logic, Yoneda lemmas in category theory, and dependent type systems. Roy has received the SERC (now EPSRC) Open Research Fellowship and has contributed to international workshops on algebraic and coalgebraic methods in program construction. His teaching and supervision span advanced topics in theoretical computer science and mathematics.

• Theory and Semantics of Computation
• Nominal Sets
• Dependent Type Theory
• +4 more

Andrew Pitts is a Professor at the University of Cambridge Computer Laboratory, specializing in the theory and semantics of computation, with a focus on nominal sets and dependent type theory. He is a Fellow of the Royal Society (FRS) and has made significant contributions to the mathematical foundations of programming languages. Research Interests: His work bridges theoretical computer science and mathematical logic, emphasizing nominal techniques, category theory, and homotopy type theory. He explores abstract syntax, inductive types, and the formal verification of computational models. Key Trends in Recent Publications: Recent articles emphasize category theory, type theory, and formal methods, with specific attention to quotient types, modal type theory, and cubical type theory. These works often involve collaborations with researchers in programming language foundations and mathematical logic. Scientific Awards: Fellow of the Royal Society (FRS)

Kazuhiro OgataView profile

Professor

• Programming Languages
• Software Engineering
• Formal Methods
• +5 more

Kazuhiro Ogata is a Professor in the School of Information Science at Japan Advanced Institute of Science and Technology (JAIST). He actively teaches courses such as i116 Basic of Programming, i217 Functional Programming, and i219 Software Design Methodology, indicating a strong commitment to computer science education and curriculum development. Institution: Japan Advanced Institute of Science and Technology (JAIST) School: School of Information Science Position: Professor Email: ogata@jaist.ac.jp Research Laboratory: http://www.jaist.ac.jp/~ogata/lab/ His research interests center on programming languages, software design methodology, formal methods, and compiler construction. He emphasizes formal verification using theorem proving and rewriting logic, particularly with tools like Maude. His work bridges theoretical computer science with practical software engineering and education, focusing on correctness, design patterns, and language semantics. The analysis of his recent publications reveals a consistent focus on formal specification, verification of software systems, and educational tools for programming. His work spans functional programming, concurrent systems, and distributed algorithms, often using rewriting logic as a unifying framework. He integrates formal methods into both research and teaching, promoting rigorous software development practices. No scientific awards are explicitly mentioned in the provided texts. Kazuhiro Ogata advises students through his laboratory at JAIST and has developed structured course materials that suggest active mentorship. While specific grant information is not available, his sustained research output and tool development imply ongoing project funding. He contributes to academic outreach through summer schools and educational frameworks. He leads a research laboratory focused on formal methods and programming language design, fostering a collaborative environment for students and researchers. The lab develops tools for teaching and verifying software systems, emphasizing correctness and educational impact.

• Proof Assistants
• Formal Verification
• Inductive and Coinductive Datatypes
• +12 more

Andrei Popescu is a Senior Lecturer (Associate Professor level) in the Department of Computer Science at the University of Sheffield, where he conducts research in formal methods, proof assistants, and information flow security. He previously held academic positions at Middlesex University and TU Munich. University: University of Sheffield Department: Department of Computer Science Previous Affiliations: Middlesex University, TU Munich His research focuses on the logical foundations and practical applications of proof assistants, particularly Isabelle/HOL. He has made foundational contributions to inductive and coinductive datatypes, syntax with bindings, higher-order logic, and the formal verification of secure systems. His work bridges theoretical logic with real-world systems such as conference management (CoCon) and social media platforms (CoSMeDis). The recent publications highlight a strong trend in formalizing deep logical results (e.g., Gödel’s incompleteness theorems), advancing datatype theory, verifying complex security properties, and applying formal methods to practical systems. His work consistently appears in top-tier venues such as POPL, CAV, ITP, and CSF. Distinguished Paper Award at POPL 2025 Distinguished Paper Award at POPL 2024 Distinguished Paper Award at POPL 2023 RS 3 Best Paper Award for 2012–2013 He has advised PhD students including Lorenzo Gheri and has been actively involved in organizing major academic events such as the Midlands Graduate School, CPP, ITP, and TABLEAUX conferences. He has served on numerous program committees including POPL, ITP, CSF, and CAV, and has led research projects funded by VeTSS and industrial partners. He is a key contributor to the Isabelle proof assistant ecosystem, particularly in the development of the (co)datatype package and foundational consistency results. His work combines deep theoretical insight with practical implementation, making significant impacts in both academia and applied security.

James CheneyView profile

Professor

• Databases and data provenance
• Programming languages and compilers
• Generic programming
• +7 more

James Cheney is a Personal Chair of Programming Languages and Systems at the University of Edinburgh, working in the Laboratory for Foundations of Computer Science within the School of Informatics. He leads the Principles of Provenance research group and has been a Turing Fellow from 2018 to 2023. His educational background includes a PhD in Computer Science from Cornell University (2004), an MS in Mathematics from Carnegie Mellon University (1998), and a BS in Computer Science and Mathematics from Carnegie Mellon University (1998). Cheney's research focuses on the intersection of databases and programming languages, with particular emphasis on data provenance. His work spans several key areas: Databases and data provenance Programming languages and compilers Generic programming Logic and automated theorem proving Compression and information theory XML and related technologies His recent publications demonstrate a strong focus on language-integrated query systems, type systems for programming languages, and formal approaches to data provenance. These works often bridge theoretical foundations with practical applications in database systems and programming language design. Cheney has received several notable awards and recognitions: Royal Society University Research Fellowship (2008-2016) Turing Fellow (2018-2023) ERC Consolidator Grant for the Skye project (2016-2021) Google Research Award for Language-integrated provenance As an advisor, Cheney has supervised numerous PhD students and postdoctoral researchers who have gone on to positions at institutions including New York University, LSE, University of Southampton, Meta, and others. His research has been supported by various grants from DARPA, EPSRC, AFOSR, EU FP7, and industry partners including Google, Microsoft Research, and Huawei. Cheney leads the Principles of Provenance group, which conducts fundamental research on data provenance and its applications in security, data curation, and scientific computing. The group has worked on projects including Skye (a programming language for scientific data curation), ADAPT (a DARPA-funded project on advanced persistent threat prevention), and language-integrated provenance systems.

Kenichi AsaiView profile

Professor

• Partial Evaluation
• Continuation
• Reflection
• +6 more

Kenichi Asai is a Professor in the Department of Information Science, Faculty of Science at Ochanomizu University . His research focuses on functional programming languages, type systems, and program analysis tools. Research Interests: Partial evaluation, continuations, reflection, type debugging, and algebraic effects. Projects: Developed the OCaml Type Debugger to improve error messages through interactive debugging. Conference Involvement: Active in PEPM, ICFP, and ML workshops as author, session chair, and committee member. The articles analyzed show expertise in type theory , continuation handling , and functional language design across OCaml and its extensions. Keywords include type debugging , metaOCaml , and algebraic effects . Scientific Awards: Peter Landin Prize (2013) for "An Embedded Type Debugger" Students: Collaborated with Yuki Ishii and Kanae Tsushima on type systems and functional programming education.

Yuting WangView profile

Associate Professor

• Formal Verification
• Programming Languages
• Proof Theory
• +5 more

Yuting Wang is a Tenure-Track Associate Professor at Shanghai Jiao Tong University , specifically affiliated with the John Hopcroft Center for Computer Science. Their research focuses on Formal Verification , Programming Languages , and Logical Frameworks , with significant contributions to verified compilation of system software. Core developer of the Abella theorem prover for higher-order reasoning Lead developer of Stack-Aware CompCert extensions Committee member for conferences like C++ (CPP), Programming Language Foundations in Software Engineering (PLDI), and Practical Aspects of Declarative Languages (PADL) Current research includes verifying compilers for concurrent systems, designing secure programming languages, and developing compositional verification frameworks. Collaborations with institutions like Yale University and the University of Minnesota under notable advisors Zhong Shao and Gopalan Nadathur have produced 15+ peer-reviewed publications. Their work on CompCertOC demonstrates verified compositional compilation for multi-threaded programs, while their contributions to the Abella system enhance schematic polymorphism and higher-order abstract syntax support. Yuting Wang actively advises a team of 5 current Ph.D. and M.S. students, with alumni placed at organizations like Tencent and AMD. They maintain a public ORCID profile and welcome prospective students interested in formal methods and systems verification.

Graham HuttonView profile

Professor

• Mathematics of program construction
• Functional programming
• Programming language semantics
• +6 more

Graham Hutton is a Professor of Computer Science at the University of Nottingham , where he leads the Functional Programming Lab and serves as Director of the Midlands Graduate School . He co-founded the Quotient Haskell project and maintains key roles in Journal of Functional Programming editorial work and Haskell Foundation governance. Co-leader, Functional Programming Lab (2008–date) Director, Midlands Graduate School (2023–date) ACM Distinguished Scientist Principal investigator for £912k EPSRC project (2024–2027) His research focuses on mathematical approaches to program construction , particularly through functional languages like Haskell and Agda . He develops techniques for compiler correctness , type system design , and program optimization , with recent work on quotient polymorphism and denotational cost models . Key article themes include: Compiler derivation from formal semantics Effect handling in functional languages Graph-based code generation over traditional tree structures Quotient type systems with SMT solver integration Concurrency semantics using choice trees Operational improvement with parametric polymorphism Scientific awards include: ACM Distinguished Scientist (2013) Best Paper & Best Student Paper (2018) EPSRC funding for compiler correctness projects He advises current PhD students in compiler calculation and memory safety , while maintaining extensive educational contributions through his widely-used textbook Programming in Haskell and open course materials.

Ian StarkView profile

Senior Lecturer

• Programming Languages
• Theoretical Computer Science
• Concurrency Theory
• +15 more

Ian Stark is a Senior Lecturer in Computer Science at the School of Informatics , The University of Edinburgh , and a key member of the Laboratory for Foundations of Computer Science (LFCS) . His research centers on mathematical models of programming languages and concurrent systems, with a focus on reasoning about name generation and secure mobile code. Research Interests: Ian Stark's work lies at the intersection of theoretical computer science and programming language semantics. He investigates foundational models such as the π-calculus and nu-calculus, applying them to problems in security, resource management, and systems biology. His research in denotational and operational semantics provides rigorous frameworks for understanding program behavior, particularly in systems with dynamic name creation and local state. He has made significant contributions to proof-carrying code and resource guarantees for mobile and embedded systems, ensuring safety and security through formal methods. The trends in his publications over the last 15 years show a consistent focus on foundational models for concurrency and security. Early work established semantic models for the π-calculus, while later research applied these to practical domains like mobile code security and systems biology. His articles frequently appear in top venues like LICS, FOSSACS, and TCS, reflecting a strong theoretical grounding with applications in verification and language design. Scientific Recognition: Advising and Funding: Stark has supervised several PhD students, including Marek Kwiatkowski, Chris Banks, Uli Schöpp, Sam Lindley, and Tom Chothia. He has been involved in major collaborative research projects such as REMS (Rigorous Engineering for Mainstream Systems), App Guarden (Resilient Application Stores), CerCo (Certified Complexity), and Mobius (Proof-Carrying Code), funded by the EPSRC and the European Union. He actively recruits PhD students, particularly through the Centre for Doctoral Training in Pervasive Parallelism. Labs and Teams: He is a core member of the Laboratory for Foundations of Computer Science (LFCS) , a world-renowned research group at the University of Edinburgh focused on the mathematical foundations of computing. His work often involves collaboration with researchers across Europe in the areas of programming languages, semantics, and formal verification.