Tom Schrijvers is a Professor at the Department of Computer Science, Faculty of Engineering Science, KU Leuven. His research focuses on programming language theory, functional programming, logic programming, and computational effects. Advancing multi-stage programming with computational effects (2024–2028) Generating Educational Feedback with Program Analysis (2024–2028) Programino: An Educational Programming Platform (2023–2027) eTeacher: Interactive web-based programming education platform (2023–2025) AmPERSand: Programming Education Runtime System (2023–2026) His recent publications emphasize bidirectional transformations, effect handlers, and programming education tools. He collaborates extensively with British institutions like Imperial College London and works on the book Language Engineering in Haskell with Dr. Nicolas Wu.
Margarita María Alonso Ramos is a Professor in the Department of Letters at the Faculty of Philology, University of A Coruña. She serves as Coordinator of the Language and Information Society research group and has been actively teaching various linguistics courses including General Linguistics, Languages and Technologies, and Languages of the World across multiple degree programs in Spanish, Galician-Portuguese, and English Linguistic and Literary Studies. General Linguistics (36 hours) Languages and Technologies (31.5 hours) Languages of the World (15.5 hours) Models and Methods in Current Linguistics (21 hours) Her research focuses on lexicography, Spanish as a foreign language, and computational linguistics, with particular emphasis on phraseology, lexical combinations, and corpus-based linguistic analysis. Her work bridges theoretical linguistics with practical language teaching applications, especially in the context of Spanish language learning. Analysis of her publication record shows a strong focus on lexicography and phraseology across multiple languages, with particular attention to Spanish language resources and computational approaches. Her research demonstrates consistent collaboration with international scholars, reflecting the global nature of linguistic research in the digital age. Professor Alonso Ramos has directed doctoral theses for students including Ana Orol González, Eleonora Guzzi, Orsolya Vincze, and Marta Rebolledo Lemus. She has secured numerous research grants from national and regional funding bodies including the Ministry of Education, Science, Universities and Vocational Training, and the Ministry of Science and Innovation. She coordinates the Language and Information Society research group, which focuses on the intersection of linguistic theory, language teaching, and digital technologies. Her work has significant implications for language teaching methodologies, dictionary compilation, and natural language processing applications for Spanish and related languages.
Anne Baanen is a Lecturer in the Department of Computer Science at the Faculty of Science, Vrije Universiteit Amsterdam. They recently completed their PhD in theoretical computer science under the supervision of Jasmin Blanchette and Sander Dahmen as part of the Lean Forward project. Their current teaching responsibilities include coordinating the Logic and Modelling course and supervising projects in Computer Assisted Proofs. Their educational background includes double majors in Computing Science and Mathematics for both Bachelor's and Master's degrees at Utrecht University. During their time at Utrecht, they were active in student organizations, serving as chair of the programming committee WebCie and the LGBT+ organization TrotCie, while also contributing to the student newspaper de Vakidioot. Dr. Baanen's research operates at the intersection of computing science and mathematics, spanning intuitionistic logic, type theory, formal verification, and functional programming. Their work heavily involves the Lean theorem prover, focusing on formalizing advanced mathematical concepts like algebraic number theory, Dedekind domains, and class groups. They are particularly interested in the design of morphisms and substructures in dependent type theory, as evidenced by their presentations on bundling in type theory. Analysis of their publication record shows a consistent focus on formalizing mathematical structures using the Lean theorem prover, with particular emphasis on algebraic number theory and the design of effective type class systems. Their work bridges theoretical computer science and advanced mathematics, contributing to both the formal methods community and mathematical research. Dr. Baanen is also active in sustainable ecology, LGBT+ rights advocacy, and software freedom movements. Their teaching portfolio spans from Logical Verification to Grondslagen van de Wiskunde (Foundations of Mathematics), demonstrating both breadth and depth in computer science education. They have presented at numerous international conferences including CPP, ITP, IJCAR, and ICFP, establishing themselves as an emerging researcher in formal methods. Based in Amsterdam, they maintain an active research profile while contributing to the academic community through teaching and conference organization, including co-organizing the Formalization of Cohomology Theories workshop at BIRS in Banff, Canada.
Claudio Sacerdoti Coen is an Associate Professor in Computer Science at the Department of Computer Science and Engineering , University of Bologna. His research focuses on Mathematical Knowledge Management , Interactive Theorem Proving , and their applications to functional programming languages and markup languages like XML and MathML. He has led the DAMA project for didactic applications of theorem provers. Employment: Associate Professor (2017–present), previously Lecturer (2007–2017) Education: Ph.D. in Computer Science (University of Bologna, 2004), Master’s in Computer Science (2000) Research Interests include: Integration of XML-based Mathematical Knowledge Management with Interactive Theorem Provers (e.g., Coq, Matita) Reduction strategies in the Calculus of (Co)Inductive Constructions Formal verification of algorithms and compilers Constructive analysis and formal topology User interface design for proof assistants Publications over the last decade highlight advancements in: Efficient substitution mechanisms for lambda calculi Formalization of mathematical theorems (e.g., Lebesgue’s Dominated Convergence Theorem) Development of proof assistant frameworks (Matita kernel, ELPI interpreter) Mathematical document structuring and search engine design
Ken Friis Larsen is an Associate Professor at the Department of Computer Science (DIKU), University of Copenhagen, specializing in programming languages, security, privacy, and functional programming. He contributes to projects like HIPERFIT (high-performance financial computing) and WallViz (visualization tools). Research Focus : Language design, formal methods, functional programming (Standard ML, Haskell, OCaml, Scheme), secure compilation, and performance optimization. Technical Leadership : Maintains Moscow ML (Standard ML implementation) and mGTK (functional GUI library). Key Publications : 2020: Hermes (secure compilation without side-channels) 2019: F (music composition language) 2016: Redomap (GPGPU performance in Futhark) Additional Contributions : Co-developed PaML (parser combinators in SML) Active participant in ICFP Programming Contest (2005, 2008, 2017) Advocate for rigorous testing practices (QuickCheck, Criterion) and type-driven design
Michael Hicks is a Professor in the Department of Computer and Information Science at the University of Pennsylvania and an Amazon Scholar. Previously, he was a Professor at the University of Maryland (2002-2021) and Senior Principal Scientist at Amazon Web Services (2022-2025). He co-founded the Programming Languages research lab (PLUM) at Maryland and was its director, as well as Director of the Maryland Cybersecurity Center (MC2). He is a Fellow of the Association of Computing Machinery (ACM), former Chair of ACM SIGPLAN, and Editor-in-Chief of Proceedings of the ACM on Programming Languages (PACMPL). His research focuses on programming languages and their application to software security , quantum programming , and formal verification . He has pioneered dynamic software updating techniques, developed tools like Checked C for memory safety, and co-designed the Cedar authorization policy language at AWS. In quantum computing, he works on verified compilers like VOQC and Qunity to ensure reliability and correctness. His recent work trends include quantum programming languages , secure multi-party computation (e.g., Wysteria , Symphony ), and fuzz testing methodologies . He has contributed to formal verification for quantum programs and language-based security frameworks. Scientific Awards include: ACM Fellow He has advised numerous PhD and Master’s students , including James Parker, Andrew Ruef, Kesha Hietala, and Aseem Rastogi, who now hold academic and industry positions. His lab, PLUM , has been instrumental in advancing programming languages research.
Sandrine Blazy is a Professor at the University of Rennes , where she teaches mechanized semantics (in Coq), functional programming (in OCaml), formal methods (using Why3), and software vulnerabilities. She is a member of the CELTIQUE and Epicure project-teams, both affiliated with Inria Rennes and IRISA laboratory. Her research focuses on formal verification of compilers and program transformations, notably through the CompCert compiler and Versaco static analyzer. Education : HDR (Habilitation à Diriger des Recherches) in Computer Science, Université d'Évry Val d'Essonne (2008). Research Interests : Her work ensures mathematical guarantees in compiler correctness, preventing security bugs during program translation. She specializes in deductive verification , static analysis , and software security , with applications in critical systems like avionics and cryptography. Scientific Awards : CNRS Silver Medal (2023) Lucas Award from Formal Methods Europe (2023) ACM SIGPLAN Programming Languages Software Award (2022) ACM Software System Award (2021) Best Paper Award at FMTea 2014 La Recherche Award in Information Sciences (2011) Advising and Grants : She has advised numerous PhD students (e.g., Solène Mirliaz, Aurèle Barrière) and led research projects like Scrypt (secure compilation for cryptography), ERC VESTA (verified static analysis), and VERASCO (formal verification of compilers). Her grants include ANR and FNRAE funding. Labs and Teams : Actively involved in IRISA CNRS UMR 6074 as deputy director (2021), and collaborates with Inria Rennes and CNRS project teams.
Tobias Nipkow is a full Professor at the Faculty of Informatics, Technical University of Munich (TUM), Germany, where he leads the Theorem Proving Group and maintains active academic duties as evidenced by ongoing conference commitments through 2026. His office is located at Boltzmannstr. 3, 85748 Garching, with contact email nipkow@in.tum.de and office hours held Wednesdays 11:00-12:00 during semester periods. Nipkow serves on CPP Steering Committees (2015-2026) and Program Committees (2018, 2023), reflecting sustained leadership in programming language research. His seminal work spans term rewriting systems and theorem proving, established through the authoritative text Term Rewriting and All That (Cambridge University Press, 1998). Current research emphasizes formal verification using Isabelle/HOL, with extensions into verified functional algorithms ( Functional Algorithms, Verified! ), concrete semantics education, and probabilistic program verification. This integrates theoretical computer science with practical proof assistant applications, focusing on termination, confluence, and unification in rewriting systems. Recent publications demonstrate a clear trajectory toward educational applications of formal methods and foundational data structure verification. The 2021 CPP invited talk explores proof assistants for teaching algorithms, while the 2020 CPP proof pearl formalizes Braun trees using Isabelle. Earlier work like the 2015 ESOP paper on verified probability density compilers shows consistent themes of mechanized semantics and verification. These outputs highlight his dedication to bridging theoretical concepts with classroom and industrial practice. Nipkow directs TUM's Theorem Proving Group, the core development team for the Isabelle interactive proof assistant. The group maintains the Archive of Formal Proofs (isa-afp.org), a major repository of formalized mathematics, and organizes annual Isabelle Workshops. Their work underpins verification projects across academia and industry, with direct influence on ITP and CPP conference series through leadership roles and tutorial development.
Kazuhiko Sakaguchi is a Researcher affiliated with CNRS (French National Centre for Scientific Research), École Normale Supérieure de Lyon (ENS Lyon) , and Université Claude Bernard Lyon 1 , working at the Laboratoire de l'Informatique du Parallélisme (LIP, UMR 5668) . His primary research focuses on foundational aspects of programming languages and formal verification. Research Interests: Sakaguchi specializes in interactive theorem proving (particularly using Coq), formalization of mathematics , and proof by reflection . His work bridges theoretical computer science and practical tool development, with applications in algorithm verification, algebraic hierarchies, and dependent type systems. Publication Trends: His recent articles emphasize formal verification of algorithms (e.g., mergesort correctness), design patterns for mathematical structures in proof assistants, and program extraction techniques. A consistent theme is enhancing productivity in theorem proving through reusable abstractions and automated tactics.
Oded Padon is a Senior Scientist (≈Assistant Professor) at the Weizmann Institute of Science , affiliated with the Faculty of Mathematics and Computer Science . He joined Weizmann in September 2024 after prior roles as a researcher at VMware Research Group , a postdoc in Alex Aiken's group at Stanford University , and a PhD student at Tel Aviv University under Mooly Sagiv . Research Interests : Oded's work focuses on developing principled algorithms for automated verification of complex systems, particularly distributed protocols, storage systems, and cluster management. He emphasizes decidable logics, primal-dual methods, and decomposition techniques. His recent interests include verification of deep neural networks , quantum computing , and leveraging large language models for verification tasks. Key projects: Ivy (safety/liveness verification), mypyvy (invariant inference), Verus (Rust verification), TASO (deep learning optimization), Quartz (quantum circuit superoptimizer). Scientific Awards : Azrieli Early Career Faculty Fellowship 2020 ETAPS Doctoral Dissertation Award 2017 Google PhD Fellowship in Programming Languages Radhia Cousot Young Researcher Best Paper Award (SAS 2017) Publications span decidable verification, invariant inference, quantum optimization, and machine learning for verification. His work has received Jay Lepreau Best Paper Award at SOSP 2024 (Anvil) and Distinguished Paper Awards at POPL 2024 (An Infinite Needle) and OOPSLA 2023 (Leaf).
Bernardo Toninho is an Assistant Professor at the School of Science and Technology, NOVA University of Lisbon, with a research focus on type theory and its applications to concurrent and distributed systems. He is affiliated with NOVA-LINCS and actively works on session types, linear logic, and program verification in languages like Go, Rust, and Haskell. Research interests include Type Theory, Programming Languages, Linear Logic, and Meta-programming Current teaching: Concurrent Programming Languages, Introduction to Programming (Fall 2022) Organizer of Programming Languages Mentoring Workshop (PLMW) at POPL 2019 Judge for Student Research Competition at SPLASH 2019 His work on Refinement Kinds (with Luís Caires) explores type-safe meta-programming by extending refinement types to the kind level. Articles highlight his contributions to session type theory, type systems for concurrency, and formal verification of channel-based communication. Scientific Awards Distinguished Reviewer Award (ESOP 2022) He has served on program committees for OOPSLA, ICFP, ESOP, and CONCUR, and contributed to foundational work in session types and linear logic. Projects include GOLEM (funded research) and Featherweight Go (formalization of Go's concurrency model).
KC Sivaramakrishnan is an Assistant Professor at Indian Institute of Technology Madras and concurrently serves as CTO of Tarides. He works at the intersection of programming languages and systems, focusing on concurrency, distributed systems, and OCaml runtime development. Primary Affiliation: Indian Institute of Technology Madras Co-founder: Tarides His research explores: Concurrency and parallelism in OCaml Effect handlers for modular programming Mergeable Replicated Data Types for distributed systems Weak memory models and consistency guarantees Lock-free algorithms and safe multicore programming Recent publications focus on OCaml 5.0's concurrency features, effect handler integration, and verified CRDT implementations. He contributes to compiler design, runtime optimization, and testing frameworks for multicore systems. Service roles include committee memberships in SPLASH, ICFP, OCaml, and PROPL conferences. He actively bridges functional programming with systems research through practical implementations.
Satnam Singh is a Professor at Newcastle University's School of Electrical and Electronic Engineering, UK. With a research career spanning over three decades from 1989 to present, Singh has established himself as a leading expert in hardware design, FPGA programming, and parallel computing systems. His research interests focus on hardware-software co-design , reconfigurable computing , and functional programming applications for hardware design. Singh has pioneered work in using functional languages like Haskell for hardware description and verification, particularly through his contributions to the Lava hardware description language. His work bridges theoretical computer science with practical hardware implementation challenges. Analysis of his publication history reveals a clear evolution from early work on formal verification and FPGA design in the 1990s, through substantial contributions to parallel programming models in the 2000s, to more recent applications of machine learning techniques in diverse domains including cheminformatics and sensory systems. His 2022-2025 publications demonstrate continued innovation in specialized processor programming, AI applications for olfactory systems, and health hazard classification using deep learning. Singh has maintained extensive collaborations throughout his career, notably with Krishna R. Pattipati (15 joint publications), Anuradha Kodali (8 publications), and David J. Greaves (5 publications), reflecting his ability to bridge theoretical computer science with practical engineering applications. His work spans multiple prestigious venues including FPGA, FCCM, ICFP, and IEEE Transactions on Systems, Man, and Cybernetics, demonstrating both theoretical depth and practical impact across computer architecture, programming languages, and applied machine learning domains.
Xavier Leroy is a Professor of Software Sciences at Collège de France and a senior computer scientist at Inria's Cambium research team. He is a member of the French Académie des sciences and internationally recognized for his work on functional programming, formal verification, and compiler design. Specializes in OCaml language development, Coq verification, and language-based security Leader of the CompCert formally-verified compiler project Received multiple ACM awards for software systems and programming languages achievement His research focuses on foundational aspects of programming languages, including type systems, concurrency, and algebraic effects. Recent work explores mechanized semantics, well-founded recursion, and persistent data structures. Key article trends include formal verification of compilers, functional data structure optimization, and effect handler implementation. Awards highlight community recognition of his 30+ year contributions to OCaml and CompCert. Notable Appointments: 2018–present: Professor, Collège de France (software sciences chair) Pre-2018: Senior Scientist, Inria
Dr. Michael Szvetits is a Lecturer and Researcher at the Institute of Computer Sciences at the University of Applied Sciences Wiener Neustadt. He holds a PhD in Computer Science from the University of Vienna (2019), an MSc in Computer Science (2012), and a BSc in Information Technology (2010), all from the University of Applied Sciences Wiener Neustadt. His research focuses on software architecture, domain-specific languages, model-driven software development, functional programming, logic programming, and compiler construction. He has contributed to projects such as 'Care about Care' (C^C), which aims to enhance home care through ICT solutions, and 'CARU cares,' which integrates emergency call systems with care documentation tools. His publications span topics like runtime event analysis, model-driven engineering, and software architecture decisions. He collaborates on initiatives funded by the FFG and Active Assisted Living Programme. Dr. Szvetits is actively involved in research projects targeting healthcare technology, software systems optimization, and innovation in assistive living solutions.
